Let G be a context-free grammar where G = ( { S, A, B, C}, {...

MCQ

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.)

the set of all binary strings with unequal number of 0's and 1's

the set of all binary strings including null string

the set of all binary strings with exactly one more 0 than the number of 1

None of the above

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

While converting the context free grammar into Greibach normal form, which of the following is not necessary

Elimination of null production

Elimination of unit production

Converting given grammar in Chomsky normal form

None of these

Discussion

MCQ

Which of these does not belong to CFG ?

Terminal Symbol

Non Terminal Symbol

Start Symbol

End Symbol

Discussion

MCQ

The context free grammar S ? A111|S1, A ? A0 | 00 is equivalent to _________

{0ⁿ1^m | n=2, m=3}

{0ⁿ1^m | n=1, m=5}

{0ⁿ1^m | n should be greater than two and m should be greater than four}

None of the mentioned

Discussion

MCQ

The number of elements present in the ?-closure(A) in the given diagram.

Discussion

MCQ

Which of following statement(s) is/are not correct? (I) Languages generated by the grammar S?aSa ? aa is not regular. (II) Languages generated by the grammar S?aSb ? aa is not regular. (III) Languages generated by the grammar S?S1|S3, S1?aS1c |S2|?, S2?aS2b|?, S3?aS3b|S4| ?, S4?bS4c|? is {a^nb^mc^k | k = |n - m|, n?0, m?0, k?0}. (IV) Languages generated by the grammar S?S1S3, S1?aS1c |S2|?, S2?aS2b|?, S3?aS3b|S4| ?, S4?bS4c|? is {a^nb^mc^k | k = |n - m|, n?0, m?0, k?0}.

Only (II), (IV)

Only (I), (III), (IV)

Only (I), (II), (III)

All of the above

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics