4 min read
Automata and Compilers 01 - Finite Automata
What finite automata are and why understanding compilers starts here
Lectures
All posts in the Lectures
5 min read
Automata and Compilers 02 - Regular Expressions and Regular Languages
How regular expressions are equivalent to finite automata, and where the boundary of regular languages lies
5 min read
Automata and Compilers 03 - Context-Free Grammars
Moving beyond regular languages with the structure and role of context-free grammars
5 min read
Automata and Compilers 04 - Pushdown Automata
What computational power a stack adds to finite automata
6 min read
Automata and Compilers 05 - Compiler Overview โ Phases and Architecture
Why compilers are divided into multiple phases and what each phase does
5 min read
Automata and Compilers 06 - Lexical Analysis
How a lexer breaks source code into tokens and where automata theory meets real implementation
5 min read
Automata and Compilers 07 - Top-Down Parsing
The principles behind recursive descent parsers, LL(1) grammars, and the strengths and limitations of top-down parsing
5 min read
Automata and Compilers 08 - Bottom-Up Parsing
Shift-reduce parsing, LR parser mechanics, and how parser generators work under the hood
4 min read
Automata and Compilers 09 - Abstract Syntax Trees
Parse trees vs ASTs, designing AST nodes, and how ASTs bridge the compiler frontend and backend