4. (15pt) Using the underlying grammar below for arithmetic expressions: (1) Write an attribute grammar that will compute in one attribute post of the root the postfix form of the expression generated by the tree. The token represented by const is given by const.val. E + T TT TT + T TT, TT + - T TT, TT + E T + F FT FT + * F FT2 FT + / F FT, FT + E F - - F F + (E) F const (2) Using this attributed grammar, draw a decorated parse tree for the following string: - (a + b) * c. 4. (15pt) Using the underlying grammar below for arithmetic expressions: (1) Write an attribute grammar that will compute in one attribute post of the root the postfix form of the expression generated by the tree. The token represented by const is given by const.val. E + T TT TT + T TT, TT + - T TT, TT + E T + F FT FT + * F FT2 FT + / F FT, FT + E F - - F F + (E) F const (2) Using this attributed grammar, draw a decorated parse tree for the following string: - (a + b) * c