last-in first-out stack

基本解释

As you probably know, a stack is a data structure that is used to add and remove items in a last-in, first-out manner.
正如你可能知道的那样，堆栈是一种数据结构，被用来以后入先出的模式增加或移除条目。
The stack is a last-in-first-out (LIFO) queue that holds subroutine return addresses, items of data, pointers, and so on.
堆栈是一个后进先出（LIFO）队列，它保存了子例程的返回地址、数据项、指针等等。
The virtual stack -- like a real stack -- is a last in-first out (LIFO) data structure that temporarily stores function arguments and function results.
虚拟堆栈与实际堆栈类似，是一种后进先出（LIFO）的数据结构，可以用来临时存储函数参数和函数结果。