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.
Production Rule: aAb->agb belongs to which of the following category?
forum Discussion
MCQ
2.
A CFG G is given with the following productions where S is the start symbol, A is a non-terminal and a and b are terminals.
S?aS?A
A?aAb?bAa??
For the correct answer in Q75, how many steps are required to derive the string and how many parse trees are there?
forum Discussion
MCQ
3.
The context free grammer S->SS | oS1 | 1So |  e generates
forum Discussion
MCQ
4.
Consider the following context free languages:
L1 = {0^i 1^j 2^k | i+j = k}
L2 = {0^i 1^j 2^k | i = j or j = k}
L3 = {0^i 1^j  | i = 2j+1}
 Which of the following option is true?
forum Discussion
MCQ
5.
Grammar that produce more than one Parse tree for same sentence is ___________
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