Return all rows from the recursion.
返回递归中的所有行。
Statically forbid polymorphic recursion.
静态禁止多态递归。
A similar problem is too much recursion.
相似的问题还包括过多的递归。
That language didn't even support recursion.
这语言甚至都不支持递归。
This is the stop condition for the recursion.
这是递归的停止条件。
The tool even supports recursion to a given depth.
这个工具还支持递归到给定深度。
We mention recursion briefly in the previous chapter.
在前面的章节中，我们简要涉及了一下递归。
You'll see Lambda expressions, recursion, and macros.
您将学到 Lambda表达式、递归和宏。
The second part represents the iteration or recursion.
第二部分代表迭代或递归。
Another example of recursion at work is the following.
递归的另一个实例如下。
Tail recursion is a common technique in XSLT style sheets.
尾递归是xslt样式表中的常用技术。
There is also the concept of recursion which is important.
另一个重要的概念是递归。
You have added recursion to your Cusp development Arsenal.
已经将递归添加到了Cusp开发工具库中。
This example uses what in Scheme is called tail recursion.
这个例子使用Scheme中所谓的尾递归（tail recursion）。
The combination of first and rest works well with recursion.
使用first和rest 组合实现递归效果很好。
If you still don't know what recursion is, read this sentence.
如果你还不明白什么是递归，就读这个句子。
Logging the log methods would result in an infinite recursion.
记录log方法将导致无限递归。
In short, NOCYCLE prevents the recursion from entering a cycle.
简言之，NOCYCLE防止递归进入循环。
We will get to the speed and space issues of recursion later on.
稍后我们会讨论递归的速度和空间问题。
Later you'll see how recursion takes advantage of these selectors.
稍后，您将了解递归如何利用这些选择函数。
Using recursion tremendously simplifies the verification of programs.
使用递归可以极度简化程序的核查。
Here's an example involving polymorphic recursion across two classes.
下面的示例涉及两个类之间的多态递归。
It also demonstrates how the recursion of the function execution works.
这也解释了函数执行的递归是如何实现的。
You'll use tail recursion and the XSLT translate() function to do this.
您可以使用尾递归（tail recursion）和XSLTtranslate()函数来完成这一步。
The question is, can we implement the Visitor pattern without recursion?
问题在于，我们能否在不使用递归的前提下实现访问者模式？
Lisp offers a performance optimization called tail recursion optimization.
Lisp提供一项称作尾部递归优化的性能优化技术。
You'll notice Haskell programs frequently use recursion to solve a problem.
可以注意到：Haskell程序频繁地用递归来解决问题。
All this pseudo column does is to return 1 if a given row is a leaf in recursion.
这个伪列只是当一个给定行在递归中是叶子的时候返回1。
All this pseudo column does is to return 1 if a given row is a leaf in recursion.
这个伪列只是当一个给定行在递归中是叶子的时候返回1。
应用推荐