Menu

Question Discussion & Solution

MCQ
Q.
Let G be a context-free grammar where G = ( { S, A, B, C}, { a,b, d}, P, S ) with the productions in P given below.
S ? ABAC
A ? aA ? ?
B ? bB ? ?
C ? d
 (? denotes null string). Transform the grammar G to an equivalent context-free grammar G' that has no ? productions and no unit productions. (A unit production is of the form x ? y, and x and y are non terminals.)

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 will not be accepted by the following DFA?

forum Discussion
MCQ
2.
Regular expressions are used to represent which language?
forum Discussion
MCQ
3.
The context free grammar S ? A111|S1, A ? A0 | 00 is equivalent to
forum Discussion
MCQ
4.
Are ambiguous grammar context free?
forum Discussion
MCQ
5.
The number of elements present in the ?-closure(A) in the given diagram.

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