Compilers (CSC-362 98F)


Class 13: Shift-reduce parsing

Held Monday, September 28, 1998

Handouts

Notes


Problems with this strategy

Left-recursive grammars

Left-factoring

Recursive descent parsing and other alternatives

Shift-reduce parsing

LR(0) Automata

Constructing LR(0) Automata, Formalized

Using LR(0) Automata


History


Back to Predictive parsing, continued. On to Semantic actions.


Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

Source text last modified Wed Sep 30 09:09:58 1998.

This page generated on Wed Sep 30 11:30:10 1998 by SiteWeaver.

Contact our webmaster at rebelsky@math.grin.edu