Theory of Computation (Automata)
Which of the following best names the concept in which a grammar for which some string can be generated by more than one distinct derivation tree?
- A. String (formal language)
- B. Ambiguous grammar ✓
- C. Universal Turing machine
- D. Pumping lemma
Correct answer
B. Ambiguous grammar
Explanation
Ambiguous grammar refers to a grammar for which some string can be generated by more than one distinct derivation tree.