Re: Regular expressions; cannonical form and reducer?

zss@ZenSpider.com (Ryan Davis)
7 Mar 1998 22:45:33 -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: zss@ZenSpider.com (Ryan Davis)
Newsgroups: comp.compilers
Date: 7 Mar 1998 22:45:33 -0500
Organization: Zen Spider Software
References: 98-03-034
Keywords: DFA

guthrie@mum.edu (Gregory Guthrie) wrote:


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


State machines are probably what you are looking for.


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


You can test equivalence by translating two regex forms to their state
machine equivalents and then comparing the state machines.


Ryan Davis mailto:rwd@acm.org
Zen Spider Software mailto:zss@ZenSpider.com
Mac user since 1984! http://www.ZenSpider.com/
--

Post a followup to this message

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