From: Hans Aberg (haberg@math.su.se)
Date: Sun Oct 14 2007 - 14:53:31 CDT
On 14 Oct 2007, at 20:15, Philippe Verdy wrote:
> The intent is not to find all matches, but having the possibility
> of finding
> them all;
This can be done using Haskell style lazy evaluation, similar to a
Prolog query style.
> Even PERL-based regexps allow such subselections (partly) using
> some other
> extensions. Don't say this is not needed.
It is only that it may not be needed in lexer generators and such, to
it should not be tied to RE theory, but its implementation.
Hans Åberg
This archive was generated by hypermail 2.1.5 : Sun Oct 14 2007 - 14:56:16 CDT