| Sign In/My Account | View Cart |
 |
We've expanded our Perl news coverage and improved our search! Search for all things Perl across O'Reilly! Bill Ruppert
Bill Ruppert is a programmer who wandered off into Direct Marketing. He is a consultant and the principal of ResponseB2B, specializing in mailing results analysis. Bill holds a BS in Mathematics and MS in Computer Science. He lives in the Dallas/Fort Worth area. Building a Finite State Machine Using DFA::Simple A finite state machine (FSM) is a general-purpose mechanism for solving common programming problems that involve performing actions based on previous and current input. (They're good for parsers and the like.) William Ruppert demonstrates how to build and use FSMs in Perl. [Sep 23, 2004]
|
|
Sponsored By:
|
|
||||||||
|
||||||||
