Which of the following statement is false?...

MCQ

Which of the following statement is false?

The context free language can be converted into Chomsky normal form

The context free language can be converted into Greibach normal form

The context free language is accepted by pushdown automata

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

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 the following statement is false?

A recursive language is also a regular language

A context free language is also a regular language

A context free language is also recursive enumerable language

Both (a) and (b)

Discussion

MCQ

Let G be the CFG, l be the number of left most derivations, r be the number of right most derivations and P be the number of parse trees. Assume l , r and P are computed for a particular string. For a given CFG

l ? P ? r

l = P = r

l ? P ? r

none of these

Discussion

MCQ

CFG (Context Free Grammar) is not closed under

Union

Complementation

Kleene star

Product

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 variable

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

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