AMA University Answers
Login
Register
AMA OED
Courses
CS
CS-6205
A grammar G is ambiguous if th...
A grammar G is ambiguous if there is a word w Î L(G) having are least two different parse trees.
TRUE
Correct
Similar CS-6205 questions
A good regular expression of a person's name is .
A good regular expression for any valid whole number is .
A good regular expression for any valid real number using engineering notation is .
Is used to derive a string using the production rules of a grammar.
is used to derive a string using the production rules of a grammar.
Language may be derived from other strings using the productions in a grammar.