This class turns a regular expression over A
into a
NondetWordAutom over A
using the celebrated
position automata construction (also called Berry-Sethi or Glushkov).
A deterministic automaton.
A fast test of language inclusion between minimal automata.
A nondeterministic automaton.
This class turns a regular expression into a scala.util.automata.NondetWorkAutom celebrated position automata construction (also called Berry-Sethi or Glushkov).