Problem 1. Describe, in English, the language defined by the following grammar: + a | a + b b + c C Problem 2. Write a grammar for the language consisting of strings that have n copies of the letter "a" followed by the same number of copies of the letter "b", where n > 0. For example, the strings "ab", "aaaabbbb", and "aaaaaaaabbbbbbbb" are in the language but "a", "abb", and "aaabb" are not. Problem 3. Consider the following C-like program: int fun(int *i) { *i += 5; return 4; void main() { int x = 3; x = x + fun(&x); What is the value of "x" after the assignment statement in main, assuming a. Operands are evaluated left to right. b. Operands are evaluated right to left. Problem 4. Consider the following program written in a C-like syntax: void fun(int first, int second) { first += first; second += second; void main() { int list [2] = {1, 3}; fun(list[O], list[1]); For each of the following parameter passing methods, what are the values of the list array after execution? a. Passed by value b. Passed by reference Problem 5. Consider the following C program: void fun(void) { int a, b, c; /* definition 1 */ while (...) { int b, c, d; /* definition 2 */ ...