CSC 456/656 Written Homework Due in class Monday, March 4, 2002: Problem 6.1(b) on page 191 of the textbook. (Error Corrected Feb 28) Problem 6.12(a) on page 193 of the textbook. Problem 6.17(a) on page 193 of the textbook. In the extremely simplified computer language Babygol (used in compiler courses) all variables consist of just one letter, which must be x, y, or z. The only operations permitted are addition, subtraction, and multiplication, which are encoded using the usual symbols +, -, and *. The only constants permitted are integers, which are written as strings of digits, leading zeros permitted. Parentheses can be used in the usual way. For example, the following are Babygol expressions: x 2+z 0-y 45*(y-x*2*7)+04 (1*(23-2*z)) Write a CFG which generates the language of all Babygol expressions.