Q. A grammar G is unambiguous. Which of the following statements is/are false?

Answer: B. Every string in L(G) has exactly one leftmost derivation (LMD).; C. Every string w ∈ L(G)w has at least one rightmost derivation (RMD).; D. Some string w ∈ L(G) w has exactly one parse tree (derivation tree). — B - there can be a corresponding right most derivation for a string c- there can be a corresponding left most derivation for a string D-Incorrect w.r.t to…

1. A.

   Every string in L(G) has exactly one derivation.

2. B.

   Every string in L(G) has exactly one leftmost derivation (LMD).

3. C.

   Every string w ∈ L(G)w has at least one rightmost derivation (RMD).

4. D.

   Some string w ∈ L(G) w has exactly one parse tree (derivation tree).

Attempted by 58 students.

A video solution is available for this question — log in and enroll to watch it.