From: Hans Aberg (haberg@math.su.se)
Date: Sun Oct 14 2007 - 04:25:17 CDT
On 14 Oct 2007, at 10:37, Philippe Verdy wrote:
>>> Note: my engine does not look first for the longest match.
>>
>> So the there should some oether match in the language.
>
> I said "does not look ***first****". This means that the longest
> matches are
> ALSO returned, but AFTER the shorter matches in a sequence of
> matches (the
> sequence is then filtered either by compiling hints for the final
> recursion,
> or explicitly by custom checks that are also used for checking partial
> matches without requiring any backward fallback).
> So this does not prevent getting only the longest matches, because
> they ARE
> returned, but with a lower priority (that's what I meant by
> speaking about
> the expected ordering of matches when there are many).
I think you said in another place that you want to find all matches
in the language produced by an RE. Normally, one is not interested in
that. So if you want that as a feature, you need to find a good
description of it. But implementation may not want to have it.
Hans Åberg
This archive was generated by hypermail 2.1.5 : Sun Oct 14 2007 - 04:26:47 CDT