A grammar that produces more than one parse tree for some sentence is called __________
(a) Ambiguous
(b) Unambiguous
(c) Regular
(d) None of the mentioned
I had been asked this question in an interview for job.
Enquiry is from Bottom-Up Parsing-2 in chapter Bottom Up Parsing of Compiler