Write a BNF (CFG) description of the Boolean expressions of Java, including the three operators &&, ||, and ! and the relational expressions. I would do it in two steps as follows.

a. First, write a CFG for the relational expressions (a < b, a!= b, . ). Restrict yourself to the 4 operators <, >, ==, !=).

E -> .. You need to generate such strings as a, ==, !=, although you should also allow parentheses (a

b. Extend this to Boolean expressions B -> so you can now generate (a1), etc. Remember the order of precedence for &&, ||, !, and that the binary operators are left associative.