1) a)Assume the BNF as in your notes on the first page of this module. Show a) a left-most derivation and b) the parse tree for this program

begin

x

x = 1 ;

y = 2 ;

end

b) Design BNF for expressions using binary + - * /, unary #, with overriding () . Use the standard writing method (binary operators are infix, unary are prefix, and standard precedence and associativity - all operators are associative) except that

* has higher precedence than /, both are right to left, and + is not associative that is 1+2+3 is not valid. Expressions use identifiers or numbers.

C)Using the above, draw a parse tree for x - y * x* 3/ #x. Then give the result, using the tree, when x = 1 and y = 3, assuming the standard meaning of the operators, # is negation, and / is integer division.