From: Hans Aberg (haberg@math.su.se)
Date: Sun Oct 14 2007 - 02:20:36 CDT
On 14 Oct 2007, at 01:24, Philippe Verdy wrote:
>>> All my regexps are first normalized to alternations and negations
>>> ONLY
>>> (instead of putting the negation at the beginning of the regexp
>>> ONLY and using multiple binary set operators "|", "&", "\" like
>>> suggested in the recent paper submitted to the UTC).
>>
>> The definition in terms of a language L(x) has the advantage of
>> avoiding that problem, and being theoretically clearer exactly as to
>> what is being defined.
>
> Possible, but I won't support it when a match() method is running
> against
> text. The compile() method will rewrite the regexps very simply using
> negations and alternations.
So then it is not an extension of regular expressions, but a
particular implementation, or some other, more specific computer
language you are wroking on.
Hans Åberg
This archive was generated by hypermail 2.1.5 : Sun Oct 14 2007 - 02:22:36 CDT