Hi all,
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?
Regards,
Kashyap
___
Haskell-Cafe mailing list
* C K Kashyap ckkash...@gmail.com [2012-07-17 13:31:05+0530]
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?
POSIX regular expressions semantics doesn't have a
Thanks Roman,
I guess I better invest my time in Parsec then :)
Regards,
Kashyap
On Tue, Jul 17, 2012 at 5:05 PM, Roman Cheplyaka r...@ro-che.info wrote:
* C K Kashyap ckkash...@gmail.com [2012-07-17 13:31:05+0530]
I was exploring Text.Regex.Posix and found that I was not able to do a
On Tue, Jul 17, 2012 at 9:54 AM, C K Kashyap ckkash...@gmail.com wrote:
I guess I better invest my time in Parsec then :)
That's certainly more Haskelly... but it's often possible to rephrase a
regexp in POSIX ERE language without using the non-greedy PCREism. What
exactly are you trying to
