Theory of Computation (Automata)

What is the function or purpose of Ambiguous grammar?

• A. A class of languages for which a Turing machine will accept and halt on strings in the language, but may not halt on strings outside it.
• B. A grammar for which some string can be generated by more than one distinct derivation tree. ✓
• C. The process of reducing a deterministic finite automaton to the smallest possible number of states while preserving its language.
• D. The sequence of production rule applications used to generate a string from a grammar's start symbol.