A CFG is ambiguous if
(a) It has more than one rightmost derivations
(b) It has more than one leftmost derivations
(c) No parse tree can be generated for the CFG
(d) None of the mentioned
The question was posed to me in final exam.
The query is from Ambiguous Grammar in section Context Free Grammars and Languages of Automata Theory