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. (Reference: Textbook example 3.6.)

eg:

please give an original answer