A CFG is in strong GNF when all rewrite rules are in the following form:
$A \rightarrow aA_1...A_n$
where $n \leq 2$.
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.Sign up to join this community
Such an algorithm is described in Koch and Blum, Greibach Normal Form Transformation, Revisited.