Menu

Question Discussion & Solution

MCQ
Q.
S -> aSa|bSb|a|b; The language generated by the above grammar over the alphabet {a,b} is the set of

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. 
Let G = ({S}, {a, b} R, S) be a context free grammar where the rule set R is S ? a S b | SS | ? Which of the following statements is true?
forum Discussion
MCQ
2. 
Let G = (V, T, S, P) be a context-free grammar such that every one of its productions is of the form A ? v, with |v| = K > 1. The derivation tree for any W ? L(G) has a height h such that
forum Discussion
MCQ
3.
Which variable does not drive a terminal string in grammar? S -> AB A -> a B -> b B -> C
forum Discussion
MCQ
4.
Consider the grammar with productionsS ? aSb | SS | ?This grammar is
forum Discussion
MCQ
5.
If all the production rules have single non - terminal symbol on the left side, the grammar defined 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