Regular expressions; cannonical form and reducer?

guthrie@mum.edu (Gregory Guthrie)
6 Mar 1998 02:14:01 -0500

          From comp.compilers
Related articles
Regular expressions; cannonical form and reducer? guthrie@mum.edu (1998-03-06)
Re: Regular expressions; cannonical form and reducer? matkin@iar.se (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? dietz@interaccess.com (Paul Dietz) (1998-03-08)
Re: Regular expressions; cannonical form and reducer? henry@zoo.toronto.edu (Henry Spencer) (1998-03-08)
| List of all articles for this month |
From: guthrie@mum.edu (Gregory Guthrie)
Newsgroups: comp.compilers
Date: 6 Mar 1998 02:14:01 -0500
Organization: Maharishi University of Management
Keywords: lex, question

I am interested in any references to a standard cannonical form for
regular expressions, and any system that would transform Regex into
such forms.


This would, for example allow one to test equivalence of two Regex
forms.


Seems like this should either exist, or be impossible. :-)


Thanks,
Gregory




--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.