这些由列表构建的简单指令构成了递归、高阶函数，甚至是闭包和continuation之类高级抽象的基础。
These simple list-building instructions form the foundation of recursions, higher-order functions, and even higher-order abstractions like closures and continuations.
通过在一个有条件跳转指令之后放置无用数据、并且有规划地确保跳转条件总是跳转成功，能够欺骗递归遍历方法。
The recursive traversal method can be fooled by placing garbage data after a conditional jump instruction and programmatically ensuring that the jump condition always succeeds.
应用推荐