Be careful with your recursion.
请注意你的递归式。
Note also the use of left recursion.
还要注意向左递归的使用。
A similar problem is too much recursion.
相似的问题还包括过多的递归。
This is the reason why we use recursion.
这就是我们使用递归的原因。
This is the stop condition for the recursion.
这是递归的停止条件。
This method is not sensitive to recursion order.
此方法不区分递归顺序。
Another example of recursion at work is the following.
递归的另一个实例如下。
There is also the concept of recursion which is important.
另一个重要的概念是递归。
You can almost always substitute a loop for recursion.
几乎在任何情况下都可以用循环替代递归。
The fifth time is the magical time when the recursion ends.
第五次递归结束。
Note the use of recursion to avoid the while loop entirely.
注意递归的使用，避免完全while循环。
In math and engineering, recursion, especially, is a big win.
在数学和工程中，递归获得了重大胜利。
If you still don't know what recursion is, read this sentence.
如果你还不明白什么是递归，就读这个句子。
To understand recursion, you have to understand recursion.
要理解递归，首先要理解递归。
The combination of first and rest works well with recursion.
使用first和rest 组合实现递归效果很好。
Of particular note is the use of recursion of a named template to.
特别需要注意的是命名模板使用递归。
Here's a generic loop function making recursion easier to use.
这里是一个通用的循环函数，它使得递归使用起来更加容易。
The recursion number would exceed the capacity of the counter.
递迴的次数会超出计数器的容量。
The question is, can we implement the Visitor pattern without recursion?
问题在于，我们能否在不使用递归的前提下实现访问者模式？
Now, you might ask which method is better—recursion or non-recursion?
这时你会问哪种方法更好一些呢——是递归法还是非递归法？
Is recursion the best way to implement the routine - is it necessary ?
递归是否是实现函数的最好方式，一定需要吗？
You'll use tail recursion and the XSLT translate() function to do this.
您可以使用尾递归（tail recursion）和XSLTtranslate()函数来完成这一步。
Now, you might ask which method is better - recursion or non-recursion?
这时你会问哪种方法更好一些呢——是递归法还是非递归法？
This is known as infinite recursion, and it is generally not a good idea.
这就叫无穷递归，一般这都不是个好事情哈。
Recursion can be a difficult concept to tackle, so lets walk through this one.
递归是十分难于处理的概念，因此让我们一起来查看这个概念。
Left recursion is used so that the rule can be reduced after each message.
为了归约每个消息之后的规则，使用的是向左递归。
The first if statement breaks the recursion if the list is empty, returning zero.
第一个if 语句在列表为空的情况下中断递归，返回零值。
In order to construct a tree, the first thing you should think of is recursion.
为了构造一个树，第一件你该想的事情就是递归。
Too many method calls is often indicative of a very deep or unbounded recursion.
过多的方法调用通常意味着存在非常深的递归或无限递归。
And this too is where the power of recursion comes in in a programming language.
这也是在编程语言中，对递归很有影响的一点。
应用推荐