Cheap and Secure Web Hosting Provider : See Now

Is there an algorithm for converting a CFG in Greibach Normal Form into a CFG in strong GNF?

, ,
Problem Detail:

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$.