This class turns a regular expression over A
into a
scala.util.automata.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.
(Since version 2.10.0) This class will be removed
This class turns a regular expression into a scala.util.automata.NondetWordAutom celebrated position automata construction (also called Berry-Sethi or Glushkov).