Let G = (V, T, S, P) be a context-free grammar such that eve...

MCQ

Let G = (V, T, S, P) be a context-free grammar such that every one of its productions is of the form A ? ?, with |?| = k > 1. The derivation tree for any string W ? L (G) has a height such that

h<((|W| - 1)/k-1)

log_k|W| < h

log_k|W| < h < ((|W| - 1)/k-1)

log_k|W| <= h <= ((|W| - 1)/k-1)

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 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

Are ambiguous grammar context free?

Yes

Discussion

MCQ

Which of the following statement is false?

The CFG can be converted to Chomsky normal form

The CFG can be converted to Greibach normal form

CFG is accepted by pushdown automata

Discussion

MCQ

Reverse of a DFA can be formed by----

using PDA

making final state as non-final

making final as starting state and starting state as final state

None of the above

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

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