The grammar below generates Boolean expressions in prefix notation: B O B B | not B | id O and | or Give an attribute grammar over the above CFG to translate Boolean expressions into properly parenthesized Boolean expressions in infix notation without redundant parenthesis. For example, since operators and and or associate to the left, and and has higher precedence than or, expression and and a or b c d can be rewritten in infix notation as a and (b or c) and d.