您要查找的是不是：
- Will crash on its own recursive call. 在自身的递归调用上崩溃。
- A recursive call is when a procedure calls itself. 当过程调用自身时,将发生递归调用。
- Two kinds of methods are adopted in the paper to discuss the Hanoi tower based recursion calling of C language. 本文采用两种方法探讨了C语言中递归调用中的Hanoi(汉诺)塔问题。
- This has the same effect as a recursive call and may thus lead to the overwriting of parameters or data. 试翻译如下： 该警告和递归调用一样，会导致参数或数据被重写。
- Pragma inline_recursion is useful for specifying whether or not you want the application to be able to inline a recursive call. pragma inline_recursion有助于指定是否希望应用程序能够内联递归调用。
- There is no stack operation error, simply a recursive call that never ends , at least before it runs out of system source. 该现象表明是由于堆栈操作错误导致返回失败引起死循环调用撑爆了堆栈。
- You would then pick a suitable XML API and have each bean emit elements to represent its state and recursively call down the object graph to its members. 然后就可以选择合适的XML API,让每个bean提供表示自己状态的元素,并递归地对自己的成员调用对象图。
- Our first meeting often recurs to me/my mind. 我们初次见面的情形时常浮现於我的脑海。
- MSTCA can guarantee a unique clustering result without considering the order of subclasses, and the recursive call to it can generate a hierarchical structure with clusters in some different levels. MSTCA产生的聚类结果在不考虑子类次序时是唯一的，对它的递归调用还可在若干不同粒度层次上形成数据集的聚类结构。
- The memory of the days we spent together often recurs to me. 我们当时在一起的情景现在还时常浮上我的心头。
- My brother is always at my father's beck and call. 我兄弟总是对我父亲唯命是从。
- Donna call on her friend kita for a chat. 多娜到她的朋友莉塔家闲谈。
- Forgive me so early to call up you please. 请原谅我这么早给你打电话。
- That's all there is to make a speed dial call. 在那里全部要进行快速拨号呼叫。
- All you have to do is call on the house phone. 我只要做的就是拨个室内电话。
- You should also ensure that you cannot run out of memory due to having too many recursive calls. 您还应该确保不会因为过多的递归调用而耗尽内存。
- I'm going to call on one of my former classmates. 我要去看望我的一位老同学。
- My first meeting with her often recurs to my memory. 我与她的第一次会面的情景经常出现在我的记忆中。
- Hence nested or recursive calls to the same function, each successively obtain their own separate frames. 因此当我们做递归调用同一个函数时，每次都会相继调用它们自己单独的栈帧。
- Pyramid is an ancient problem, and compiled with the C program with recursive calls to solve this problem well. 叠罗汉是古老的问题，而用C编的程序用递归调用很好的解决了这个问题。
