Question

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

(a) Backus Naur Form

(b) Kuroda Normal Form

(c) Greibach Normal Form

(d) Chomsky Normal Form

I have been asked this question in a job interview.

My doubt stems from CFL- Other Normal Forms in chapter Properties of Context Free Languages of Automata Theory

Answer 1

Right answer is (a) Backus Naur Form

To elaborate: Donald Knuth implied a BNF” syntax in which all definitions have such a form may be said to be in ”Floyd Normal Form”.

A->B|C

A->BC

A->a