$(10$ points$)$ Create part of a grammar that can generate boolean expressions in a Java$-$like language. Use $v$ as a

terminal representing a boolean variable or boolean constant $($i$.$e$.$ true or false$).$ Your expressions should support the

operators $!,||,$ and &&$.$ The $!$ operator takes only one argument and can only be applied to a variable or boolean

constant. The grammar should enforce precedence and associativity rules: $!$ has higher precedence than the others,

which have equal precedence and evaluate left to right.