Greibach normal form

a context-free grammar is in Greibach normal form, if all production rules are of the form:

or

where A is a nonterminal symbol, α is a terminal symbol, is a (possibly empty) sequence of nonterminal symbols not including the start symbol, S is the start symbol, and ε is the empty word.
Observe that the grammar must be without left recursions.