Compilers (CS362 2001S)

Class 16: Shift-Reduce Parsing, Continued

Back to Shift-Reduce Parsing. On to Pause for Breath.

Held Monday, February 26, 2001

Summary

Today we consider how to build shift-reduce automata and the tables that represent them..

Overview

LR(0) Automata

Constructing LR(0) Automata, Formalized

Using LR(0) Automata

Other LR Issues

Conflicts in LR Automata

SLR Automata

LR(1) Automata

 

History

Monday, 22 January 2001

Friday, 23 February 2001

 

Back to Shift-Reduce Parsing. On to Pause for Breath.

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

This page was generated by Siteweaver on Mon Apr 30 10:51:57 2001.
This page may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS362/2001S/outline.16.html.
You may validate this page's HTML.
The source was last modified Mon Feb 26 10:16:02 2001.