(c) L contains only strings of length 2 or greater. Prove that there is a context- free grammar G' which generates L such that every rule of G' has the form A-> 1112, where A is a nonterminal, and...

Extracted text: (c) L contains only strings of length 2 or greater. Prove that there is a context- free grammar G' which generates L such that every rule of G' has the form A-> 1112, where A is a nonterminal, and each I; is a terminal or nonterminal. Let G be a context-free grammar for a language L, and suppose