Chapter 4 Data Structure 4.2 Stacks A stack is an ideal structure for such a system. As each procedure is called, a pointer to the pertinent return Location is pushed on a stack, and as each procedure is completed, the top entry from the stack is extracted with the assurance of obtaining a pointer to the proper return location. This example is representative of stack applications in general in that it demonstrates the relationship between stacks and the process of backtracking. Indeed, the concept of a stack is inherent in any process that entails backing out of a system in the opposite order from which it was entered 堆栈是满足这种需要的理想结构。当一个过程被调用时,将指向返回地址 的指针进栈。然后,当一个过程完成时,将栈顶条目出栈,程序就可以准 确得到返回地址。这是应用栈的一个典型例子,它表明了栈和回溯过程的 关系。在任何可以从进入端反向返回系统的过程中,堆栈的概念是与生俱 来的。 《什第机专出美语 4-14Chapter 4 Data Structure 计算机专业英语 4-14 A stack is an ideal structure for such a system. As each procedure is called, a pointer to the pertinent return Location is pushed on a stack, and as each procedure is completed, the top entry from the stack is extracted with the assurance of obtaining a pointer to the proper return location. This example is representative of stack applications in general in that it demonstrates the relationship between stacks and the process of backtracking. Indeed, the concept of a stack is inherent in any process that entails backing out of a system in the opposite order from which it was entered. 堆栈是满足这种需要的理想结构。当一个过程被调用时，将指向返回地址 的指针进栈。然后，当一个过程完成时，将栈顶条目出栈，程序就可以准 确得到返回地址。这是应用栈的一个典型例子，它表明了栈和回溯过程的 关系。在任何可以从进入端反向返回系统的过程中，堆栈的概念是与生俱 来的。 4.2 Stacks