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?

, , No Comments
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
Best Answer from StackOverflow

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

3200 people like this

 Download Related Notes/Documents

0 comments:

Post a Comment

Let us know your responses and feedback