Programming Language Theory

4.

Syntax and Parsing

4.1.

Concrete vs Abstract Syntax

4.1.1.

Surface Syntax Representation

4.1.2.

Abstract Syntax Trees

4.1.3.

Desugaring Process

4.2.

Grammar Formalisms

4.2.1.

Backus-Naur Form

4.2.1.1.

Production Rules

4.2.1.2.

Terminal and Nonterminal Symbols

4.2.2.

Extended Backus-Naur Form

4.2.2.1.

Optional Elements

4.2.2.2.

4.2.2.3.

4.2.3.

Context-Free Grammars

4.2.3.1.

4.2.3.2.

4.2.3.3.

4.3.

Lexical Analysis

4.3.1.

Tokenization Process

4.3.2.

Regular Expressions for Tokens

4.3.3.

4.3.4.

Reserved Words and Identifiers

4.4.

Parsing Techniques

4.4.1.

Top-Down Parsing

4.4.1.1.

Recursive Descent

4.4.1.2.

4.4.1.3.

4.4.1.4.

First and Follow Sets

4.4.2.

Bottom-Up Parsing

4.4.2.1.

Shift-Reduce Parsing

4.4.2.2.

4.4.2.3.

4.4.2.4.

4.4.2.5.

4.4.3.

4.4.3.1.

Panic Mode Recovery

4.4.3.2.

Phrase-Level Recovery

4.4.3.3.

Error Productions

Previous

3. Lambda Calculus

Go to top

Next

5. Formal Semantics