a) Given the following EBNF declarations (based on Modula-2) [ + [ - ] { + | - OR } + { * | DIV | MOD | AND & } + | | () | NOT + { | } Construct two examples of a , using only terminals in the language. Try to make each example significantly different from the other so as to illustrate the range of expressions which this definition encompasses. Assume simple definitions for (i.e., a..Z, A..Z), (i.e., 0..9), and (i.e., {}) although the actual definitions in Modula-2 are more complex. [6 points] *exercise adopted from Jonathan Mohr