Theory of Computation Context Free Languages and Pushdown Automata Ambiguity

The grammar S → aSb | bSa | SS | ϵ is:

1

Unambiguous CFG

2

Ambiguous CFG

3

Not a CFG

4

Deterministic CFG

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