hxt-regex-xmlschema

A regular expression library for W3C XML Schema regular expressions

http://www.haskell.org/haskellwiki/Regular_expressions_for_XML_Schema

Version on this page:	9.2.0@rev:1
LTS Haskell 20.23:	9.2.0.7
Stackage Nightly 2023-05-29:	9.2.0.7
Latest on Hackage:	9.2.0.7

See all snapshots hxt-regex-xmlschema appears in

MIT licensed by Uwe Schmidt

Maintained by Uwe Schmidt

This version can be pinned in stack with:hxt-regex-xmlschema-9.2.0@sha256:04808455fd363aa6530c76ad5eadd76a5f9d3f47114a6dc9b8a0c058f3a32bb6,3942

Module documentation for 9.2.0

Text
- Text.Regex
  - Text.Regex.Glob
    - Text.Regex.Glob.Generic
      - Text.Regex.Glob.Generic.RegexParser
    - Text.Regex.Glob.String
  - Text.Regex.XMLSchema
    - Text.Regex.XMLSchema.Generic
      - Text.Regex.XMLSchema.Generic.Matching
      - Text.Regex.XMLSchema.Generic.Regex
      - Text.Regex.XMLSchema.Generic.RegexParser
      - Text.Regex.XMLSchema.Generic.StringLike
    - Text.Regex.XMLSchema.String

Depends on 5 packages(full list with versions):

base, bytestring, hxt-charproperties, parsec, text

Used by 2 packages in lts-0.7(full list with versions):

hxt, hxt-relaxng

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