Automata
Build a solid understanding of the formal machines that power lexical analysis — from regular expressions and finite automata, through DFA and NFA construction, minimization, and symbol table management.
Build a solid understanding of the formal machines that power lexical analysis — from regular expressions and finite automata, through DFA and NFA construction, minimization, and symbol table management.