A basic Implementation of a Deterministic Finite State Automaton (DFA), Non-Deterministic Finite State Automaton (NFA) and Fallback DFA with Actions (FDFA) along with the Left Recursion Elimination algorithm for a Context-Free-Grammar (CFG)
python java fallback nfa automaton finite-state-automata dfa context-free-grammar automata-theory dfa-construction nfa2dfa left-recursion-elimination nfa-implementation nfa-to-dfa-conversion nfa-closure
-
Updated
Aug 3, 2020 - Python