What is meant by Greibach Normal Form in Theory of Automata and Formal Languages?

Correct Answer: A

a CFG form where productions begin with a terminal followed by zero or more non-terminals

The correct answer is a CFG form where productions begin with a terminal followed by zero or more non-terminals.