From: Michael Goldshteyn (mgoldshteyn_at_[hidden])
Date: 2007-03-23 12:35:31
"John Maddock" <john_at_[hidden]> wrote in message
> Michael Goldshteyn wrote:
>> I understand the issues, now, but am wondering whether control over
>> the "maximum number of states" should be given to the caller or if
>> the issue is one of running out of memory?
> No it's not running out of memory, just giving up 'cos there's no end in
> sight. I've tweaked the algorithm slightly for 1.34 to give up less
> when the string being matched is short, but basically if you get an
> exception it usually means that there is something wrong with the
> expression: even if a match (or not) could be found for a short string,
> sooner or later it's going to bite you.
John, will the "still going to bite you" part still hold true if the example
uses non-greedy versions of '+' (i.e. "+?")
Boost list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk