MadeEasy Test Series 2018: Compiler Design - Left Recursion

Question

I think the answer should be option: C but it is given option A.

Providing the snapshot of the question with the options provided.

I don't think option A should be the correct one, even if it then we cannot derive string "bda" from option A which is possible in the original grammar.

Please help with this question.

Thanks in advance.

Comments

none of the option is correct. i am really frustrated by seeing so many wrong questions in madeeasy test series.

---

agreed

---

"ca" is not being generated by option C but the actual grammer generates it

Answer 1

Ans is

S->Ab|b

A-> A' |bdA'

A'->cA' |adA' |null

Ans D is correct

Answer 2

S -> Aa/b

A -> Ac/Aad/bd/epsilon

there is left recursion for A production so remove it

A -> bdA'/A'       ------------ here A' for epsilon production as A ->epsilon  from the given production

A' -> cA'/adA'/epsilon

hence option (a) is correct

Comments

Option (A) is wrong here, it should be $A’\rightarrow bdA’/A’$

None of the given options is correct.

Answer 3

Your answer is correct,

The solution provided is wrong.

In the original grammar, we can generate $bda$

by using $S \rightarrow Aa$ and $A \rightarrow bd$, which will give bda

however, in the solution grammar provided, there is no way to generate $bda$

as there is no way to get $A \rightarrow bd$.

Answer 4

option B is correct 

option A can’t generate  bda

option C cant generate  cca