0 votes 0 votes “Two-standard form is general; for any context-free grammar $G$ with $λ ∉ L (G),$ there exists an equivalent grammar in two-standard form.” Prove this. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation context-free-grammar + – Naveen Kumar 3 asked Apr 19, 2019 Naveen Kumar 3 132 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.