• retagged by
798 views
1 1 vote

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

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

  1. $E$$\rightarrow$ $aE'$|$ bE'$ ;   $E$'$\rightarrow$ $aE'$ $|$ $bE'$ | $\epsilon$
  2. $E$$\rightarrow$ $aE' $|$ bE'$;  $E$'$\rightarrow$$aE$ $|$ $bE$ $|$ $\epsilon$   
  3. $E$$\rightarrow$ $aE' $|$ bE'$ $|$$\epsilon$ ;  $E'$ $\rightarrow$ $aE'$ $|$ $bE'$ |$\epsilon$
  4. $E$$\rightarrow$ $aE' $|$  bE'$;  $E'$ $\rightarrow$ $a$ | $b$ $|$ $\epsilon$

1 Answer

Answer:
Position:
Show:

Related questions

2 2 votes
1 answers 1 answer
1.5k
1.5k views
Bikram asked Jan 16, 2017
1,521 views
For the given grammar consider the statements:$S' \rightarrow S$$S \rightarrow aAd \mid bBd \mid aBe \mid bAe$$A \rightarrow c$$B \rightarrow c$Which of the following...
1 1 vote
1 answers 1 answer
855
855 views
Bikram asked Jan 16, 2017
855 views
Consider the following grammar for Boolean expression:$E$ $\rightarrow$ $E$ OR $E$$E$ $\rightarrow$ $E$ AND$E$$E$ $\rightarrow$ NOT $E$$E$ $\rightarrow$ $\left ( E \right...
1 1 vote
1 answers 1 answer
791
791 views
Bikram asked Jan 16, 2017
791 views
Match the following:List IList IIABackus Naur form 1Regular expressionBLex2$\left ( I \right )$$LALR$CYacc3$LL$$\left ( 1 \right )$DRecursive descent parsing 4$CFG's$ $...
9 9 votes
2 answers 2 answers
2.9k
2.9k views
Bikram asked Jan 16, 2017
2,858 views
Consider following recursive functions:function fib(n : integer); integer begin if (n = 0) or (n = 1) then fib = 1 else fib = fib(n-l) + fib(n-2) endThe above function is...