Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re^2: Read Between the Lines

by eyepopslikeamosquito (Chancellor)
on Jul 05, 2013 at 12:18 UTC ( #1042698=note: print w/ replies, xml ) Need Help??


in reply to Re: Read Between the Lines
in thread Read Between the Lines

A more generalized way to handle such requirements is with a Finite-State Machine (FSM) approach. The algorithms consider, not only the current line of input, but the $state that the FSM is “in” at the time, where the current value of $state is determined by recent history of lines seen.
Sounds cool. I found a lot of interesting hits using Super Search: All these glowing endorsements have got me excited, yet I couldn't find any sample code in any of these nodes. So I was wondering if you could post some of the excellent FSM code you've implemented over the years? It would really help me to better understand FSMs.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1042698]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (7)
As of 2016-07-28 06:45 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    What is your favorite alternate name for a (specific) keyboard key?


















    Results (253 votes). Check out past polls.