Re^2: Searching for regular expression overlaps

Thanks for the link, it's a fascinating read (again).

some things most be noted

MJD is restricting himself to a (very powerful) subset of possible regexes. E.g. he's neither covering look ahead, look behind nor embedded Perl.
He doesn't cover the question of how to translate a regex to his stream representation.

BUT fascinating enough he shows later that he can produce a sorted output: first by length and second lexicographic.

That means one could probably create a "pragmatic" comparison of two streams, i.e. comparing the leading substrings of all solutions up to a certain length and quickly identifying "incompatible" regexes...

If there is still an overlap possible after n characters one could reject a regex for being too "similar" (potentially compatible).

Well theoretically, I won't try to implement this. .. :)

Cheers Rolf
_{(addicted to the Perl Programming Language and ☆☆☆☆ :)

Je suis Charlie!}

Comment on Re^2: Searching for regular expression overlaps

Replies are listed 'Best First'.
Re^3: Searching for regular expression overlaps by AnomalousMonk (Archbishop) on Aug 12, 2016 at 23:23 UTC
I tend to agree with you and BrowserUk that what Giardap wants is probably the wrong solution to the wrong problem. And I won't, thank goodness, be implementing it either :) Give a man a fish: `<%-{-{-{-<`	[reply] [d/l]
Re^4: Searching for regular expression overlaps by LanX (Saint) on Aug 12, 2016 at 23:56 UTC
> And I won't, thank goodness, be implementing it either :) Well MJD might be sufficiently motivated ... ;-) Cheers Rolf _{(addicted to the Perl Programming Language and ☆☆☆☆ :) Je suis Charlie!}	[reply]