Re: dfa is slower than regex in some cases

2017-12-02 Thread Norihiro Tanaka
On Sat, 2 Dec 2017 21:48:34 -0800 Paul Eggert wrote: > Norihiro Tanaka wrote: > > > - if (dfa_supported (d)) > > -{ > > - dfaoptimize (d); > > - dfaanalyze (d, searchflag); > > -} > > - else > > -{ > > - d->dfaexec = dfaexec_noop; > > -} > > - > > - if (d->supe

Re: dfa is slower than regex in some cases

2017-12-02 Thread Paul Eggert
Norihiro Tanaka wrote: - if (dfa_supported (d)) -{ - dfaoptimize (d); - dfaanalyze (d, searchflag); -} - else -{ - d->dfaexec = dfaexec_noop; -} - - if (d->superset) -{ - d->fast = true; - dfaanalyze (d->superset, searchflag); -} + d->dfaexec

dfa is slower than regex in some cases

2017-12-02 Thread Norihiro Tanaka
Hi, A case that dfa is slower than regex on bug-gawk mailing list is discussed 4 months ago. http://lists.gnu.org/archive/html/bug-gawk/2017-07/msg2.html Although gawk is fixed to not use dfa in some cases, it looks like a temporary treatment. (11d4ea518166ffbc0c2fe85d090723e8f299486c)