|Regular expressions; cannonical form and reducer? email@example.com (1998-03-06)|
|Re: Regular expressions; cannonical form and reducer? firstname.lastname@example.org (Mats Kindahl) (1998-03-07)|
|Re: Regular expressions; cannonical form and reducer? zss@ZenSpider.com (1998-03-07)|
|Re: Regular expressions; cannonical form and reducer? email@example.com (Paul Dietz) (1998-03-08)|
|Re: Regular expressions; cannonical form and reducer? firstname.lastname@example.org (Henry Spencer) (1998-03-08)|
|From:||Henry Spencer <email@example.com>|
|Date:||8 Mar 1998 12:08:05 -0500|
|Organization:||SP Systems, Toronto, Canada|
Gregory Guthrie <firstname.lastname@example.org> wrote:
>I am interested in any references to a standard cannonical form for
>regular expressions, and any system that would transform Regex into
It would be straightforward enough to do for "least common denominator"
regular expressions. The hard part would be constructing a standard form
which also covers all of the weird hacks people have added to various
flavors of regular expressions over the years.
A non-trivial related problem is that different implementations can yield
different behavior from identical regular expressions, because of subtle
(or not-so-subtle) differences in the matching algorithms. Capturing this
in a canonical form would be very difficult.
| Henry Spencer
Return to the
Search the comp.compilers archives again.