Chapter 4 Data Structure 4.2 Stacks Backtracking A classic application of a stack involves the execution of a program involving procedures as found in our pseudocode. When the execution of a procedure is requested, the machine must transfer its attention to the procedure; yet later, when the procedure is completed. the machine must return to the original location before continuing. This means that, when the initial transfer is made, there must be a mechanism for remembering the location to which execution ultimately returns 回溯 堆栈的一个典型应用发生在一个程序单元调用一个过程的操作中。为了完 成这个调用,机器必须将它的注意力转移到这个过程上;当过程调用结束 后,机器必须返回到程序块进行调用时所处的位置。这就意味着必须有 种用来记录操作结束后返回的位置的机制。 第机专业语 4-12Chapter 4 Data Structure 计算机专业英语 4-12 Backtracking A classic application of a stack involves the execution of a program involving procedures as found in our pseudocode. When the execution of a procedure is requested, the machine must transfer its attention to the procedure; yet later, when the procedure is completed, the machine must return to the original location before continuing. This means that, when the initial transfer is made, there must be a mechanism for remembering the location to which execution ultimately returns. 回溯 堆栈的一个典型应用发生在一个程序单元调用一个过程的操作中。为了完 成这个调用，机器必须将它的注意力转移到这个过程上；当过程调用结束 后，机器必须返回到程序块进行调用时所处的位置。这就意味着必须有一 种用来记录操作结束后返回的位置的机制。 4.2 Stacks