Given below is the grammer:
S → A | R | IF B S ENDIF; | SS | ε
A → I := E;
R → RETURN I;
I → char(char)∗
E → digit | E + E | I
B → (E == E)
I wanna know how to give the parse tree for
x := y+z;
IF (x == z+1) y:=5; RETURN y; ENDIF;
this is just a teeny part of one one my assignments and i...