While converting the context free grammar into Greibach norm...

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

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Consider the following context free languages:

L1 = {0^i 1^j 2^k | i+j = k}
L2 = {0^i 1^j 2^k | i = j or j = k}
L3 = {0^i 1^j  | i = 2j+1}

Which of the following option is true?

L1, L2 and L3 can be recognized by Deterministic Push down automata

L1, L2 can be recognized by Deterministic Push down automata

L1, L3 can be recognized by Deterministic Push down automata

None of the above

Discussion

MCQ

The context free grammar S ? SS | 0S1 | 1S0 | ? generates _________

Equal number of 0

Unequal number of 0

Number of 0

None of the mentioned

Discussion

MCQ

Which of the following does the given Mealy machine represents?

Discussion

MCQ

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

{0?1? | n=2, m=3}

{0?1? | n=1, m=5}

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

None of these

Discussion

MCQ

Which of the following statement is false ?

In derivation tree, the label of each leaf node is terminal

In derivation tree, the label of all nodes except leaf nodes is a variables

In derivation tree, if the root of a sub tree is X then it is called --tree

None of the mentioned

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