[Haskell-cafe] [haskell-cafe] Non-greedy match in Text.Regx.Posix
doug at cs.dartmouth.edu
Tue Jul 17 21:08:31 CEST 2012
> I was exploring Text.Regex.Posix and found that I was not able to do a
non-greedy match by modifying the quantifier with a "?". How can I achieve
non-greedy match in Text.Regex.Posix?
If it's Posix, it is greedy. Successive submatches are as long as
possible subject to the constraint that a longest possible overall match
be found if such exists.
More information about the Haskell-Cafe