A. Write a grammar for the language of Boolean expressions, withtwo possible operands: true false, and three possible operators:and or not. First write an ambiguous grammar using only onenonterminal. Then add nonterminals so that or has lowestprecedence, then and, then not. Finally, change the grammar toreflect the fact that both and and or are left associative. Useyour grammar to create a parse tree for the following expression:true or false and false and not true
B. Write an ambiguous grammar that generates all strings of a’sand b’s containing an even number of b’s. Using your grammar, givea right-most derivation of the string
b a a b a a a b b and show the parse tree.