JFAR: Finite State Machines in Forth – J. V. Noble
This note provides methods for constructing deterministic and nondeterministic finite state automata in Forth. The “best” method produces a one-to-one relation between the definition and the state table of the automaton. An important feature of the technique is the absence of (slow) nested IF clauses.