could be done in java or python. write a driver that calls the classes. everytime a constructor is called output a statement like " instance of CompoundStm completed"

a:=5+3;b:=(print(a,a1),10a);print(b) can be represented in the above abstract syntax tree and specified as follows: This assignment is to implement a tree structure for the intermediate representation of the language. Write the program supporting the inclusion of a tree construction statement like the one given above. Output a trace of class instantiations. Encode the following program and its tree construction. a:=3; b:=a4; c:= (print(b), b+a); d:=(e:=5, (print((print (e),6),(f:=e/7,ef)),8)) To support the simultaneous compilation of multiple programs, avoid the use of static variables, unless they are constants (final). Submit an executable and the source files after a colleague has reviewed your work