** this is all the info that I have, the question is just like this.

Consider the following Decaf attributed translation grammar and the table for comparison codes: Stmt AssignStmt ForstmtWhileStmt TEStmt CompoundStmt ; Assignstmt AssignExprp ForStmt for (OptAssignExpri {LBL 11 Lbiltnewlab () OptBoolExpreci (JMP)12 (LBL}.13 Lb124newlab () OptAssignxpr.) (JMP) 11 (LBL2 Lb13+newlab() Stmt (JMP) 13 (LBL 14 WhileStmt while (LBL}11 ( BoolExpr.12) Lbllnewlab (1) Stmt (JMP) 1 (LBL}.12 IES tmt if (BoolExpr.) Stmt (JMP) 1212 Lb124newlab () (LBL)11 ElsePart (LBL}.12 Else Part else Stmt CompoundStmt (StmtList] StmtList StmtList Stmt le OptAssignExprp AssignExprp 3 OptBoolExpr.1 BoolExprulle BoolExprill Exper compare. Expeq Lb11newlab ) {TST}p.4.. 7-11 Exppp AssignExprp | Rvalue AssignExpre identifier = Expra (MOV}.P Rvalue Term, Elistep Elisto, + Term(ADD}p., Elists, $alloc | - Terme (SUB)p,, Elista, s alloc() a+ Terme Factory Tlistop Tlistp. * Factor (MUL). Tlista, se alloc() |/ Factor: (DIV}p., Tlista, se alloc() ffffff ffff Factorp Factorp Factorp Factory Factory 1 1 1 1 (Exprp) + Factor Factory (Neg.. num identifier P+ alloc() Comparison Code (the value in the grammar) 1 == IVA 6 Question: Construct an attributed derivation tree for the following mathematical expression: E 1 == -78