A regular expression library for W3C XML Schema regular expressions
|Version on this page:||184.108.40.206|
|LTS Haskell 19.13:||220.127.116.11|
|Stackage Nightly 2022-06-25:||18.104.22.168|
|Latest on Hackage:||22.214.171.124|
Module documentation for 126.96.36.199
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.
Extensions in 9.2: The library does nor only support String's, but also ByteString's and Text in strict and lazy variants