Top-Down Parsing - Revision history

Root: Redirected page to ist:Top-Down Parsing

2018-12-05T22:26:59Z

2018-07-06T09:04:52Z

Exercises

← Older revision		Revision as of 09:04, 6 July 2018
Line 285:		Line 285:
	* [[Top-Down Parsing/Exercise 14: Test 2018/04/07\|Exercise 14]]: Test 2018/04/07		* [[Top-Down Parsing/Exercise 14: Test 2018/04/07\|Exercise 14]]: Test 2018/04/07
	* [[Top-Down Parsing/Exercise 15: Test 2018/04/07\|Exercise 15]]: Test 2018/04/07		* [[Top-Down Parsing/Exercise 15: Test 2018/04/07\|Exercise 15]]: Test 2018/04/07
			* [[Top-Down Parsing/Exercise 16: Test 2018/07/05\|Exercise 16]]: Test 2018/07/05

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

2018-04-23T17:32:35Z

Exercises

← Older revision		Revision as of 17:32, 23 April 2018
Line 283:		Line 283:
	* [[Top-Down Parsing/Exercise 12: Test 2016/04/08\|Exercise 12]]: Test 2016/04/08		* [[Top-Down Parsing/Exercise 12: Test 2016/04/08\|Exercise 12]]: Test 2016/04/08
	* [[Top-Down Parsing/Exercise 13: Test 2016/04/08\|Exercise 13]]: Test 2016/04/08		* [[Top-Down Parsing/Exercise 13: Test 2016/04/08\|Exercise 13]]: Test 2016/04/08
			* [[Top-Down Parsing/Exercise 14: Test 2018/04/07\|Exercise 14]]: Test 2018/04/07
			* [[Top-Down Parsing/Exercise 15: Test 2018/04/07\|Exercise 15]]: Test 2018/04/07

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

2017-03-16T18:48:50Z

Step 4: Factorization

← Older revision		Revision as of 18:48, 16 March 2017
Line 102:		Line 102:
	Factoring the grammar, we get the following (instead of creating a new non-terminal for factoring '''y''' in A', we used the already existing definition of A):		Factoring the grammar, we get the following (instead of creating a new non-terminal for factoring '''y''' in A', we used the already existing definition of A):
	<text>		<text>
	A -> x A' \| z A''		A -> x A' \| z A"
	A' -> x A' \| y A \| ε		A' -> x A' \| y A \| ε
	A'' -> A A' \| y A'		A" -> A A' \| y A'
	</text>		</text>

2016-04-11T10:22:27Z

Exercises

← Older revision		Revision as of 10:22, 11 April 2016
Line 281:		Line 281:
	* [[Top-Down Parsing/Exercise 10: Test 2013/04/03\|Exercise 10]]: Test 2013/04/03		* [[Top-Down Parsing/Exercise 10: Test 2013/04/03\|Exercise 10]]: Test 2013/04/03
	* [[Top-Down Parsing/Exercise 11: Test 2014/04/10\|Exercise 11]]: Test 2014/04/10		* [[Top-Down Parsing/Exercise 11: Test 2014/04/10\|Exercise 11]]: Test 2014/04/10
			* [[Top-Down Parsing/Exercise 12: Test 2016/04/08\|Exercise 12]]: Test 2016/04/08
			* [[Top-Down Parsing/Exercise 13: Test 2016/04/08\|Exercise 13]]: Test 2016/04/08

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

2015-04-14T09:40:54Z

Exercises

← Older revision		Revision as of 09:40, 14 April 2015
Line 280:		Line 280:
	* [[Top-Down Parsing/Exercise 9\|Exercise 9]]		* [[Top-Down Parsing/Exercise 9\|Exercise 9]]
	* [[Top-Down Parsing/Exercise 10: Test 2013/04/03\|Exercise 10]]: Test 2013/04/03		* [[Top-Down Parsing/Exercise 10: Test 2013/04/03\|Exercise 10]]: Test 2013/04/03
			* [[Top-Down Parsing/Exercise 11: Test 2014/04/10\|Exercise 11]]: Test 2014/04/10

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

2015-04-06T14:40:02Z

← Older revision		Revision as of 14:40, 6 April 2015
Line 281:		Line 281:
	* [[Top-Down Parsing/Exercise 10: Test 2013/04/03\|Exercise 10]]: Test 2013/04/03		* [[Top-Down Parsing/Exercise 10: Test 2013/04/03\|Exercise 10]]: Test 2013/04/03

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

2014-03-20T22:49:57Z

Step 4: Factorization

← Older revision		Revision as of 22:49, 20 March 2014
Line 95:		Line 95:
	=== Step 4: Factorization ===		=== Step 4: Factorization ===

	At this point, there is no left recursion nor left corners, but the grammar is still ambiguous (several productions have the same LOOKAHEAD sets:		At this point, there is no left recursion nor non-terminal left corners, but the grammar is still ambiguous (several productions have the same LOOKAHEAD sets:

	A -> '''x''' A' \| '''z''' A A' \| '''z''' '''y''' A'		A -> '''x''' A' \| '''z''' A A' \| '''z''' '''y''' A'

2014-03-20T22:48:12Z

Step 3: Eliminating Left Recursion

← Older revision		Revision as of 22:48, 20 March 2014
Line 68:		Line 68:
	=== Step 3: Eliminating Left Recursion ===		=== Step 3: Eliminating Left Recursion ===

	The strategy for eliminating left-recursion is to transform a left-recursive grammar into a righ-recursive ~~grammar~~.		The strategy for eliminating left-recursion is to transform a left-recursive grammar into a righ-recursive one.

	The rewriting of the grammar from left- to right-recursive is based on the observation that a left-recursive rule may be written as a sequence of ''n'' recursive (Aα<sub>1</sub>..Aα<sub>n</sub>) and ''m'' non-recursive (β<sub>1</sub>..β<sub>m</sub>) productions:		The rewriting of the grammar from left- to right-recursive is based on the observation that a left-recursive rule may be written as a sequence of ''n'' recursive (Aα<sub>1</sub>..Aα<sub>n</sub>) and ''m'' non-recursive (β<sub>1</sub>..β<sub>m</sub>) productions:

2014-03-20T22:47:43Z

Step 2: Eliminating the Left Corner

← Older revision		Revision as of 22:47, 20 March 2014
Line 64:		Line 64:
	<font color="red">C -> '''z''' A \| '''z''' '''y'''</font>		<font color="red">C -> '''z''' A \| '''z''' '''y'''</font>

	At this point, the grammar does not have any mutual recursion or left corners. The next step is to eliminate left-recursion.		At this point, the grammar does not have any mutual recursion or non-terminal left corners (other than the start symbol). The next step is to eliminate left-recursion.

	=== Step 3: Eliminating Left Recursion ===		=== Step 3: Eliminating Left Recursion ===