| 1. | After every instruction fetch, if we increment this address, it will accurately point to the next instruction in the sequence .
在每次取指令后，如果我们使地址增量，那么就会准确地指向指令代码序列中的下一条指令。 |
| 2. | Instructions to produce a fast but longer sequence of code
指令，以产生执行速度快但较长的代码序列： |
| 3. | A stack probe is a sequence of code the compiler inserts into every function call
堆栈探测是编译器插入到每个函数调用中的代码序列。 |
| 4. | The compiler implements the multiply expression in the return statement explicitly as a multiply to produce a short but slower sequence of code
)编译differ . c时，编译器将返回语句中的乘法表达式显式实现为乘法，以产生短小但较慢的代码序列： |
| 5. | The argument - building code sequence for an instance or virtual method must push that instance reference which must not be a null reference before any of the user - visible arguments
实例或虚方法的参数生成代码序列必须在任何用户可见参数前推送该实例引用（该实例引用不得是空引用） 。 |
| 6. | Because standard code serializers do not look at nested containers , these components are only serialized if a path to them can be obtained by walking the components in the primary container
由于标准代码序列化程序不查找嵌套容器，因此，只有在主容器中进行组件审核能够获得这些组件路径的情况下，才会序列化这些组件。 |
| 7. | Handling code generation with a tree - based approach gives the advantage that it allows all the code to be generated sequentially - there s never a need to go back and insert bytecode into a sequence of instructions generated previously
采用基于树的方法处理代码生成具有如下优点：所有的代码按顺序生成不需要回退到前面生成的代码序列插入新生成的字节码。 |
