Constructing a Lexer: First SymbolsCovers the computation of 'nullable' and 'first' for regular expressions, converting expressions into a lexer, and handling token priorities.
From Regular Expressions to AutomataExplores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.
Operations on Formal LanguagesExplores formal language operations, including concatenation, union, intersection, and Kleene star for language repetition.
