[Haskell-cafe] regular expression sub-expression matching

[Nicolas Bock]

Hello list,

I was wondering whether there is a way to do what the following python code
does in haskell:

import re

result = re.compile("M\(([0-9]+),([0-9]+)\) *=
*([0-9.eE-]+);").search("M(1,2) = 0.1e-3;")
if result:
  print(result.group(1), result.group(2), result.group(3))

Basically I would like to pattern match parts of a string and return the
matches. I have looked at Text.Regex.Posix but (of course I might just not
have understood the functions in there properly) it seems as if it does not
provide anything like python's re module.

Thanks already,

nick
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20130118/85acea20/attachment.htm>