Re^2: Are state machines just for parsing?

Well, first off because my problem doesn't have states with just one possible next state, it has a set. Sure I could enhance your example until it could handle a fully generalized state machine. Then I could find a good name and put our solution on CPAN. But if there's already a solution out there I can use, wouldn't it be better to use that?

-sam

Comment on Re^2: Are state machines just for parsing?

Replies are listed 'Best First'.
Re^3: Are state machines just for parsing? by Anonymous Monk on Aug 12, 2005 at 16:59 UTC
But if there's already a solution out there I can use, wouldn't it be better to use that? See also: Abstraction Inversion.	[reply]