Which of the following statements are correct for a concept called inherent ambiguity in CFL?
(a) Every CFG for L is ambiguous
(b) Every CFG for L is unambiguous
(c) Every CFG is also regular
(d) None of the mentioned
I had been asked this question in examination.
This question is from The Language of a Grammar, Inferences and Ambiguity in division Context Free Grammars and Languages of Automata Theory