Regex +package

package regex-applicative
package
regex-applicative is a Haskell library for parsing using regular expressions. Parsers can be built using Applicative interface. Version 0.3.0.2
package regex-base
package
Interface API for regex-posix,pcre,parsec,tdfa,dfa Version 0.93.2
package regex-compat
package
One module layer over regex-posix to replace Text.Regex Version 0.95.1
package regex-compat-tdfa
package
One module layer over regex-tdfa to replace Text.Regex. regex-compat can't use Unicode characters correctly because of using regex-posix. This is not good for Unicode users. I modified regex-compat to use regex-tdfa for solving today's problem. Version 0.95.1.4
package regex-deriv
package
Regex algorithm implementation using derivatives. Version 0.0.4
package regex-dfa
package
The lazy DFA engine, based on CTKLight, for regex-base Version 0.91
package regex-genex
package
From a regex, generate all possible strings it can match Version 0.6.0
package regex-parsec
package
A better performance, lazy, powerful replacement of Text.Regex and JRegex Version 0.90
package regex-pcre
package
The PCRE backend to accompany regex-base, see www.pcre.org Version 0.94.4
package regex-pcre-builtin
package
The PCRE backend to accompany regex-base, with bundled code from www.pcre.org Version 0.94.4.7.8.31
package regex-pderiv
package
Regex algorithm implementation using partial derivatives. The svn source also shipped with two other referential implementations, e.g. Thomspon NFA and Glushkov NFA. For more detail please check out http:code.google.compxhaskell-library/ Version 0.1.3
package regex-posix
package
The posix regex backend for regex-base Version 0.95.2
package regex-posix-unittest
package
Most platforms have a buggy system regex library and this probes the bugs by using the regex-posix package, run with "regex-posix-unittest" Version 1.1
package regex-tdfa
package
A new all Haskell "tagged" DFA regex engine, inspired by libtre Version 1.1.8
package regex-tdfa-text
package
This provides text interface for regex-tdfa. This should be part of regex-tdfa package. But my patches are not accepted yet. So, I made a separate package. If you are interested in my patches, see http://hub.darcs.net/shelarcy/regex-base and http://hub.darcs.net/shelarcy/regex-tdfa. Version 1.0.0.2
package regex-tdfa-unittest
package
Apply regex-posix-unittest tests to regex-tdfa Version 1.1
package regex-tdfa-utf8
package
This combines regex-tdfa with utf8-string to allow searching over UTF8 encoded lazy bytestrings. Version 1.0
package regex-tre
package
The TRE backend to accompany regex-base Version 0.91
package regex-xmlschema
package
This library supports full W3C XML Schema regular expressions inclusive all Unicode character sets and blocks. The complete grammar can be found under http://www.w3.org/TR/xmlschema11-2/#regexs. It is implemented by the technique of derivations of regular expressions. The W3C syntax is extended to support not only union of regular sets, but also intersection, set difference, exor. Matching of subexpressions is also supported. The library can be used for constricting lightweight scanners and tokenizers. It is a standalone library, no external regex libraries are used. Version 0.1.5
package regexchar
package
Provides a POSIX, extended regex-engine, specialised from the underlying polymorphic package regexdot, to merely process the traditional character-lists. Version 0.9.0.10

Show more results