GATE 2007 CS – Question 79
CFG has nonterminals {S, A, B}, terminals {a, b}, start S, rules $S\to aB\mid bA$, $B\to b\mid bS\mid aBB$, $A\to a\mid aS\mid bAA$. For the correct string in Q78, how many derivation trees are there?
Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: (B) 2
Explanation
We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort