Question: When it is possible to produce two different parse trees for the same sentence using a particular grammar, what kind of grammar is that? Question

When it is possible to produce two different parse trees for the same sentence using a particular grammar, what kind of grammar is that?
Question 15 options:
A left linear grammar
An ambiguous grammar
A context free grammar
A BNF grammar

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!