Re: Is a generic finite state machine engine reasonable?

[widget!jgg@uunet.uu.net (John Goodsen)]

Bob Martin has a very nice, clean design of a
generic finite state machine.  He has written
a parser which will parse textual state tables
and generate the corresponding C++ classes.
I'm sure this could just as easily be done in and
for Ada.  Bob used lex and yacc for the parsing.
AFLEX and AYACC would work equally well for the
Ada version.  

It's his Object Oriented design of the FSM that is
of most interest, however.  Once you've designed it,
parsing and spitting the code is the trivial part.

If you're interested in a copy, email me directly.
I'm sure Bob will let me distribute to the Ada world,
but I'll check for sure.  If I get too many requests,
then I'll just make it available on anonymous ftp or
post it...

--
John Goodsen                           PCIS Programme
Software Process & Environments        Ada Joint Program Office       
EVB Software Engineering               goodsenj@ajpo.sei.cmu.edu
jgg@evb.com