Test by Bikram | Mock GATE | Test 1 | Question: 35

Question

What will be the resulting grammar after removal of left-recursion from the following grammar?

$E$ $\rightarrow$  $Ea $|$ Eb $|$ a $|$ b$

• A. $E$$\rightarrow$ $aE'$|$ bE'$ ;   $E$'$\rightarrow$ $aE'$ $|$ $bE'$ | $\epsilon$
• B. $E$$\rightarrow$ $aE' $|$ bE'$;  $E$'$\rightarrow$$aE$ $|$ $bE$ $|$ $\epsilon$   
• C. $E$$\rightarrow$ $aE' $|$ bE'$ $|$$\epsilon$ ;  $E'$ $\rightarrow$ $aE'$ $|$ $bE'$ |$\epsilon$
• D. $E$$\rightarrow$ $aE' $|$  bE'$;  $E'$ $\rightarrow$ $a$ | $b$ $|$ $\epsilon$

Answer 1

Ans-A

http://www.csd.uwo.ca/~moreno/CS447/Lectures/Syntax.html/node8.html

Comments

This short video will be really helpful in learning removal of left recursion.

https://www.youtube.com/watch?v=H7iGUr2W5N8