堆栈用于按照后进先出(LIFO)的顺序存储数据。

Stacks are used for storing data accessed in Last in, First Out (LIFO) order.

本地队列将按后进先出顺序(LIFO)访问，以便保留缓存位置并减少争用。

The local queues are accessed on last-in, first-out order (LIFO) in order to preserve cache locality and reduce contention.

堆栈是一个后进先出(LIFO)队列，它保存了子例程的返回地址、数据项、指针等等。

The stack is a last-in-first-out (LIFO) queue that holds subroutine return addresses, items of data, Pointers, and so on.

这种简单的设计，很有可能是考虑到数据操作都符合后进先出（LIFO ）规则，这意味着访问栈的内容并不需要复杂的数据结构，一个简单的栈顶指针就能搞定一切。

This simple design, possible because the data obeys strict LIFO order, means that no complex data structure is needed to track stack contents - a simple pointer to the top of the stack will do.