Which of these does not belong to CFG ?...

MCQ

Which of these does not belong to CFG ?

Terminal Symbol

Non Terminal Symbol

Start Symbol

End Symbol

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

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

Discussion

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

Which of the following language(s) generates more than one parse tree for a string ?

L1 = {a^nb^mc^md^n ? {a, b, c, d}* | n, m ? 0} 
      ? {a^nb^nc^md^m ? {a, b, c, d}* | n, m ? 0} 

L2 = {a^nb^mc^m ? {a, b, c}* | n, m ? 0} 
      ? {a^nb^nc^m ? {a, b, c}* | n, m ? 0}

L3 = {a^nb^mc^p ? {a, b, c}* | n ? m; n, m ? 0} 
      ? {a^nb^mc^p ? {a, b, c}* | m ? p; n, m ? 0}

Only L1 and L2

Only L1 and L3

Only L2 and L3

All L1, L2, and L3

Discussion

MCQ

The context free grammar S ? A111|S1, A ? A0 | 00 is equivalent to

{0?1? | n=2, m=3}

{0?1? | n=1, m=5}

{0?1? | n should be greater than two and m should be greater than four}

None of these

Discussion

MCQ

Production Rule: aAb->agb belongs to which of the following category?

Regular Language

Context free Language

Context Sensitive Language

Recursively Ennumerable Language

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