LALR(1) Exercises - Revision history

Root: Redirected page to Bottom-Up Parsing

2016-04-21T13:59:20Z

← Older revision		Revision as of 13:59, 21 April 2016
Line 1:		Line 1:
	~~{{TOCright}}~~		#REDIRECT[[Bottom-Up_Parsing]]


	~~== Answers ==~~

	* [~~http://www.l2f.inesc~~-~~id.pt/~david/ist/docencia/compiladores/2007-2008/lalr1-ex123.pdf Answers to exercises 1, 2, and 3]~~
	* [[Answers to LALR(1) Tests]]

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

Root: Replaced content with "{{TOCright}} == Answers == * [http://www.l2f.inesc-id.pt/~david/ist/docencia/compiladores/2007-2008/lalr1-ex123.pdf Answers to exercises 1, 2, and 3] * Answers to LAL..."

2016-04-21T13:54:36Z

Replaced content with "{{TOCright}} == Answers == * [http://www.l2f.inesc-id.pt/~david/ist/docencia/compiladores/2007-2008/lalr1-ex123.pdf Answers to exercises 1, 2, and 3] * Answers to LAL..."

← Older revision		Revision as of 13:54, 21 April 2016
Line 1:		Line 1:
	{{TOCright}}		{{TOCright}}
	~~== Exercise 1 ==~~

	~~Consider the following grammar, where S is the initial symbol and { a, b } is the set of terminal symbols:~~
	~~<text>~~
	~~S -> G b b \| a a b \| b G a~~
	~~G -> a~~
	~~</text>~~
	~~# Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.~~
	~~# Show the parsing process for input '''baaabb''' (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.~~
	~~# Is this an SLR(1) grammar? Why?~~

	~~== Exercise 2 ==~~

	~~Consider the following grammar, where E is the initial symbol and { [, ], ;, id } is the set of terminal symbols:~~
	~~<text>~~
	~~E -> [ E ; L ] \| id~~
	~~L -> E \| E ; L~~
	~~</text>~~
	~~# Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.~~
	~~# Show the parsing process for input '''[id;id;id]''' (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.~~
	~~# Is this an LL(1) grammar? Why?~~

	~~== Exercise 3 ==~~

	~~Consider the following grammar, where S is the initial symbol and { e, i, x } is the set of terminal symbols:~~
	~~<text>~~
	~~S -> i S \| i S e S \| x~~
	~~</text>~~
	~~# Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.~~
	~~# Compact the parse table, eliminating and propagating reductions.~~
	~~# Show the parsing process for input '''ixixex''' (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.~~
	~~# Is this an SLR(1) grammar? Why?~~

	~~== Exercise 4 (test) ==~~

	~~Consider the following grammar, where A is the initial symbol and { x, y, z } is the set of terminal symbols:~~
	~~<text>~~
	~~A -> B y y \| z z x \| x B x~~
	~~B -> z \| ε~~
	~~</text>~~
	~~# Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.~~
	~~# Compact the parse table, eliminating and propagating reductions.~~
	~~# Show the parsing process for input '''xx''' (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.~~

	~~== Exercise 5 (test) ==~~

	~~Consider the following grammar, where A is the initial symbol and { x, y, z } is the set of terminal symbols:~~
	~~<text>~~
	~~A -> B x y \| x y x \| x B y~~
	~~B -> z \| ε~~
	~~</text>~~
	~~# Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.~~
	~~# Compact the parse table, eliminating and propagating reductions.~~
	~~# Show the parsing process for input '''xzy''' (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.~~

	~~== Exercise 6 (test) ==~~

	~~Consider the following grammar, where A is the initial symbol and { x, y, z } is the set of terminal symbols:~~
	~~<text>~~
	~~A -> A B A x \| A y \| z~~
	~~B -> x \| z B~~
	~~</text>~~
	~~# Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.~~
	~~# Compact the parse table, eliminating and propagating reductions.~~
	~~# Show the parsing process for input '''zzxzyx''' (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.~~

	== Answers ==		== Answers ==

Root at 14:28, 6 April 2015

2015-04-06T14:28:45Z

← Older revision		Revision as of 14:28, 6 April 2015
Line 71:		Line 71:
	* [[Answers to LALR(1) Tests]]		* [[Answers to LALR(1) Tests]]

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

Root at 15:28, 23 October 2013

2013-10-23T15:28:07Z

← Older revision		Revision as of 15:28, 23 October 2013
Line 71:		Line 71:
	* [[Answers to LALR(1) Tests]]		* [[Answers to LALR(1) Tests]]

			[[category:Ensino]]
	[[category:Compilers]]		[[category:Compilers]]
	~~[[category:IST]]~~

Root at 18:39, 10 January 2009

2009-01-10T18:39:43Z

← Older revision		Revision as of 18:39, 10 January 2009
Line 38:		Line 38:
	<text>		<text>
	A -> B y y \| z z x \| x B x		A -> B y y \| z z x \| x B x
	B -> z \| Îµ		B -> z \| ε
	</text>		</text>
	# Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.		# Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.
Line 49:		Line 49:
	<text>		<text>
	A -> B x y \| x y x \| x B y		A -> B x y \| x y x \| x B y
	B -> z \| Îµ		B -> z \| ε
	</text>		</text>
	# Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.		# Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.

Root: /* Answers */

2008-05-11T09:08:50Z

Answers

← Older revision		Revision as of 09:08, 11 May 2008
Line 69:		Line 69:

	* [http://www.l2f.inesc-id.pt/~david/ist/docencia/compiladores/2007-2008/lalr1-ex123.pdf Answers to exercises 1, 2, and 3]		* [http://www.l2f.inesc-id.pt/~david/ist/docencia/compiladores/2007-2008/lalr1-ex123.pdf Answers to exercises 1, 2, and 3]
	* [[~~Solutions~~ to LALR(1) Tests]]		* [[Answers to LALR(1) Tests]]

	[[category:Compilers]]		[[category:Compilers]]
	[[category:IST]]		[[category:IST]]

Root at 09:07, 11 May 2008

2008-05-11T09:07:57Z

@@ Line 32: / Line 32: @@
 # Show the parsing process for input '''ixixex''' (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.
 # Is this an SLR(1) grammar? Why?
 == Answers ==
 * [http://www.l2f.inesc-id.pt/~david/ist/docencia/compiladores/2007-2008/lalr1-ex123.pdf Answers to exercises 1, 2, and 3]
 [[category:Compilers]]
 [[category:IST]]

Root at 14:47, 6 May 2008

2008-05-06T14:47:57Z

← Older revision		Revision as of 14:47, 6 May 2008
Line 36:		Line 36:

	* [http://www.l2f.inesc-id.pt/~david/ist/docencia/compiladores/2007-2008/lalr1-ex123.pdf Answers to exercises 1, 2, and 3]		* [http://www.l2f.inesc-id.pt/~david/ist/docencia/compiladores/2007-2008/lalr1-ex123.pdf Answers to exercises 1, 2, and 3]

			[[category:Compilers]]
			[[category:IST]]

Root: New page: {{TOCright}} == Exercise 1 == Consider the following grammar, where S is the initial symbol and { a, b } is the set of terminal symbols: S -> G b b | a a b | b G a G -> a ...

2008-05-06T14:40:15Z

New page: {{TOCright}} == Exercise 1 == Consider the following grammar, where S is the initial symbol and { a, b } is the set of terminal symbols: <text> S -> G b b | a a b | b G a G -> a </text> ...

New page

{{TOCright}}
== Exercise 1 ==

Consider the following grammar, where S is the initial symbol and { a, b } is the set of terminal symbols:
<text>
S -> G b b | a a b | b G a
G -> a
</text>
# Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.
# Show the parsing process for input '''baaabb''' (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.
# Is this an SLR(1) grammar? Why?

== Exercise 2 ==

Consider the following grammar, where E is the initial symbol and { [, ], ;, id } is the set of terminal symbols:
<text>
E -> [ E ; L ] | id
L -> E | E ; L
</text>
# Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.
# Show the parsing process for input '''[id;id;id]''' (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.
# Is this an LL(1) grammar? Why?

== Exercise 3 ==

Consider the following grammar, where S is the initial symbol and { e, i, x } is the set of terminal symbols:
<text>
S -> i S | i S e S | x
</text>
# Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.
# Compact the parse table, eliminating and propagating reductions.
# Show the parsing process for input '''ixixex''' (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.
# Is this an SLR(1) grammar? Why?

== Answers ==

* [http://www.l2f.inesc-id.pt/~david/ist/docencia/compiladores/2007-2008/lalr1-ex123.pdf Answers to exercises 1, 2, and 3]