adplus-dvertising
frame-decoration

Question

The following format of grammatical notation is accepted by which of the following:
AB->CD

A->BC or

A->B or

A->a

where A, B, C, D are non terminal symbols and a is a terminal symbol.

a.

Greibach Normal Form

b.

Chomsky Nrmal Form

c.

Kuroda Normal Form

d.

None of the mentioned

Answer: (c).Kuroda Normal Form

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The following format of grammatical notation is accepted by which of the following: AB->CD A->BC or A->B or A->a where A, B, C, D are non terminal symbols and a is a...

Similar Questions

Discover Related MCQs

Q. Every Kuroda Normal form grammar generates ___________

Q. Which of the following can generate Unrestricted grammars?

Q. Given a grammar in GNF and a derivable string in the grammar with the length n, any ___________will halt at depth n.

Q. Which of the following grammars is similar to Floyd Normal form?

Q. Which among the following can parse a context free grammar?

Q. The standard version of CYK algorithm operates only on context free grammars in the following form:

Q. The __________ running time of CYK is O(n^3 .|G|)
where n is the length of the parse string and |G| is the size of the context free grammar G.

Q. Which of the following is true for Valiants algorithm?

Q. Which among the following is a correct option in format for representing symbol and expression in Backus normal form?

Q. Which of the following is not a negative property of Context free languages?

Q. The intersection of context free language and regular language is _________

Q. Which of the following is regular?

Q. Which of the following is not context free?

Q. Which of the following can be used to prove a language is not context free?

Q. Which of the following are valid membership algorithms?

Q. Which of the following belong to the steps to prove emptiness?

Q. Which of the following is true for CYK Algorithm?

Q. Which of the following steps are wrong with respect to infiniteness problem?

Q. State true or false:
Statement: Every context free language can be generated by a grammar which contains no useless non terminals.