Thanks Roman,<div><br></div><div>I guess I better invest my time in Parsec then :)</div><div><br></div><div>Regards,</div><div>Kashyap<br><br><div class="gmail_quote">On Tue, Jul 17, 2012 at 5:05 PM, Roman Cheplyaka <span dir="ltr"><<a href="mailto:roma@ro-che.info" target="_blank">roma@ro-che.info</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">* C K Kashyap <<a href="mailto:ckkashyap@gmail.com">ckkashyap@gmail.com</a>> [2012-07-17 13:31:05+0530]<br>
<div class="im">> I was exploring Text.Regex.Posix and found that I was not able to do a<br>
> non-greedy match by modifying the quantifier with a "?". How can I achieve<br>
> non-greedy match in Text.Regex.Posix?<br>
<br>
</div>POSIX regular expressions semantics doesn't have a notion of a<br>
greedy/non-greedy match.<br>
Use an engine that implements Perl semantics if you need one.<br>
<br>
Refer to [1] for more detail.<br>
<br>
[1]: <a href="http://www.haskell.org/haskellwiki/Regular_expressions#.28apple.7Corange.29" target="_blank">http://www.haskell.org/haskellwiki/Regular_expressions#.28apple.7Corange.29</a><br>
<span class="HOEnZb"><font color="#888888"><br>
--<br>
Roman I. Cheplyaka :: <a href="http://ro-che.info/" target="_blank">http://ro-che.info/</a><br>
</font></span></blockquote></div><br></div>