Which of the following can generate Unrestricted grammars?
(a) Pentonnen Normal form
(b) Floyd Normal form
(c) Greibach Normal form
(d) None of the mentioned
The question was posed to me during an online interview.
The above asked question is from CFL- Other Normal Forms in section Properties of Context Free Languages of Automata Theory