Ambiguous – Theory of Computing
| Question 1 UGC NET June-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: |
| A – (A) and (B) only |
| B – (B) only |
| C – (B) and (C) only |
| D – (A) and (B) only |