>>>>> "GL" == Greg London <[EMAIL PROTECTED]> writes:
GL> Ah, I think I realize why I wasn't getting it. GL> It's not just a flat loop through all the quantifiers. GL> It's reallly a recursive approach. GL> This makes things a bit more complicated for me. if the explanations didn't clarify or confuse you more, backtracking is key to how regexes can match complex things. have you seen abigail's prime number tester in a regex (we have shown it at meetings). it wouldn't be possible without backtracking. perl6 will have various features that will not allow backtracking at different levels. that means once you go past one of these, a backtrack over it will result in a failure and pop to the requested level (you can even 'commit' and cause the entire rule to fail at that point). that might be the behavior you want. perl5 has a limited version of that (i forget the syntax) so you might want rtfm for it. uri -- Uri Guttman ------ [EMAIL PROTECTED] -------- http://www.stemsystems.com --Perl Consulting, Stem Development, Systems Architecture, Design and Coding- Search or Offer Perl Jobs ---------------------------- http://jobs.perl.org _______________________________________________ Boston-pm mailing list [email protected] http://mail.pm.org/mailman/listinfo/boston-pm
