|Query: Regular Expression manipulation tools firstname.lastname@example.org (1996-09-22)|
|Re: Query: Regular Expression manipulation tools email@example.com (1996-09-25)|
|From:||firstname.lastname@example.org (Roberto Lublinerman)|
|Date:||25 Sep 1996 21:12:00 -0400|
email@example.com (Steven Bradtke) wrote:
> I have an application for which I need to be able to manipulate Regular
>Expressions (RE's) and Finite State Machines (FSM's). I need to be able
> + Given two RE's, A and B, find a RE, C, such that
> L(C) == L(A) \intersect L(B)
> + Convert from RE's to FSM's and back
> + Minimize FSM's
> + Use the FSM's as recognizers.
There is a very good paper from S. Thompson with a miranda
implementation that covers all but the intersection problem.
Take a look at
there is an explanatory paper (most usefull) along with some examples
It's not C nor C++, but with some background in functional langs is
more than readable.
Return to the
Search the comp.compilers archives again.