7 Bottom Up Parsing

This lecture has four main goals:

1. To recapitulate some basic concepts of Context Free Grammars.

2. To explain the basic idea underlying naive bottom up parsing strategies for CFGs.

3. To give a simple Prolog implementation of a naive bottom up parser.

4. To discuss the limits of this work, both implementational, and algorithmic.

• 7.1 Context Free Grammars
  • 7.1.1 The Basics
  • 7.1.2 The Tree Admissibility Interpretation
  • 7.1.3 A Little Grammar of English

• 7.2 Bottom Up Parsing and Recognition

• 7.3 Putting it in Prolog

• 7.4 How Well Have we Done?
  • 7.4.1 Implementation
  • 7.4.2 Algorithmic Problems

• 7.5 The Code

• 7.6 Practical Session

• 7.7 Exercises