Re: Lex scanner

vannoord@let.rug.nl
17 Nov 2000 23:44:54 -0500

          From comp.compilers
Related articles
Lex scanner cafelito@yahoo.com (Jorge) (2000-11-16)
Re: Lex scanner vannoord@let.rug.nl (2000-11-17)
Re: Lex scanner soenke.kannapinn@wincor-nixdorf.com (Sönke Kannapinn) (2000-11-17)
| List of all articles for this month |
From: vannoord@let.rug.nl
Newsgroups: comp.compilers
Date: 17 Nov 2000 23:44:54 -0500
Organization: Faculteit der Letteren, Rijksuniversiteit Groningen, NL
References: 00-11-119
Keywords: lex
Posted-Date: 17 Nov 2000 23:44:54 EST

Jorge <cafelito@yahoo.com> wrote:
> I'm doing some research in lexical scanners, and it was nice if
> someone can tell me any reference about algorithms that match if two
> regular expressions generate the same language.


Create minimal finite state automaton for each expression. Checking
equivalence of two minimal fsa is trivial, since basically minimal
fsa are unique up to state numbering.
--
Gertjan van Noord Alfa-informatica, RUG, Postbus 716, 9700 AS Groningen
vannoord at let dot rug dot nl http://www.let.rug.nl/~vannoord

Post a followup to this message

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