Arjun Sir, Sorry but I still have a doubt:
I understand that an unambiguous grammar can either generate a DCFL or a NDCFL.
But, you also wrote the following:
A grammer can be
- ambiguous -- yes, and the language can be finite, regular, deterministic context-free or non-deterministic context-free
I am not able to understand the above line. How can an ambiguous grammar be finite, regular, deterministic context-free.
Also, could you please tell what is an ambiguous language? I understand what an ambiguous grammar can be. (The grammar which can one more than parse tree), but I do not know what is an ambiguous language.
And also, for the above question, is there an unambiguous grammar available cause it is a regular language?