Lecture 02: Lexical Analysis
Lexical Analysis without Tools
State Machines and Regular Expressions
Determinization of finite state machine
Finite state machine with epsilon transitions
Closure properties of finite state machines
Equivalence of finite state machine and regular expression languages
Automatic Generation of Lexers
References
- Tiger book, Chapters 1-2
- Slides from previous years:
- Compiler Construction by Niklaus Wirth, Chapters 1-3
Next: parsing in Lecture 03