Direction: Consider the CFG with {S, A, B} as the non-terminal alphabet, {a, b} as the terminal alphabet, S as the start symbol and the following set of production rules 
-
For the correct answer strings to Q. above, how many derivation trees are there?
-
- 1
- 2
- 3
- 4
- 1
Correct Option: B
The string received is aabbab. We can total 2 derivation trees: Leftmost derivation and rightmost derivation.
