Definition
Greibach Normal Form
A context-free grammar is in Greibach normal form if every production rule has the form
where
is a terminal symbol, is a non-terminal symbol, and is a (possibly empty) string of non-terminal symbols. For every context-free grammar
, one can construct an equivalent grammar in Greibach normal form.