Consider the following BNF. -> -> -> -> 0 -> 1 -> Extend the above BNF to an attribute grammar to accept only even parity messages, e.g., 101 but not 010. An even parity message is a bit sequence that has an even number of 1's. Draw parse trees for some sentences, say 010 and 101. Decide a rule, or rules, to place predicates. Formulate the predicates by introducing attributes (synthesized vs. inherited)