1. (6 points). Consider the following BNF grammar Add appropriate attributes and conditions to the grammar so that only s that satisfy the following condition are allowed: Every occurrence of a is immediately preceded by a b and followed by a c. In other words, each occurrence of a is sandwiched between b and c. Thus, for example, bacbbcbac is legal, but not babbcbc. Use synthesized attributes or inherited attributes, or a combination. Do not change the BNF grammar; do not compute the whole string and pass it up to the root-use only simple arithmetic functions in your attribute evaluation rules and conditions. If the problem cannot be solved under these constraints, explain why not. 1. (6 points). Consider the following BNF grammar Add appropriate attributes and conditions to the grammar so that only s that satisfy the following condition are allowed: Every occurrence of a is immediately preceded by a b and followed by a c. In other words, each occurrence of a is sandwiched between b and c. Thus, for example, bacbbcbac is legal, but not babbcbc. Use synthesized attributes or inherited attributes, or a combination. Do not change the BNF grammar; do not compute the whole string and pass it up to the root-use only simple arithmetic functions in your attribute evaluation rules and conditions. If the problem cannot be solved under these constraints, explain why not