Consider the following context free grammar. Write an attribute grammar that specifies the calculation rules, i.e. how the value of E or T is calculated. There is no need to perform type checking. We assume all types are matched correctly. Please clearly specify the type of attribute(s) you introduce, i.e. synthesized, inherited, or intrinsic.

E ::= E + T | T

T ::= T * F | F

F ::= NUM

NUM ::= 1 | 2 | 3 | 4 | 5

Using the attributes grammar in above question draw an abstract parse tree to present the expression 2 + 3 * 5. In the tree provide attribute values for all nodes. There is no need to write applied grammar rules in the nodes.