Pure Regular Expression Engines and Literal Clusters

[Hans Åberg via Unicode]

> 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.