Compiler Theory Ch4 Syntax Analysis-Part 2 For the grammar S->0S1101, indicate the handle in each of the following right-sentential forms: 1. a. 000111 b. 00S11 2. For the grammar Sss 1sS | a, indicate the handle in each of the following right-sentential forms: b. SS+a*a+ 3. Give bottom-up parses for the following input strings and grammars: a. The input 000111 according to the grammar of above question 1. b. The input aaa+ according to the grammar of above question 2. Ch5 Syntax-Directed Translation 4. Based on the following SDD, give annotated parse trees for the following expressions: PRODUCTION SEMANTIC RULES LEn 1) 3) 4) ET TTj * F | T.oal = T.val F.t al T.val F.eal 6) F (E) al E.va 7) F digit IF.eal = digit.lexval a) (3+4) (5+6)n b) 1*2"3*(4+5)n Below is a grammar for expressions involving operator+ and integer or floating-point operands. Floating-point numbers are distinguished by having a decimal point. 5. E-E TIT T - num.num | num Give an SDD to determine the type of each term T and expression E