Top-Down Parsing/Exercise 8 - Revision history

Root: Redirected page to ist:Top-Down Parsing/Exercise 8

2018-12-05T22:21:32Z

Redirected page to ist:Top-Down Parsing/Exercise 8

← Older revision		Revision as of 22:21, 5 December 2018
Line 1:		Line 1:
	~~{{TOCright}}~~		#REDIRECT [[ist:Top-Down Parsing/Exercise 8]]
	~~= Problem =~~

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

	~~A -> B C x \| D C y~~
	~~B -> z \| A z~~
	~~C -> z~~
	~~D -> A y \| B y~~

	~~# 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>zzxyzy</tt>''' input sequence.~~

	~~== Solution ==~~

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

Root at 14:42, 6 April 2015

2015-04-06T14:42:01Z

← Older revision		Revision as of 14:42, 6 April 2015
Line 15:		Line 15:
	== Solution ==		== Solution ==

	[[category:~~Teaching~~]]		[[category:Compiladores]]
	[[category:~~Compilers~~]]		[[category:Ensino]]

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

2011-05-16T14:59:52Z

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

New page

{{TOCright}}
= Problem =

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

A -> B C x | D C y
B -> z | A z
C -> z
D -> A y | B y

# 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>zzxyzy</tt>''' input sequence.

== Solution ==

[[category:Teaching]]
[[category:Compilers]]

Top-Down Parsing/Exercise 8 - Revision history

Root: Redirected page to ist:Top-Down Parsing/Exercise 8

Root at 14:42, 6 April 2015

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

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