Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much

Re^3: Are state machines just for parsing?

by diotalevi (Canon)
on Dec 07, 2004 at 22:50 UTC ( #413035=note: print w/replies, xml ) Need Help??

in reply to Re^2: Are state machines just for parsing?
in thread 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.


      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.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://413035]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (5)
As of 2018-01-19 06:43 GMT
Find Nodes?
    Voting Booth?
    How did you see in the new year?

    Results (216 votes). Check out past polls.