Does a `state machine generator' exist?

Is there such a beast as a state machine generator on the order of
lex/yacc? I'd like to define a set of states and actions to take
place on the state transistion for a tool that would generate the
tables and logic to maintain the state. It's not that hard to write
some code that handles a specific instance, but it's a pain to modify
it when one needs to add/change the states. I was wondering if there
is some automated tool to generate the guts from some sort of a
high-level description? Am I making any sense?


Thanks.


Dave Bodenstab
imdave@mcs.net
[Since a regular expression is equivalent to a DFA, lex may well do what
you want. -John]

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