Register

Ace Test Series: Compiler Design - Left Recursion Elimination

• retagged by
1,619 views

1 Answer

0 votes
0 votes

Ans: B

$\\A\rightarrow eA' \\A'\rightarrow CA'|\varepsilon \\ C\rightarrow eC' \\C'\rightarrow aC'|\varepsilon$

After removing NULL production:

$\\A\rightarrow eA'|e \\A'\rightarrow CA'|C \\ C\rightarrow eC'|e \\C'\rightarrow aC'|a$

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
2 answers
1
saumya mishra asked Jun 11, 2018
1,747 views
Left recursion
In this question should we eliminate left recursion by putting values of S and A in the respective productions so answer will be c but if according to the given production than answer will be a how to solve?
In this question should we eliminate left recursion by putting values of S and A in the respective productions so answer will be c but if according to the given productio...
User Avatar
1 votes
1 votes
4 answers
2
reena_kandari asked Jan 5, 2017
698 views
Compiler
Consider the following grammar 1)Left Recursive 2)Ambiguos 3)Left factored 4)None of these
Consider the following grammar1)Left Recursive2)Ambiguos3)Left factored4)None of these
User Avatar
0 votes
0 votes
1 answer
4
learner_geek asked Aug 5, 2017
1,307 views
LEFT RECURSION
To avoid left recursion can we do like this. I think this is incorrect way to do
To avoid left recursion can we do like this. I think this is incorrect way to do
User Avatar
Link Copied!