I have recently starting studying Theory of computation. I have some basic doubts. Can you please clarify my doubts?
Inherently ambiguous CFL means there is no unambiguous grammer(why can'nt we say atleast 1 possible grammer for that CFL are ambiguous?). Also can you please explain difference between ambiguous CFL and ambiguous grammer
Another doubt -
I saw that set of palindromes is inherently unambiguous. It means all grammers possible for that language of palindromes is unambiguous. But i saw in textbook example that $S \to aSa/bSb/ \epsilon $ is ambiguous(Please correct me if i am wrong here). Then how can the set of palindromes inherently unambiguous.