Examlex

Solved

A Grammar for Which Two Distinct Parse Trees Are Possible

question 5

True/False

A grammar for which two distinct parse trees are possible for the same string is considered to be ambiguous.


Definitions:

Related Questions