| ||||||||
| ||||||||
Description | ||||||||
From Regular Expressions into Non-Deterministic and Deterministic Finite Automata Code Included in the Lecture Notes on Language Processing (with a functional flavour). | ||||||||
Synopsis | ||||||||
| ||||||||
Documentation | ||||||||
| ||||||||
| ||||||||
| ||||||||
| ||||||||
| ||||||||
Compute a Ndfa from a RegExp. Auxiliar function threading the context: the first available int to name the states | ||||||||
Produced by Haddock version 2.3.0 |