Menu

Question Discussion & Solution

MCQ
Q.
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 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.
Which of the following sentences can be generated by

S -> aS | bA
A -> d | cA
forum Discussion
MCQ
2.
Consider the languages:
L1 = {wwR |w ? {0, 1}*}
L2 = {w#wR | w ? {0, 1}*}, where # is a special symbol
L3 = {ww |  w ?  (0, 1}*)
 Which one of the following is TRUE?
forum Discussion
MCQ
3.
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 Discussion
MCQ
4.
Which of the following strings is not generated by the following grammar?S ? SaSbS|?
forum Discussion
MCQ
5.
Consider the language L = { an ? n?0 }?{ anbn ? n?0 } and the following statements.I. L is deterministic context-free.II. L is context-free but not deterIII. L is not LL(k) for any k.Which of the above statements is/are TRUE ?
forum Discussion

category More Theory of Automata Topics

article

Reqular Expressions

format_list_bulleted 114 MCQs
article

Finite Automata

format_list_bulleted 44 MCQs
article

Context Free Grammars

format_list_bulleted 76 MCQs
article

Push Down Automata

format_list_bulleted 37 MCQs
article

Regular and context free languages

format_list_bulleted 65 MCQs
article

Pumping Lemma

format_list_bulleted 14 MCQs
article

Turning Machine

format_list_bulleted 14 MCQs