CSC 456/656 Written Homework Due in class Wednesday, March 20, 2002: Problem 7.35(a) on page 232 of your textbook. Problem 7.41(a) on page 232 of your textbook. Use the pumping lemma or the strong pumping lemma, for context-free languages, to prove that the language of all strings over a given alphabet of prime length is not a context-free language. (For 656 students only!) Prove that the programming language C++ is not a context-free language. If you would prefer, use Pascal instead. (Do not pick another programming language without permission from me.) Please do not turn this in unless you have succeeded in doing it right.