LARA

Lecture 02: Automating Lexing. Intro to Parsing

Check Course Information for new resources

Continuation of Lecture 01

Recall Phases of a Compiler

Automating Lexical Analysis

State Machines from Regular Expressions (done in exercises)

Finite state machine

Determinization of finite state machine

Finite state machine with epsilon transitions

Closure properties of finite state machines

From Finite State Machines to Regular Expressions

Equivalence of finite state machine and regular expression languages

Minimization of Finite State Machines

Minimization of State Machines

Automatic Generation of Lexers

Implementing Finite State Machines

Using Finite State Machines for Lexical Analysis

Tools for Constructing Lexers

References

Syntax Analysis (Parsing)

Introduction to Parsing

Limitations of Regular Expressions

Parse Trees, Ambiguity, and Derivations

Recursive Descent Parsing

References