Covers the computation of 'nullable' and 'first' for regular expressions, converting expressions into a lexer, and handling token priorities.
Explores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.
Explores formal language operations, including concatenation, union, intersection, and Kleene star for language repetition.
Explores parsing text into trees using parser combinators in Scala, covering filtering, transforming, sequencing, alternatives, recursion, spaces handling, lexing, monadic nature, and for-notation.
Introduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.
Covers the basics of working with strings in C++, including declaration, initialization, characters, assignment, concatenation, and comparison.
