Respuesta :
It is possible to exist inherently ambiguous languages generated by unambiguous grammar; however, it is not possible to have ambiguous grammar and unambiguous grammar for the same language: FALSE
What is Ambiguous grammar?
- In computer science, an ambiguous grammar is one in which a string can have more than one leftmost derivation or parse tree, whereas an unambiguous grammar is one in which every valid string has a unique leftmost derivation or parse tree.
- Many languages allow both ambiguous and unambiguous grammar, while others solely allow ambiguous grammar.
- Any non-empty language can accept ambiguous grammar by introducing a duplicate rule or synonym into unambiguous grammar (the only language without ambiguous grammar is the empty language).
- Inherently ambiguous languages formed by the unambiguous grammar are not possible because that is the concept of inherent ambiguity.
- No DCFL is fundamentally ambiguous; every DCFL must have some unambiguous grammar.
Therefore, the statement "it is possible to exist inherently ambiguous languages generated by unambiguous grammar; however, it is not possible to have ambiguous grammar and unambiguous grammar for the same language" is FALSE.
Know more about Ambiguous grammar here:
https://brainly.com/question/12972361
#SPJ4
The complete question is given below:
It is possible to exist inherently ambiguous languages generated by unambiguous grammar; however, it is not possible to have ambiguous grammar and unambiguous grammar for the same language. TRUE or FALSE.
