just a couple things i could use explanations for...looking over some review sheets for an upcoming test all regular languages can be pumped..so why can't the pumping lemma be used to show that a language is regular? also can someone maybe explain something about a grammar, and how to construct an unambiguous grammar...i can give you specific examples if you need the help to explain thanks