Write an attribute grammar that has its BNF basis as the following grammar: -> = -> + | -> A | B | C

Note that the tokens in the grammar are highlighted in bold. You need to extend the above grammar into an attribute grammar to address the below language rules: a. Data types cannot be mixed in expressions, and b. Assignment statements need to have the same types on both sides of the assignment operator.

Note that you need write the complete attribute grammar including both syntax and semantics rules for the language.(example 3.6)

EXAMPLE 3.6 An Attribute Grammar for Simple Assignment Statements 1. Syntax rule: - Semantic rule: 3] Semantic rule: .actual type if ([2].actual _type int) and 3.actual type-int) then int else real end if Predicate: actual type.expected type Syntax rule: Semantic rule: . actual_type Predicate: 4. Syntax rule: varA B I c Semantic rule: .actual type look-up(