Top-Down Parsing/Exercise 6 - Revision history

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

2018-12-05T22:20:47Z

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

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

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

	~~O -> a~~
	~~G -> F c \| O c d \| (eps)~~
	~~F -> G b \| O c F e~~

	# ~~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~~:Top-Down Parsing~~-exercise-06.jpg\|800px\|Temporary handwritten solution]]~~

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

Root: /* Problem */

2017-03-17T14:32:48Z

Problem

← Older revision		Revision as of 14:32, 17 March 2017
Line 4:		Line 4:
	Consider the following grammar, where '''<tt>F</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>F</tt>''' is the initial symbol and '''<tt>{a,b,c,d,e}</tt>''' is the set of terminal symbols:

	~~F -> G b \| O c F e~~
	O -> a		O -> a
	G -> F c \| O c d \| (eps)		G -> F c \| O c d \| (eps)
			F -> G b \| O c F e

	# 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 at 14:41, 6 April 2015

2015-04-06T14:41:21Z

← Older revision		Revision as of 14:41, 6 April 2015
Line 16:		Line 16:
	[[Image:Top-Down Parsing-exercise-06.jpg\|800px\|Temporary handwritten solution]]		[[Image:Top-Down Parsing-exercise-06.jpg\|800px\|Temporary handwritten solution]]

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

Root: /* Solution */

2015-03-27T13:27:06Z

Solution

← Older revision		Revision as of 13:27, 27 March 2015
Line 14:		Line 14:
	== Solution ==		== Solution ==

	[[Image:Top-Down Parsing-exercise-06.~~png~~\|800px\|Temporary handwritten solution]]		[[Image:Top-Down Parsing-exercise-06.jpg\|800px\|Temporary handwritten solution]]

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

Root: /* Solution */

2012-03-24T18:25:21Z

Solution

← Older revision		Revision as of 18:25, 24 March 2012
Line 14:		Line 14:
	== Solution ==		== Solution ==

	[[Image:Top-Down Parsing-exercise-06.png\|Temporary handwritten solution]]		[[Image:Top-Down Parsing-exercise-06.png\|800px\|Temporary handwritten solution]]

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

Root: /* Solution */

2012-03-24T18:24:29Z

Solution

@@ Line 14: / Line 14: @@
 == Solution ==
-=== Semantic tree and dependency graph ===
+[[Image:Top-Down Parsing-exercise-06.png|Temporary handwritten solution]]
 [[category:Teaching]]
 [[category:Compilers]]

Root at 18:15, 24 March 2012

2012-03-24T18:15:48Z

← Older revision		Revision as of 18:15, 24 March 2012
Line 16:		Line 16:
	=== Semantic tree and dependency graph ===		=== Semantic tree and dependency graph ===

	"x" is an inherited attribute (propagation in blue); "val" is a synthesized attribute (~~propagration~~ in red).		"x" is an inherited attribute (propagation in blue); "val" is a synthesized attribute (propagation in red).

	Temporary handwritten solution.		Temporary handwritten solution.

	[[Image:Top-Down Parsing~~/Exercise~~ 6.png]]		[[Image:Top-Down Parsing-exercise-6-semantic-tree-1.png]]

	=== Attribute grammar using only synthesized attributes ===		=== Attribute grammar using only synthesized attributes ===

			We start by noting that the semantic computed by the previous grammar corresponds to base 5-like numbering (although the digits do not belong to base 5).

			The new grammar is trivial to write:

			<text>

			</text>

			"val" is a synthesized attribute (propagation in red).

			Temporary handwritten solution.

			[[Image:Top-Down Parsing-exercise-6-semantic-tree-2.png]]

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

Root: /* Solution */

2012-03-24T18:11:26Z

Solution

@@ Line 13: / Line 13: @@
 == Solution ==
 [[category:Teaching]]
 [[category:Compilers]]

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

2011-05-16T14:54:57Z

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

New page

{{TOCright}}
= Problem =

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

F -> G b | O c F e
O -> a
G -> F c | O 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 6 - Revision history

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

Root: /* Problem */

Root at 14:41, 6 April 2015

Root: /* Solution */

Root: /* Solution */

Root: /* Solution */

Root at 18:15, 24 March 2012

Root: /* Solution */

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

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