A grammar with more than one parse tree is called: A. Unambiguous

a-grammar-with-more-than-one-parse-tree-is-called-a-unambiguous

A grammar with more than one parse tree is called:

A. Unambiguous

B. Ambiguous

C. Regular

D. None of the mentioned

I have been asked this question at a job interview.

I need to ask this question from Construction and Yield of a Parse Tree topic in division Context Free Grammars and Languages of Automata Theory

The correct choice is B. Ambiguous

To explain: A context free grammar G is ambiguous if there is at least one string in L(G) having two or more distinct derivation trees or equivalently, two or more distinct leftmost derivations.