Actually several packages:
- grammar::fa - Construction and manipulation of finite automatons (FAs).
- grammar::fa::op - Complex operations on FAs - Union, Complement, Intersect, Difference, Complete, Make epsilon-free, Minimize, Determinize.
- grammar::fa::dacceptor - Acceptors constructed from deterministic FAs (DFAs).
- grammar::fa::dexec - Executors constructed from DFAs. Running on a stream of symbols (push model).
Documentation:
Demos: