|Query: Regular Expression manipulation tools email@example.com (1996-09-22)|
|Re: Query: Regular Expression manipulation tools firstname.lastname@example.org (1996-09-25)|
|From:||email@example.com (Steven Bradtke)|
|Date:||22 Sep 1996 17:30:11 -0400|
|Organization:||Earthlink Network, Inc.|
|Keywords:||DFA, question, comment|
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.
Is there a toolkit available that will satisfy these requirements? The
implementation should preferrably be in C for C++, but nearly any language
would be helpful.
Thanks in advance,
Dr. Steven Bradtke
[Lex and its relatives to RE -> FSM and use them as recognizers. -John]
Return to the
Search the comp.compilers archives again.