Top-Down Parsing/Exercise 11: Test 2014/04/10 - Revision history

Root: /* Solution */

2016-04-11T10:23:00Z

Solution

← Older revision		Revision as of 10:23, 11 April 2016
Line 13:		Line 13:
	= Solution =		= Solution =

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

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

Root: /* Problem */

2015-04-14T09:43:36Z

Problem

← Older revision		Revision as of 09:43, 14 April 2015
Line 1:		Line 1:
	= Problem =		= Problem =

	Consider the following grammar, where '''~~<tt>S</tt>~~''' is the initial symbol and '''~~<tt>~~{~~v, w,~~ x, y, z}~~</tt>~~''' 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:

	S → M y S x ~~\| L y~~ \| ε		A → B y \| x \| ε
	L → ~~w L~~ \| ~~S v~~		B → A x \| C z
	M → z \| x		C → x \| ε

	# 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 '''~~<tt>zyvyx</tt>~~''' input sequence.		# Show the analysis table (stack, input, and actions) for the parsing process of the '''xzyxy''' input sequence.

	= Solution =		= Solution =

Root: Created page with "= Problem = Consider the following grammar, where '''`S`''' is the initial symbol and '''`{v, w, x, y, z}`''' is the set of terminal symbols: S → M y S x |..."

2015-04-14T09:41:58Z

Created page with "= Problem = Consider the following grammar, where '''<tt>S</tt>''' is the initial symbol and '''<tt>{v, w, x, y, z}</tt>''' is the set of terminal symbols: S → M y S x |..."

New page

= Problem =

Consider the following grammar, where '''<tt>S</tt>''' is the initial symbol and '''<tt>{v, w, x, y, z}</tt>''' is the set of terminal symbols:

S → M y S x | L y | ε
L → w L | S v
M → z | 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 '''<tt>zyvyx</tt>''' input sequence.

= Solution =

[[image:ll1-ex11.jpg]]

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

Top-Down Parsing/Exercise 11: Test 2014/04/10 - Revision history

Root: /* Solution */

Root: /* Problem */

Root: Created page with "= Problem = Consider the following grammar, where '''S''' is the initial symbol and '''{v, w, x, y, z}''' is the set of terminal symbols: S → M y S x |..."

Root: Created page with "= Problem = Consider the following grammar, where '''`S`''' is the initial symbol and '''`{v, w, x, y, z}`''' is the set of terminal symbols: S → M y S x |..."