Hi I'm completely stuck on an exercise which is to prove this language is not context free using pumping lemma for context free languages:
L = {xyz | x + y = z} , where the alphabet is from 0-9, so for example
10^m20^m30^m ∈ L for all m ≥ 0 (since 1+2 =3, 10 + 20 = 30, etc)
How would you solve this using the pumping lemma for context free languages? Thank you for your time :)