A$.$ Rewrite the attribute grammar rules $($Semantic and Predicate Rules$)$ so that:

data types cannot be mixed in expressions, but

assignment statements need not have the same types on both sides of the assignment operator.

B$.$ Show the $$decorations$($semantics$)$ of the tree generated for A $=$ B $+$ C for

int A$,$ int B$,$ double C$,$ using your answer from part A$.$

C Show the $$decorations$($semantics$)$ of the tree generated for A $=$ B $+$ C for

int A$,$ double B$,$ double C$,$ using your answer from part A$.$