On Thu, Jun 30, 2005 at 10:44:03AM -0500, Patrick R. Michaud wrote: > If it would help for me to give more details about the bsr/ret scheme > I'm using, I'll be glad to post it. I could certainly give a Perl 6 > equivalent of the rule we're looking at. But essentially the key is > that a "bsr" always represents a backtracking point, a "ret" always > indicates fail, a "goto R*" is a tailcall, and the named registers > are variables in the scope of all of the R* subroutines.
Does this mean that you're using the same recursive approach that the perl 5 regular expression engine uses? (Not that I understand much of the perl 5 engine, except that uses recursion to maintain parts of state) Nicholas Clark
