ACE Test series Question on CFG

Question

Comments

is it A?

---

Just working on options--> if any of B or C is true then D should be true i.e. two options will be correct in that case so Option A is correct.

Coming to exact reasoning in CFG2  if we eliminate epsilon productions it will result in CFG1 so they both are equal.

Answer 1

CFG1 is ambiguous, CFG2 is unambiguous grammar.

Both Cfgs generate same set. Epsilon is generated with 2 different derivations in cfg1 whereas in cfg1 it generated with one derivation. Remaining all strings have one derivation in both grammars.

Language generated by both cfgs is same.

L(CFG1)=L(CFG2)={a^m b^n | m=2n or n=2m}