Re^3: Are state machines just for parsing?

I didn't see anything in the referenced code to indicate that it parsed anything. All it does to decide the next state is run a bunch of your test functions to see which one returns true. What your test functions do is up to them.

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

Replies are listed 'Best First'.
Re^4: Are state machines just for parsing? by samtregar (Abbot) on Dec 07, 2004 at 23:35 UTC
You know, I think you're right. I didn't think hard enough about what $_ was in the examples I was looking at. Now I guess the only problem is that the code in DFA::Simple is decidedly scary. Maybe by tomorrow I'll have shaken the memory and I can start using the module with a clear conscience. Thanks! -sam	[reply]
Re^5: Are state machines just for parsing? by diotalevi (Canon) on Dec 07, 2004 at 23:43 UTC
One thing I'll note is that `use strict` isn't used in DFA::Simple. You may want to give it a treatment of that before actually using it. You'd want to rescind it when it calls your functions so that you can pass in function names instead of hard references.	[reply] [d/l]