3. (10 pt) (Grammar analysis and semantics] In the following, we redefine the grammar for the bitwise operations: terminals: 0, 1, not, and, or, xor non-terminals: E, T,F,V start symbol: E production rules: E E and T E or TT T + F xor T not T|F F +01 (a) (3 pt) What is the associativity of the operators and, or" and "xor? Explain why. (b) (3 pt) What is the precedence of not","or, and and xor? Explain why. (c) (4 pt) Consider the parse tree given below and answer the following questions. i. (1 pt) What is the value of the string generated by the parse tree? (for the single operations "and", "or, "not" and "xor, use their usual semantics) ii. (3 pt) Explain how the value of the string is generated step-wise