Context-Free Grammars

Related lectures (32)

Page 2 of 4

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

Covers deterministic pushdown automata and their use in language recognition.

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

Explains the transformation from a DFA to a Regular Expression and discusses important concepts in automata theory.

Explains syntax trees, parse vs AST, while language syntax, AST classes, and grammar ambiguities.

Covers the conversion from finite automata to regular expressions and exercises on constructing deterministic finite automata.

Covers a recap on NFAs and introduces the determinization process.

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.

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