World's most popular travel blog for travel bloggers.

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

###### Answered By : Yuval Filmus
Best Answer from StackOverflow

Question Source : http://cs.stackexchange.com/questions/66546

3200 people like this