BANK IBPS SO Mock Test (Pre + Mains) 2024 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