Automata and Compilers 01 - Finite Automata
What finite automata are and why understanding compilers starts here
What finite automata are and why understanding compilers starts here
How regular expressions are equivalent to finite automata, and where the boundary of regular languages lies
Moving beyond regular languages with the structure and role of context-free grammars
What computational power a stack adds to finite automata
Why compilers are divided into multiple phases and what each phase does
How a lexer breaks source code into tokens and where automata theory meets real implementation
The principles behind recursive descent parsers, LL(1) grammars, and the strengths and limitations of top-down parsing
Shift-reduce parsing, LR parser mechanics, and how parser generators work under the hood
Parse trees vs ASTs, designing AST nodes, and how ASTs bridge the compiler frontend and backend