Difference between revisions of "Bottom-Up Parsing/LALR(1) Example 1"

Revision as of 12:03, 5 May 2008

Consider the following grammar. <text> A -> C x A | Ïµ B -> x C y | x C C -> x B x | z </text>

Build the LALR(1) parser table. If conflicts exist, assume YACC's behavior.
Show the differences to LR(0) and SLR(1) parsers.
Compact the parse table, eliminating and propagating reductins.
Show the stack and input states, as well as the parser actions, for the sequence xxzxx.

Revision as of 10:51, 5 May 2008 (view source) Root (talk \| contribs) (New page: Consider the following grammar. <text> A -> C x A \| ϵ B -> x C y \| x C C -> x B x \| z </text> # Build the LALR(1) parser table. If conflicts exist, assume YACC's behavior. # Show the dif...)		Revision as of 12:03, 5 May 2008 (view source) Root (talk \| contribs) m Newer edit →
Line 11:		Line 11:
	# Show the stack and input states, as well as the parser actions, for the sequence '''xxzxx'''.		# Show the stack and input states, as well as the parser actions, for the sequence '''xxzxx'''.

−	* [http://www.l2f.inesc-id.pt/~david/ist/docencia/compiladores/2007-2008/lalr-ex-1.pdf ~~LALR(1) Example 1~~ Solution]	+	* [http://www.l2f.inesc-id.pt/~david/ist/docencia/compiladores/2007-2008/lalr-ex-1.pdf Solution]