LARA

Lecture 03: Automatic Construction of Lexers. Basics of Parsing

Lecture 3 PDF Slides

Automatic Construction of Lexers

Equivalence of finite state machines and regular expression languages

Minimization of State Machines

Implementing Finite State Machines

Using Finite State Machines for Lexical Analysis

Basics of Parsing

Context-Free Grammars

(Manually Constructed Parser Sketch is in Slides)

Basic Idea of First Symbol Computation

Computing Nullable Nonterminals

Computing Follow Sets

Computing First and Follow Sets

References