I assume GP means general recursion. Recursion in a pushdown automata (the equivalent machine for a CFL) is bounded by the input words being consumed, since ea

I assume GP means general recursion. Recursion in a pushdown automata (the equivalent machine for a CFL) is bounded by the input words being consumed, since each state transition consumes one input token. Since all input words are finite, indefinite recursion is excluded.