Converting NFA to DFA
Converting NFA to DFA
NFA: (Node, Token) -> Seq[Node] (multiple next nodes can be found for a given token) DFA: State = Seq[Node] (State, Token) -> State (only a single state can be found for a given token)
initial node to start
(Since version ) see corresponding Javadoc for more information.
Immutable Automaton implementation. Adding nodes or edges will create a new Automaton instance