From Regular Expressions to AutomataExplores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.
Finite Automata: BasicsIntroduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.
Constructing a Lexer: First SymbolsCovers the computation of 'nullable' and 'first' for regular expressions, converting expressions into a lexer, and handling token priorities.
Compiling ExpressionsCovers the conversion of expressions, evaluation using stack machines, and bytecode generation.
Elements of ProgrammingCovers primitive expressions, evaluation processes, function applications, types, and evaluation strategies in programming.
