26 Apr 2001 21:08:07 -0400

Related articles |
---|

working with very large Finite State Machines sjbradtke@home.com (Steve Bradtke) (2001-04-22) |

Re: working with very large Finite State Machines vannoord@let.rug.nl (2001-04-26) |

Re: working with very large Finite State Machines chase@world.std.com (David Chase) (2001-04-26) |

Re: working with very large Finite State Machines rboland@unb.ca (Ralph Boland) (2001-04-26) |

Re: working with very large Finite State Machines rbates@southwind.net (Rodney M. Bates) (2001-04-29) |

From: | David Chase <chase@world.std.com> |

Newsgroups: | comp.compilers |

Date: | 26 Apr 2001 21:08:07 -0400 |

Organization: | Compilers Central |

References: | 01-04-117 |

Keywords: | lex |

Posted-Date: | 26 Apr 2001 21:08:07 EDT |

Steve Bradtke wrote:

*> I am working on a project that involves the construction of*

*> very large Finite State Machines (up to approximately 10^7 states).*

I don't have the pointers that you need, but where do those gigantic

FSMs come from? Sometimes, you can do a little upstream processing to

reduce the downstream complexity. I wrote on paper on this in 1987 for

tree-pattern-matching FSMs -- it is of no help to you, but it's an

example of this sort of approach, and the savings were pretty good.

David Chase

chase@world.std.com

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.