📚 Question Bank Q70 — Theory of Computation
Tags
Theory of Computation
Q70. Marks: +2.0 UGC NET Paper 2: Computer Science 8th Oct 2022

Consider the grammer S → SbS | a.

Consider the following statements:

The string abababa has

(A) two parse trees

(B) two left most derivations

(C) two right most derivations

Which of the following is correct?

1.All (A), (B) and (C) are true ✓ Correct
2.Only (B) is true
3.Only (C) is true
4.Only (A) is true
📄 All “Theory of Computation” questions across papers
🏷 Change Tag for this Question