Q38 — Theory of Computation

Theory of Computation

Q38. Marks: +2.0 UGC NET Paper 2: Computer Science 2020

Which of the following grammars is (are) ambiguous?

(A) s → ss | asb | bsa | λ

(B) s → asbs | bsas | λ

(C) s → aAB

A → bBb

B → A | λ where λ denotes empty string

Choose the correct answer from the options given below:

1.(A) and (C) only

2.(B)only

3.(B) and (C) only

4.(A) (B) and (C) ✓ Correct

← Previous 3 / 9 in this subject • Back to paper Next →

🏷 Change Tag for this Question ▶