Top-Down Parsing/Exercise 7 - Revision history

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

2018-12-05T22:21:15Z

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

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

	~~Consider the following grammar, where '''<tt>A</tt>''' is the initial symbol and '''<tt>{a,b,c,d,e}</tt>''' is the set of terminal symbols:~~

	~~X -> a~~
	~~A -> X c A e \| M b~~
	~~M -> A c \| X c d \| (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>acbe</tt>''' input sequence.~~

	~~== Solution ==~~

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

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

Root at 14:41, 6 April 2015

2015-04-06T14:41:51Z

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

	~~<!-- <headertabs/> -->~~		[[category:Compiladores]]
	[[category:~~Teaching~~]]		[[category:Ensino]]
	[[category:~~Compilers~~]]

Root at 13:21, 27 March 2015

2015-03-27T13:21:46Z

← Older revision		Revision as of 13:21, 27 March 2015
Line 1:		Line 1:
	{{TOCright}}		{{TOCright}}
	= Problem =		== Problem ==

	Consider the following grammar, where '''<tt>A</tt>''' is the initial symbol and '''<tt>{a,b,c,d,e}</tt>''' is the set of terminal symbols:		Consider the following grammar, where '''<tt>A</tt>''' is the initial symbol and '''<tt>{a,b,c,d,e}</tt>''' is the set of terminal symbols:
Line 12:		Line 12:
	# Show the analysis table (stack, input, and actions) for the parsing process of the '''<tt>acbe</tt>''' input sequence.		# Show the analysis table (stack, input, and actions) for the parsing process of the '''<tt>acbe</tt>''' input sequence.

	= Solution =		== Solution ==

	[[Image:CompilersTopDownParsingExercise7.jpg\|700px]]		[[Image:CompilersTopDownParsingExercise7.jpg\|700px]]

	<headertabs/>		<!-- <headertabs/> -->

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

Root at 13:20, 27 March 2015

2015-03-27T13:20:18Z

← Older revision		Revision as of 13:20, 27 March 2015
Line 12:		Line 12:
	# Show the analysis table (stack, input, and actions) for the parsing process of the '''<tt>acbe</tt>''' input sequence.		# Show the analysis table (stack, input, and actions) for the parsing process of the '''<tt>acbe</tt>''' input sequence.

	== Solution ==		= Solution =

	[[Image:CompilersTopDownParsingExercise7.jpg\|700px]]		[[Image:CompilersTopDownParsingExercise7.jpg\|700px]]

			<headertabs/>

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

Root: /* Solution */

2013-03-29T20:54:12Z

Solution

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

	[[Image:CompilersTopDownParsingExercise7.jpg\|~~500px~~]]		[[Image:CompilersTopDownParsingExercise7.jpg\|700px]]

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

Root: /* Solution */

2013-03-29T20:13:09Z

Solution

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

	[[Image:CompilersTopDownParsingExercise7.jpg\|~~600px~~]]		[[Image:CompilersTopDownParsingExercise7.jpg\|500px]]

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

Root: /* Solution */

2013-03-29T20:08:53Z

Solution

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

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

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

Root: /* Solution */

2013-03-29T19:52:48Z

Solution

← Older revision		Revision as of 19:52, 29 March 2013
Line 13:		Line 13:

	== Solution ==		== Solution ==

			[[Image:CompilersTopDownParsingExercise7.jpg]]

	[[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 '''`{a,b,c,d,e}`''' is the set of terminal symbols: X -> a A ..."

2011-05-16T14:57:27Z

Created page with "{{TOCright}} = Problem = Consider the following grammar, where '''<tt>A</tt>''' is the initial symbol and '''<tt>{a,b,c,d,e}</tt>''' is the set of terminal symbols: X -> a A ..."

New page

{{TOCright}}
= Problem =

Consider the following grammar, where '''<tt>A</tt>''' is the initial symbol and '''<tt>{a,b,c,d,e}</tt>''' is the set of terminal symbols:

X -> a
A -> X c A e | M b
M -> A c | X c d | (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>acbe</tt>''' input sequence.

== Solution ==

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

Top-Down Parsing/Exercise 7 - Revision history

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

Root at 14:41, 6 April 2015

Root at 13:21, 27 March 2015

Root at 13:20, 27 March 2015

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 '''{a,b,c,d,e}''' is the set of terminal symbols: X -> a A ..."

Root: Created page with "{{TOCright}} = Problem = Consider the following grammar, where '''`A`''' is the initial symbol and '''`{a,b,c,d,e}`''' is the set of terminal symbols: X -> a A ..."