What is the pumping lemma for context-free languages?

What is the pumping lemma for context-free languages?

The pumping lemma for context-free languages is a property that states that for any context-free language L, there exists a pumping length p such that any string s in L with length greater than or equal to p can be divided into five parts, uvxyz, satisfying the following conditions:

1. The length of v and y combined is greater than 0.
2. The length of uvxy is less than or equal to p.
3. For any non-negative integer n, the string uv^nxy^nz is also in L.

In simpler terms, the pumping lemma states that for any context-free language, there exists a specific length after which any sufficiently long string in the language can be "pumped" or repeated in a way that still remains in the language.