Re: Query: Regular Expression manipulation tools

sjbradtke@earthlink.net (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
>to:
> + 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
http://stork.ukc.ac.uk/computer_science/Miranda_craft/regExp.html
there is an explanatory paper (most usefull) along with some examples


HTH.


It's not C nor C++, but with some background in functional langs is
more than readable.


Roberto Lublinerman
rel@artech.com.uy
--

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