I'm pleased to announce (yet another) package for processing text with regular expressions: regex-xmlschema The W3C XML Schema specification (http://www.w3.org/TR/xmlschema11-2/#regexs) defines a language for regular expressions. This language is used in the XML Schema spec when defining the data type library part. This regex-xmlschema package contains a complete implementation of this spec. It is implemented with the technique of derivations of regular expression. Main features are: * full support of Unicode including all Unicode code blocks and character properties * a purely functional interface * 100% Haskell, no other packages except parsec needed * cabal build file * extensions for intersection, set difference, exclusive or and interleave of regular sets (regular expressions), * extensions for subexpression matches * functions for matching, for grep like searching, for stream like editing (sed like) and for tokenizing. With this package, it becomes rather easy to build lightweight tokenizers e.g. for colourizing arbitrary programming languages, like hscolor does it for Haskell. The package is available from Hackage: "http://hackage.haskell.org/cgi-bin/hackage-scripts/package/regex-xmlschema", there's a darcs repo for the latest source: "http://darcs2.fh-wedel.de/hxt/regex/" and a wiki page, describing the extension and giving some examples for using the library: "http://www.haskell.org/haskellwiki/Regular_expressions_for_XML_Schema" Cheers, Uwe -- Uwe Schmidt FH Wedel http://www.fh-wedel.de/~si/