Menu

Question Discussion & Solution

MCQ
Q.
Let G be the CFG, l be the number of left most derivations, r be the number of right most derivations and P be the number of parse trees. Assume l , r and P are computed for a particular string. For a given CFG

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
The context free grammar S ? SS | 0S1 | 1S0 | ? generates
forum Discussion
MCQ
2.
Which of these does not belong to CFG ?
forum Discussion
MCQ
3.
The context free grammar S ? A111|S1, A ? A0 | 00 is equivalent to _________
forum Discussion
MCQ
4.
The minimum number of productions required to produce a language consisting of palindrome strings over ?={a,b} is
forum Discussion
MCQ
5.
The language L={0?1?0?| m ? 1} is a
forum Discussion

category More Theory of Automata Topics

article

Reqular Expressions

format_list_bulleted 114 MCQs
Practice arrow_forward
article

Finite Automata

format_list_bulleted 44 MCQs
Practice arrow_forward
article

Context Free Grammars

format_list_bulleted 76 MCQs
Practice arrow_forward
article

Push Down Automata

format_list_bulleted 37 MCQs
Practice arrow_forward
article

Regular and context free languages

format_list_bulleted 65 MCQs
Practice arrow_forward
article

Pumping Lemma

format_list_bulleted 14 MCQs
Practice arrow_forward
article

Turning Machine

format_list_bulleted 14 MCQs
Practice arrow_forward