Variable-based Grammar

Let be a Grammar
Suppose that only contains rules whose LHS is a string in
Then we say that is a variable based grammar.

Lemma

Every grammar is equivalent to a variable-based grammar

Proof

Idea: For each terminal symbol , define a variable and add appropriate rules and also add recovery rules .
Then prove that the languages are the same