Peter Linz Edition 4 Example 5.13 (Page No. 144)

Question

Consider the language $L = \{a^nb^nc^m\}U \{a^nb^mc^m\}$ with $n$ and $m$ nonnegative. Which of the following options is correct?

• A. There is no context free grammar possible for $L$.
• B. There exists a simple grammar for $L$.
• C. There exists an unambiguous grammar for $L$.
• D. There exists an ambiguous grammar for $L$.

Comments

This is the example of Inherently Ambiguous Languages. A language is called Inherently Ambiguous if there is no unambiguous CFG exist for it...  ie. all the grammars from which a language can be generated ,are ambiguous grammars.

Please refer Pravin sir's answer here :- https://gateoverflow.in/7428/grammar-generates-inherently-ambiguous-context-language

---

d option