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

Root at 10:32, 11 April 2016

2016-04-11T10:32:00Z

← Older revision		Revision as of 10:32, 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: /* Problem */

2016-04-11T10:30:37Z

Problem

← Older revision		Revision as of 10:30, 11 April 2016
Line 1:		Line 1:
	= Problem =		= Problem =

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

	X → c		X → c
Line 9:		Line 9:
	# 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.
	# Compute the FIRST and FOLLOW sets for all non-terminal symbols in the new grammar and build the parse table.		# 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 '''~~xzyxy~~''' input sequence.		# Show the analysis table (stack, input, and actions) for the parsing process of the '''acyx''' input sequence.

	= Solution =		= Solution =

Root at 10:29, 11 April 2016

2016-04-11T10:29:54Z

← Older revision		Revision as of 10:29, 11 April 2016
Line 3:		Line 3:
	Consider the following grammar, where '''A''' is the initial symbol and '''{x, y, z}''' is the set of terminal symbols:		Consider the following grammar, where '''A''' is the initial symbol and '''{x, y, z}''' is the set of terminal symbols:

	A → ~~B y \| x \| ε~~		X → c
	B → A x \| ~~C z~~		A → a A \| B x \| X
	C → x \| ε		B → b \| B

	# 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 '''A''' is the initial symbol and '''{x, y, z}''' is the set of terminal symbols: A → B y | x | ε B → A x | C z C..."

2016-04-11T10:28:19Z

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

New page

= Problem =

Consider the following grammar, where '''A''' is the initial symbol and '''{x, y, z}''' is the set of terminal symbols:

A → B y | x | ε
B → A x | C z
C → x | ε

# 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 '''xzyxy''' input sequence.

= Solution =

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

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