Write a grammar for the language of Boolean expressions, with two possible operands: true false , and three possible operators: and or not .

Write a grammar for the language of Boolean expressions, with two possible operands: true false, and three possible operators: and or not. First write an ambiguous grammar using only one nonterminal. Then add nonterminals so that or has lowest precedence, then and, then not. Finally, change the grammar to reflect the fact that both and and or are left associative. Use your grammar to create a parse tree for the following expression: true or false and false and not true