# How to prove that L(G) is not regular by contradicting the pumping lemma?

I am trying to prove that this language is not regular by contradicting the pumping lemma. I have been reading and looking at examples but all the examples I have seen is in the for of a REGEX. I am not sure how to prove this language is not regular with this format.

S → SL | ε
L → A; | E; | C;
E → (EBE) | N | V
A → let V =E
C → while E do S | while E do S else S
B → + | - | * | >
V → x | y | z
N → ND | N0 | D
D → 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9


What could an example of my word be? Thank you

• Hint: Choose a word $((((...))))$ consisting of $n$ opening parentheses as your basis, and then try to pump more parentheses into it. – siracusa Oct 9 at 6:39