A context free language is called ambiguous if _________...

MCQ

A context free language is called ambiguous if _________

It has 2 or more left derivations for some terminal string ? ? L (G)

It has 2 or more right derivations for some terminal string ? ? L (G)

It has 2 or more left & right derivations for some terminal string ? ? L (G)

None of the mentioned

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Which of the following statement is false?

Context free language is the subset of context sensitive language

Regular language is the subset of context sensitive language

Recursively ennumerable language is the super set of regular language

Context sensitive language is a subset of context free language

Discussion

MCQ

A CFG is close under ________

Union

Kleene star

Concatenation

None of the mentioned

Discussion

MCQ

Automaton accepting the regular expression of any number of a

ab*

(a/b)*

a*b*c

Discussion

MCQ

Which of the following language accepted by a Push down Automata?

Type0

Type1

Type2

Type3

Discussion

MCQ

The Grammar can be defined as: G=(V, ?, p, S)
In the given definition, what does S represents?

Accepting State

Starting Variable

Sensitive Grammar

None of the above

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics