|Looking for a DFA implementation (please help) email@example.com (mike) (2002-11-08)|
|Re: Looking for a DFA implementation (please help) firstname.lastname@example.org (Dmitry A. Kazakov) (2002-11-12)|
|Re: Looking for a DFA implementation (please help) email@example.com (Clint Olsen) (2002-11-12)|
|Re: Looking for a DFA implementation (please help) firstname.lastname@example.org (Burak Emir) (2002-12-01)|
|From:||"Clint Olsen" <email@example.com>|
|Date:||12 Nov 2002 14:09:06 -0500|
|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?
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'
Return to the
Search the comp.compilers archives again.