Root: /* Problem */

2016-04-11T10:31:51Z

Problem

← Older revision		Revision as of 10:31, 11 April 2016
Line 5:		Line 5:
	X → c		X → c
	A → a A \| B x \| X		A → a A \| B x \| X
	B → b \| B		B → b B \| A y

	# Examine the grammar and rewrite it so that an LL(1) predictive parser can be built for the corresponding language.		# Examine the grammar and rewrite it so that an LL(1) predictive parser can be built for the corresponding language.

Root: Created page with "= Problem = Consider the following grammar, where '''B''' is the initial symbol and '''{a, b, c, x, y}''' is the set of terminal symbols: X → c A → a A | B x | X B..."

2016-04-11T10:31:32Z

Created page with "= Problem = Consider the following grammar, where '''B''' is the initial symbol and '''{a, b, c, x, y}''' is the set of terminal symbols: X → c A → a A | B x | X B..."

New page

= Problem =

Consider the following grammar, where '''B''' is the initial symbol and '''{a, b, c, x, y}''' is the set of terminal symbols:

X → c
A → a A | B x | X
B → b | B

# Examine the grammar and rewrite it so that an LL(1) predictive parser can be built for the corresponding language.
# Compute the FIRST and FOLLOW sets for all non-terminal symbols in the new grammar and build the parse table.
# Show the analysis table (stack, input, and actions) for the parsing process of the '''bacy''' input sequence.

= Solution =

{{CollapsedCode|Solução completa|
[[image:ll1-ex13.jpg]]
}}

[[category:Compiladores]]
[[category:Ensino]]

Top-Down Parsing/Exercise 13: Test 2016/04/08 - Revision history

Root: /* Problem */

Root: Created page with "= Problem = Consider the following grammar, where '''B''' is the initial symbol and '''{a, b, c, x, y}''' is the set of terminal symbols: X → c A → a A | B x | X B..."