Automata and Computability

Let G be CFG in Chomsky normal form that contains b variables.  Show that, if G generates some string using a derivation with more than b steps, L (G) is infinite.