LARA

Lecture 04: Finishing Parsing. Semantic Actions and Building Syntax Trees

Summary of Table-Driven LL(1) Parsing

Algorithm for First and Follow Sets

Building LL Parsing Table

Interpreting LL Parsing Table

Abstract Syntax Trees

Notion of Syntax Trees

Modifying Parser to Construct Trees

Building a Pretty Printer

LR Parsing Preparation

Earley Parser

Pushdown Automata

LR Parsing

LL Parser uses Leftmost Derivation

LR Parser uses Rightmost Derivation

LR Parser Runs Automaton over Stack

Automata for LR Parsing without Lookahead

LR(0) Parser Actions

SLR Parser Actions

LR Parsing with Lookahead Items

LR(1) Parser Actions

LR Parsing Tables

Precedence in LR Parsing

Example Ocamlyacc Grammar

Further Reading