Menu

Question Discussion & Solution

MCQ
Q.
The following Context-Free Grammar (CFG): S ? aB | bA A ? a | aS | bAA B ? b | bS | aBB will generate (1) odd numbers of a

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. 
Consider the following languages: L1 = {am bn ? m ? n} L2 = {am bn ? m = 2n+1} L3 = {am bm ? m ? 2n} Which one of the following statement is correct ?
forum Discussion
MCQ
2.
For the correct answer strings to above question, how many derivation trees are there?
forum Discussion
MCQ
3.
The language of all non-null strings of a
forum Discussion
MCQ
4.
Which variable does not drive a terminal string in grammar? S -> AB A -> a B -> b B -> C
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