> On 12 Oct 2019, at 14:17, Richard Wordingham via Unicode <unicode_at_unicode.org> wrote:
>
> But remember that 'having longer first' is meaningless for a
> non-deterministic finite automaton that does a single pass through the
> string to be searched.
It is possible to identify all submatches deterministically in linear time without backtracking — I a made an algorithm for that.
A selection among different submatches then requires additional rules.
Received on Sat Oct 12 2019 - 14:37:49 CDT
This archive was generated by hypermail 2.2.0 : Sat Oct 12 2019 - 14:37:49 CDT