Re: lex behavior

2002-06-14 Thread Larry Wall
On Fri, 14 Jun 2002, Jonathan Scott Duff wrote: : On Thu, Jun 13, 2002 at 03:48:25PM -0700, Larry Wall wrote: : > But the most straightforward way to match longest is probably to use : > :any to get a superposition of matches, and then pull out the longest : > match. : : So, does :any return a

Re: lex behavior

2002-06-14 Thread Jonathan Scott Duff
On Thu, Jun 13, 2002 at 03:48:25PM -0700, Larry Wall wrote: > But the most straightforward way to match longest is probably to use > :any to get a superposition of matches, and then pull out the longest > match. So, does :any return a list of the substrings that matched or a list of match objec

Re: lex behavior

2002-06-14 Thread Damian Conway
Brent Dax asked: > Will that handle captures correctly? I believe so. Each (successful) time through the loop we cache a reference to the candidate's match object, which will successfully have stored all the captures from the candidate's matching. Then we reinstate the best candidate, by bindin