22 Sep 1996 17:30:11 -0400

Related articles |
---|

Query: Regular Expression manipulation tools sjbradtke@earthlink.net (1996-09-22) |

Re: Query: Regular Expression manipulation tools rel@artech.com.uy (1996-09-25) |

From: | sjbradtke@earthlink.net (Steven Bradtke) |

Newsgroups: | comp.compilers,comp.sources.wanted,sci.math.symbolic |

Date: | 22 Sep 1996 17:30:11 -0400 |

Organization: | Earthlink Network, Inc. |

Keywords: | DFA, question, comment |

Netizens ---

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.

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,

Steve

======================================================

Dr. Steven Bradtke

sjbradtke@earthlink.net

[Lex and its relatives to RE -> FSM and use them as recognizers. -John]

--

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.