-
Which one of the following problems is undecidable?
-
- Deciding if a given context-free grammar is ambiguous.
- Deciding if a given string is generated by a given context-free grammar.
- Deciding if the language generated by a given context free grammar is empty.
- Deciding if the language generated by a given context free grammar is finite.
- Deciding if a given context-free grammar is ambiguous.
Correct Option: A
There is no algorithm for ambiguity of CFG
