September 2017
Intermediate to advanced
240 pages
5h 57m
English
Whenever you read a book on parsing there’s this scary chapter on finite state machines (FSMs). They go into great detail of “edges” and “nodes” with every combination of possible “automata” being converted into other automata and frankly it’s a bit much. There’s a simpler explanation of FSMs that makes them practical and understandable while not violating the purist theoretical version of the same topic. Sure, you won’t get a paper submitted to the ACM, because you don’t know all of the mathematics behind FSM, but if you just want to use them in your applications then they are simple enough.
An FSM is a way to organize events happening to a set of states. Another way to define an event is an “input trigger,” ...
Read now
Unlock full access