Regular Expressions and Lexer Idea

Related lectures (32)

Page 1 of 4

Covers regular expressions, Kleene's contributions, logic, lexical analysis, and manual lexer construction.

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 computation of 'nullable' and 'first' for regular expressions.

Covers the fundamentals of finite automata and formal languages.

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

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

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

Explores formal language operations, including concatenation, union, intersection, and Kleene star for language repetition.