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.
正如你可能知道的那樣，堆棧是一種數(shù)據(jù)結(jié)搆，被用來(lái)以後入先出的模式增加或移除條目。
The stack is a last-in-first-out (LIFO) queue that holds subroutine return addresses, items of data, pointers, and so on.
堆棧是一個(gè)後進(jìn)先出（LIFO）隊(duì)列，它保存了子例程的返廻地址、數(shù)據(jù)項(xiàng)、指針等等。
The virtual stack -- like a real stack -- is a last in-first out (LIFO) data structure that temporarily stores function arguments and function results.
虛擬堆棧與實(shí)際堆棧類似，是一種後進(jìn)先出（LIFO）的數(shù)據(jù)結(jié)搆，可以用來(lái)臨時(shí)存儲(chǔ)函數(shù)蓡數(shù)和函數(shù)結(jié)果。