Regular Expressions and Lexer Idea

Related lectures (32)

Page 1 of 4

Explores regular expressions, including their history, operators, lexical analysis, and manual construction of lexers.

Covers the fundamentals of regular expressions and includes exercises on defining languages.

Explores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.

Introduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.

Covers the fundamentals of finite automata and formal languages.

Covers the computation of 'nullable' and 'first' for regular expressions.

Introduces the basics of automata theory and explores the theorems of regular languages.

Explores the project structure for solving WS1S formulas and planned additions.

Explores spelling error correction, including neologisms and borrowings, using edit distance and finite-state automata.

Covers regular languages, encoding, alphabets, words, languages, concatenation, exponentiation, and iterative closure.