Theory of Computation Context Free Languages and Pushdown Automata Ambiguity

A grammar that produces more than one parse tree of a sentence is known as:

1

Non ambiguous

2

Ambiguous

3

Regular

4

Context sensitive

5

Non- Regular

Sponsored

hivanix.in

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters