When we prove that a language L is not context free, we use the pumping lemma. Part of the proof involves the parameter K, which refers to

Question

Answer

the number of non-terminals in the context free language.

Answer

2^N, where N is the number of non-terminals in the context free language.

Answer

the number of non-terminals in the context free language in chomsky normal form.

Answer

2^N, where N is the number of non-terminals in the context free language in chomsky normal form.

Crowdly