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

###### Asked By : user393454

###### Answered By : Yuval Filmus

Such an algorithm is described in Koch and Blum, Greibach Normal Form Transformation, Revisited.

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

**3200 people like this**

## 0 comments:

## Post a Comment

Let us know your responses and feedback