
430 Appendix A
Theorem A.5.3 For every CFG G, there is a PDA recognizing the language L(G).
Theorem A.5.4 For every PDA M, there is a CFG G, generating a language L(G), such that M
recognizes the language L(G).
A.5.4 Pumping Lemma for Context-free Languages
The pumping lemma for class CFL is derived from the corresponding
grammar. Consider the grammar used as an example in Section A.5.2.
If we derive a string “a * (a + a)” in this grammar, the derivation tree
will be as shown in Fig. A.15.
This derivation tree can be broken down into three “jig-saw pieces” as
shown in Fig. A.16.
The pieces are named as A, B and C and represent portions of ...