But as soon as the most recently called function finishes executing, you have to take that tray off the stack in order to get at the previous function's memory, and once he's done executing, you have to take that one off and then what's left well then main.

但是，一旦新的调用函数结束了执行,你必须从堆中把托盘拿掉,用来获得先前函数的内存，一旦他完成执行，你必须把那一块拿下来,然后剩下的是main函数。

哈佛公开课 - 计算机科学课程节选

it's like finding a needle in a hay stack.

这简直是大海捞针。

It's like 课堂 - SpeakingMax英语口语达人

I intentionally used this very common analogy of a stack of trays in a cafeteria.

我故意使用这个普遍的类比，就像,自助餐厅的一堆托盘。

哈佛公开课 - 计算机科学课程节选

You can stack these things in C. So if you want to do if - and then rather -- let me tweak this just so simplify -- if you want to stack these things and do this in one case or that in the other, can you stack them like this?

你们才可以在C语言中使用这些东西，所以如果你想做,-让我把这个弄得更简单点-,如果你想把这些代码堆集在一起，在一个情况中,或在另一个情况中处理，你能够像这样把他们集在一起吗？

哈佛公开课 - 计算机科学课程节选

So, certainly the CS50 Library designed to be dynamic and, in fact, any time you call get string, we are, in fact, ; allocating a chunk of RAM but it's not coming from the stack; it's actually coming from this portion of memory called the heap.

所以，Cs50库是动态设计的，实际上，每次你调用GetSting时，我们分配一块内存，但它不是来自栈;,而是来自于叫做堆的,内存的一部分。

哈佛公开课 - 计算机科学课程节选