the CFL pumping constant

Every pumping lemma comes with a threshold: a length p such that ONCE a string in the language is at least that long, the pumpable structure is guaranteed to appear. For context-free languages this threshold is the pumping constant. Below it, short strings may have no repeatable piece; at or above it, repetition is forced — and that forced repetition is what the lemma exploits.

Where does p come from? Put the language's grammar in Chomsky normal form, where every rule produces either two variables or one terminal, so parse trees are BINARY. If a grammar has b variables (nonterminals), a parse tree whose longest root-to-leaf path has length at most b can yield a string of length at most 2^(b-1). So choose p = 2^b (or any value larger than the longest yield of a path-bounded tree). Then any string of length >= p must have a parse tree with a path longer than b nodes, and on a path with more than b labelled nodes some VARIABLE must repeat — that is the pigeonhole step. The repeated variable is exactly what gives the u v x y z' split, with v x y kept short (bounded by p) because it is the yield of a bounded subtree near the bottom of that path.

In practice you almost never compute p. The lemma says only that SOME p exists; in a proof you treat it as an unknown fixed number, choose a string whose length depends on p (so it is guaranteed long enough), and derive a contradiction without ever pinning p down. The constant is conceptual scaffolding — its existence, traced back to the finite number of variables in a CNF grammar, is the whole point; its exact numeric value rarely matters.