Consider the CFG with { S, A, B } as the non-terminal alphabet, { a, b } as…

GATE · 2007 · CS

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 string to Q.78, how many derivation trees are there?

  1. A.

    1

  2. B.

    2

  3. C.

    3

  4. D.

    4

Attempted by 36 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…