CS362 2011F Compilers

Class 22: Shift-Reduce Parsing (2)

Back to Shift-Reduce Parsing (1). On to Shift-Reduce Parsing (3).

This outline is also available in PDF.

Held: Friday, 14 October 2011

Summary: Today we continue our exploration of shift-reduce automata and the tables that represent them.

Related Pages:

Notes:

Overview:

LR(0) Automata

We started this construction in the previous class, and will continue today.

The Expression Automaton, Revisited

Our example may not match this precisely, but this is left in the outline for review purposes.

Using the Automaton

Constructing LR(0) Automata, Formalized

Back to Shift-Reduce Parsing (1). On to Shift-Reduce Parsing (3).

Disclaimer: I usually create these pages on the fly, which means that I rarely proofread them and they may contain bad grammar and incorrect details. It also means that I tend to update them regularly (see the history for more details). Feel free to contact me with any suggestions for changes.

This document was generated by Siteweaver on Wed Dec 7 10:26:34 2011.
The source to the document was last modified on Fri Aug 26 13:03:12 2011.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS362/2011F/Outlines/outline.22.html.

Samuel A. Rebelsky, rebelsky@grinnell.edu