0 votes 0 votes Can every linear grammar be converted to a form in which all productions look like $A → ax,$ where $a∈ T$ and $x∈V$ $\cup$ {$\lambda$} ? Theory of Computation peter-linz peter-linz-edition4 theory-of-computation context-free-grammar gnf + – Naveen Kumar 3 asked Apr 19, 2019 Naveen Kumar 3 372 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes for a CFG the productions are of the form: A->x where A belongs to V and x belongs to (V U T)* so if your grammar is CFG then CNF and GNF can be obtained ByteCode answered Jan 19 ByteCode comment Share Follow See all 0 reply Please log in or register to add a comment.