3. Give bottom-up parses for the following input strings and grammars: a. b. The input 000111 according to the grammar of above question 1. The input aa*a+ according to the grammar of above question 2. Ch5 Syntax-Directed Translation Based on the following SDD, give annotated parse trees for the following expressions: 4. PRODUCTION SEMANTIC RULES LEn El+T | E.val = E1-val + T.val 1) L.val= .val 2) 4) 6) FE) Fval E.val E.val T.val T * F | T.val-T,.val F.val T.val- F.val 7) F- digit F.val 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 -ETIT T-num.num num Give an SDD to determine the type of each term T and expression E