Hi,
Even when similer states exists in alternation, DFA treats them as
separate items. It may complicate the transition in NFA and cause
slowdown. This change assembles the states into one.
For example, ab|ac is changed into a(b|c).
This change speeds-up matching for many branched pattern. Fo
Hello Assaf.
Thank you Assaf and Eric for your suggestions. I will also look at the
tool “pcregrep”.
Thank you Eric for having answered the question of the subject:
Le 15/09/2018 à 22:27, Eric Blake a écrit :
O
Thanks for the patch. A quick question: what does the identifier "dfautf8noss"
stand for? I couldn't figure it out.
