Question 8900 – Compiler-Design

A given grammar is called ambiguous if

Correct Answer: C

Question 310 Explanation:

A grammar is ambiguous if any string generated by the grammar has more than one parse tree (derivation tree)

two or more production have the same non-terminal on the left hand side

A derivation tree has more than one associated sentence

there is a sentence with more than one derivation tree corresponding to it

Brackets are not present in the grammar

0 0 votes

Article Rating

0 Comments

Inline Feedbacks

View all comments