0 votes 0 votes Find a context-free grammar that can generate all the production rules for context-free grammars with $T =$ {$a, b$} and $V =$ {$A, B, C$}. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation context-free-grammar + – Naveen Kumar 3 asked Apr 14, 2019 Naveen Kumar 3 140 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.