Re: Improving regexp-opt

[Stefan Monnier]

> The pros:
> If the resulting strings "came from" a regexp that is splittable, the
> FA implementation always simplifies to it.  In pratice, these are
> uncommun, and in most cases, the results are equivalent.
>
> The cons:
> The algorithm for FA seams to have greater computation complexity,
> takes about 20 times to compute in average.

Furthermore, even when the result is noticeably shorter, have you
compared the performance of the regexp-matcher?  I expect that you won't
be able to see a measurable difference there.

IOW it's just not a good deal.

As I said, if you really want to improve on regexp-opt, you have to go
through a *real* DFA and that means not returning a regexp but a DFA, so
it's a completely different beast from `regexp-opt`.


        Stefan