Stately State Machines with Ragel
summary
Claim: Ragel compiles readable state-machine DSL into highly optimized code and is already used for HTTP and protocol parsing (Mongrel, Puma, Whitequark). Tools shown: ragel-r to emit Ruby, graphviz output for visualizing states, a Volt playground that builds and inspects machines. Concrete results: composition operators (union/intersection/difference) and guarded concatenation produce nontrivial merged machines, embedded actions enable a scanner with longest-match, and recursive constructs use a host-language stack; demos show working parsers and fast generated code.
AI-written summary · about
chapters (9)
- 0:00Start
- 4:35FINITE AUTOMATA
- 6:34THE CAT'S MEOW?
- 7:10START STATE
- 18:07ENTERING TRANSITION
- 18:20LEAVING TRANSITION
- 19:10AMBIGUITY PROBLEMS
- 20:50SCANNER EXAMPLE
- 25:35INSTALLATION
