retagged by
1,872 views

1 Answer

2 votes
2 votes
S -> Aa/Sa/c

A -> Ab/Sd/e

after substituting the value of S in terms of A

S -> Aa/Sa/c;

A -> Ab/ Aad/e/Aaa/ca;

after removing left recursion

S -> cS'/ AaS';

S' -> aS'/epsilon;

A -> eA'/caA'

A' -> bA'/adA'/aaA'/epsilon
edited by

Related questions

2 votes
2 votes
3 answers
1
4 votes
4 votes
1 answer
2
2 votes
2 votes
1 answer
3
shekhar chauhan asked Jun 4, 2016
655 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
1 votes
1 votes
1 answer
4