1 1 vote What will be the resulting grammar after removal of left-recursion from the following grammar? $E$ $\rightarrow$ $Ea $|$ Eb $|$ a $|$ b$ $E$$\rightarrow$ $aE'$|$ bE'$ ; $E$'$\rightarrow$ $aE'$ $|$ $bE'$ | $\epsilon$ $E$$\rightarrow$ $aE' $|$ bE'$; $E$'$\rightarrow$$aE$ $|$ $bE$ $|$ $\epsilon$ $E$$\rightarrow$ $aE' $|$ bE'$ $|$$\epsilon$ ; $E'$ $\rightarrow$ $aE'$ $|$ $bE'$ |$\epsilon$ $E$$\rightarrow$ $aE' $|$ bE'$; $E'$ $\rightarrow$ $a$ | $b$ $|$ $\epsilon$ GATE tbb-mockgate-1 grammar compiler-design + – Bikram 798 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 1 1 vote Ans-A http://www.csd.uwo.ca/~moreno/CS447/Lectures/Syntax.html/node8.html swap_it answered Jan 26, 2017 • selected Feb 7, 2017 by Bikram swap_it comment Share Follow See 1 comment 1 1 comment reply neeraj commented Feb 5, 2017 reply Follow flag This short video will be really helpful in learning removal of left recursion. https://www.youtube.com/watch?v=H7iGUr2W5N8 2 2 replyShare Please log in or register to add a comment.