• Code.java represents the generated code. It provides some basic operations to emit instructions and to give out the code in assembly form.
• Generator.java contains the general code generation visitor. This is the file where you should implement a code generation scheme for every language construct.
• Instructions.java describes the target architecture by providing constants for instructions, registers etc.
• Item.java contains some items for supporting delayed code generation.
• Predef.java provides predefined symbols. You should add a call to Predef.enterAll to the analyzeTree method in Analyzer.java. It should look similar to this version:

      public static Scope analyzeTree(Tree tree) {
          Scope initialScope = new Scope(null);
  	Predef.enterAll(initialScope);
          tree.apply(new Analyzer(initialScope));
          return initialScope;
      }
  

2) Integrate conditional items in order to be able to compile loops, conditional jumps and shortcut evaluation of & and |. Note that the implementation of shortcut evaluation is optional.

3) Implement function definitions and function calls. Please note that the compilation scheme for functions presented in the lecture leaves out allocation of block-local variables. You have basically two choices to allocate them:

• you traverse the body of the function and find all local variables before generating code; in this case all variables are allocated at the beginning of the function and deallocated at the end.
• variables of a block are allocated on the stack when entering the block and deallocated when leaving. (beware of implementing the return statement inside of nested blocks correctly)

    void main();