Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability
Which of the following statements is/are TRUE?
I. A CFG G is said to be unambiguous if every string ω ϵ L(G) has exactly one parse tree.
II. A CFG G is said to be ambiguous if every string ω ϵ L(G) has two or more distinct parse trees.
III. A language L is said to be inherently ambiguous if every grammar that generates L is ambiguous.
1
I only
2
I and III only
3
II and III only
4
I, II, and III