Questions

1. Describe how intermediate code instructions with up to three addresses are converted into a sequence of stack machine instructions that contain at most one address.
2. If a particular instruction (say it is instruction 15, at byte offset 120) is targeted by five different labels (for example, L2, L3, L5, L8, and L13), how are the labels processed when generating binary bytecode?
3. In intermediate code, a method call consists of a sequence of PARM instructions followed by a CALL instruction. Does the described bytecode for doing a method call in bytecode match up well with the intermediate code? What is similar and what is different?
4. CALL instructions in object-oriented (OO) languages such as Jzero are always preceded by a reference to the object (self or this) on which the methods are being invoked… or are they? Explain a situation in which the CALL method instruction may have no object reference, and how the code generator described in this chapter...