Give a construction by which an arbitrary context-free grammar can be used in the proof of Theorem 7.1.
Theorem 7.1: For any context-free language L, there exists an npda M such that L = L (M).
