Top-Down Parsing/Exercise 9 - Revision history

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

2018-12-05T22:21:52Z

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

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

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

	~~C -> v~~
	~~A -> B x \| z C A y~~
	~~B -> A v \| z C w \| (eps)~~

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

	~~== Solution ==~~

	[[~~Image~~:~~CompilersTopDownParsingExercise9.jpg\|700px]]~~

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

Root at 07:33, 7 April 2018

2018-04-07T07:33:49Z

← Older revision		Revision as of 07:33, 7 April 2018
Line 2:		Line 2:
	= Problem =		= 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:		Consider the following grammar, where '''<tt>A</tt>''' is the initial symbol and '''<tt>{v,x,y,z}</tt>''' is the set of terminal symbols:

	C -> v		C -> v

Root at 14:42, 6 April 2015

2015-04-06T14:42:08Z

← Older revision		Revision as of 14:42, 6 April 2015
Line 16:		Line 16:
	[[Image:CompilersTopDownParsingExercise9.jpg\|700px]]		[[Image:CompilersTopDownParsingExercise9.jpg\|700px]]

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

Root: /* Solution */

2013-03-29T20:53:41Z

Solution

← Older revision		Revision as of 20:53, 29 March 2013
Line 14:		Line 14:
	== Solution ==		== Solution ==

	[[Image:CompilersTopDownParsingExercise9.jpg\|~~600px~~]]		[[Image:CompilersTopDownParsingExercise9.jpg\|700px]]

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

Root: /* Solution */

2013-03-29T20:53:30Z

Solution

← Older revision		Revision as of 20:53, 29 March 2013
Line 14:		Line 14:
	== Solution ==		== Solution ==

	[[Image:CompilersTopDownParsingExercise9.jpg]]		[[Image:CompilersTopDownParsingExercise9.jpg\|600px]]

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

Root: /* Solution */

2013-03-29T20:49:14Z

Solution

← Older revision		Revision as of 20:49, 29 March 2013
Line 14:		Line 14:
	== Solution ==		== Solution ==

	[[Image:CompilersTopDownParsingExercise9.jpg~~\|600px~~]]		[[Image:CompilersTopDownParsingExercise9.jpg]]

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

Root: /* Solution */

2013-03-29T20:47:37Z

Solution

← Older revision		Revision as of 20:47, 29 March 2013
Line 14:		Line 14:
	== Solution ==		== Solution ==

	[[Image:CompilersTopDownParsingExercise9.jpg\|~~600~~]]		[[Image:CompilersTopDownParsingExercise9.jpg\|600px]]

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

Root: /* Solution */

2013-03-29T20:47:27Z

Solution

← Older revision		Revision as of 20:47, 29 March 2013
Line 14:		Line 14:
	== Solution ==		== Solution ==

	[[Image:CompilersTopDownParsingExercise9.jpg]]		[[Image:CompilersTopDownParsingExercise9.jpg\|600]]

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

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: C -> v A ->..."

2013-03-29T20:30:15Z

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: C -> v A ->..."

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:

C -> v
A -> B x | z C A y
B -> A v | z C w | (eps)

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

== Solution ==

[[Image:CompilersTopDownParsingExercise9.jpg]]

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

Top-Down Parsing/Exercise 9 - Revision history

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

Root at 07:33, 7 April 2018

Root at 14:42, 6 April 2015

Root: /* Solution */

Root: /* Solution */

Root: /* Solution */

Root: /* Solution */

Root: /* Solution */

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: C -> v A ->..."

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: C -> v A ->..."