retagged by
2,069 views

3 Answers

Best answer
7 votes
7 votes
There is no immediate left recursion, but there is left recursion as can be seen below.

A -> Br | x

B -> Cs | y

C -> At | z

Thus, C -> Brt | xt | z  =>  C -> Csrt | yrt | z| xt . This shows left recursion.

Now remove left recursion from  C -> Csrt | yrt | z | xt.

C -> yrtC' | zC' | xtC'

C' -> srtC' | $\epsilon$
selected by
0 votes
0 votes
There is no immediate left recursion, but there is left recursion as can be seen below.

A -> Br | x

B -> Cs | y

C -> At | z

Thus, A -> Csr| yr| x  =>  C -> Atsr| zsr |yr |x . This shows left recursion.

Now remove left recursion from  C -> Atsr| zsr |yr |x.

A -> zsrA'| yrA'| xA'
A' ->tsrA' | ϵ
–1 votes
–1 votes
There is no left recursion in this.

A left recursion is of form : A--->Aa|b;

Solution:

A-->bA'

A'-->epsilon|aA'

Related questions

2 votes
2 votes
1 answer
1
2 votes
2 votes
1 answer
2
shekhar chauhan asked Jun 4, 2016
656 views
A >AA+/AA*/ais it eligible to be used by SR parse.If we apply SR parse on this grammar then what will be the order of activation Record in Stack
4 votes
4 votes
1 answer
3
0 votes
0 votes
1 answer
4
learner_geek asked Aug 5, 2017
1,273 views
To avoid left recursion can we do like this. I think this is incorrect way to do