Re: Looking for a DFA implementation (please help)

"Clint Olsen" <clint@0lsen.net>
12 Nov 2002 14:09:06 -0500

          From comp.compilers
Related articles
Looking for a DFA implementation (please help) mvp9@cornell.edu (mike) (2002-11-08)
Re: Looking for a DFA implementation (please help) mailbox@dmitry-kazakov.de (Dmitry A. Kazakov) (2002-11-12)
Re: Looking for a DFA implementation (please help) clint@0lsen.net (Clint Olsen) (2002-11-12)
Re: Looking for a DFA implementation (please help) buraq@lampsun1.epfl.ch (Burak Emir) (2002-12-01)
| List of all articles for this month |
From: "Clint Olsen" <clint@0lsen.net>
Newsgroups: comp.compilers
Date: 12 Nov 2002 14:09:06 -0500
Organization: AT&T Broadband
References: 02-11-039
Keywords: lex, DFA
Posted-Date: 12 Nov 2002 14:09:06 EST

The moderator nattered:
> [I suggested extracting the useful bits from flex. -John]


There's also re2c http://www.tildeslash.org. But since he has some
specific requirements for his DFA, perhaps a look at Mark Hopkin's DFA
code might be in order?


http://www.csd.uwm.edu/~whopkins/regex/index.html


In there is a DFA engine (but with an n^2 minimization alg. -
Hopcroft's technique can work in nlog(n) which might be relevant since
DFA construction was a consideration) as well as a superset of 'grep'
called rex.


-Clint

Post a followup to this message

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