Pure Regular Expression Engines and Literal Clusters
Hans Åberg via Unicode
unicode at unicode.org
Sun Oct 13 08:29:04 CDT 2019
> On 13 Oct 2019, at 15:00, Richard Wordingham via Unicode <unicode at unicode.org> wrote:
>>> On Sat, 12 Oct 2019 21:36:45 +0200
>>> Hans Åberg via Unicode <unicode at unicode.org> wrote:
>>>>> 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
> I'm now beginning to wonder what you are claiming.
I start with a NFA with no empty transitions and apply the subset DFA construction dynamically for a given string along with some reverse NFA-data that is enough to transverse backwards when a final state arrives. The result is a NFA where all transverses is a match of the string at that position.
More information about the Unicode