Difference between revisions of "Regular expressions"
Jump to navigation
Jump to search
BrettGiles (talk | contribs) m (RegularExpressions moved to Regular expressions) |
BrettGiles (talk | contribs) (Adding Chris's tdfa) |
||
| Line 1: | Line 1: | ||
| + | [[Category:Libraries]] |
||
| + | |||
| + | |||
| + | |||
| + | ==Release of regex-tdfa== |
||
| + | |||
| + | |||
| + | Chris Kuklewicz has just released <code>regex-tdfa</code>, (Tagged Deterministic Finite Automata), a new library that works with [[GHC |GHC 6.6]]. It is POSIX compliant and tested against |
||
| + | [http://www.research.att.com/~gsf/testregex/testregex.html the ATT tests]. |
||
| + | |||
| + | ===DARCS=== |
||
| + | Get it at: |
||
| + | Version 0.56, "stable" location at |
||
| + | darcs get --partial darcs.haskell.org:/home/darcs/packages/regex-tdfa |
||
| + | The version that will get updated and broken more often is "unstable" at |
||
| + | darcs get --partial darcs.haskell.org:/home/darcs/packages/regex-unstable/regex-tdfa |
||
| + | |||
| + | ==Original proposal content of this article== |
||
I just came across [http://swtch.com/~rsc/regexp/regexp1.html this article on Thompson Non-Finite Automata] which presents an alternative implementation (to the one supposedly used in perl, ruby, python) which is MAAANY times faster. |
I just came across [http://swtch.com/~rsc/regexp/regexp1.html this article on Thompson Non-Finite Automata] which presents an alternative implementation (to the one supposedly used in perl, ruby, python) which is MAAANY times faster. |
||
Seing how badly we did in the shootout initially, wouldn't it be grand if "we" implemented this algorithm and could then outrun every other language WRT regular expressions, with a native haskell library... |
Seing how badly we did in the shootout initially, wouldn't it be grand if "we" implemented this algorithm and could then outrun every other language WRT regular expressions, with a native haskell library... |
||
| − | |||
| − | {{stub}} |
||
Revision as of 16:37, 29 January 2007
Release of regex-tdfa
Chris Kuklewicz has just released regex-tdfa, (Tagged Deterministic Finite Automata), a new library that works with GHC 6.6. It is POSIX compliant and tested against
the ATT tests.
DARCS
Get it at: Version 0.56, "stable" location at
darcs get --partial darcs.haskell.org:/home/darcs/packages/regex-tdfa
The version that will get updated and broken more often is "unstable" at
darcs get --partial darcs.haskell.org:/home/darcs/packages/regex-unstable/regex-tdfa
Original proposal content of this article
I just came across this article on Thompson Non-Finite Automata which presents an alternative implementation (to the one supposedly used in perl, ruby, python) which is MAAANY times faster.
Seing how badly we did in the shootout initially, wouldn't it be grand if "we" implemented this algorithm and could then outrun every other language WRT regular expressions, with a native haskell library...