请注意broker是尾递归的。
首先创建递归的concat函数。
递归的报告打印程序的证明。
b当一个方法是递归的时候。
工具不支持递归的XML模式的注释。
The tool does not support annotation of recursive XML schemas.
您可以看到，文件夹和文档导航模式是递归的。
You can see that the pattern of navigating folders and documents is recursive.
递归的系统分解和从抽象到具体的转换。
Recursive system decomposition and transformation from the abstract to the concrete.
稍后我们会讨论递归的速度和空间问题。
We will get to the speed and space issues of recursion later on.
简单的说，递归的fib的分析实际上非常复杂。
Fib Roughly speaking, the analysis of fib is actually quite complex, of a recursive fib.
提升是递归的。
这些服务经常依次被当作流程，这导致递归的分解。
These services, in turn, are often considered to be processes, which leads to the recursive decomposition.
递归的另一个实例如下。
这是递归的停止条件。
注意递归的使用，避免完全while循环。
以递归的方式进行定义；例如，应用程序包括其他应用程序。
Is defined in a recursive manner; for example, if an application includes other applications.
如果对象的目标属性为递归的(组)，则忽略该对象(无递归)。
If the object's target attribute is recursive (group), it will be ignored (no recursion).
这样做有一个优点：它足以发现将引入递归的任何子行。
There is one advantage, though: It is sufficient to find any child row that introduces recursion.
第一个Erlang程序，一个递归的fibonacci函数。
每个装入的类都可能拥有其它所依赖的类，所以装入过程是递归的。
Each class that gets loaded may have other classes that it depends on, so the loading process is recursive.
此外，所有这些都是递归的：一个系统集合完全也可以是一个系统。
On top of that the whole thing is recursive: a set of systems is a system in his own right.
问题在于，我们能否在不使用递归的前提下实现访问者模式？
The question is, can we implement the Visitor pattern without recursion?
某个流程在其本身的分解层次结构中出现，这将导致一个递归的细化过程。
A process that occurs within its own decomposition hierarchy leads to a recursive refinement.
为了支持这一特性Jigsaw有一个本地依赖的概念，该概念是递归的。
To support this Jigsaw has a concept of a local dependency which is recursive.
现在假设所处理的寄存器3中的数值为非零，这就意味着需要进行递归的步骤。
Now assume that the number you are working with in register 3 is not zero. This means that you need to do a recursive step.
这只是个小例子，但在日常生活和日常用语中，递归的应用极为广泛。
And this is obviously a toy example but you could see the use of recursion in everyday life and in everyday use of language.
XML文档非常适合使用递归算法，因为它们的层次结构在本质上是可递归的。
A recursive algorithm works well with XML documents because their hierarchical structure is inherently recursive. The algorithm is as follows.
过程调用可以是嵌套的或递归的，但是保存点的范围被限制为定义它的存储过程的执行。
Procedure calls can be nested or recursive, but the scope of a savepoint is restricted to the execution of the stored procedure in which it is defined.
如果不为零，则可能已经超出计算范围，例如超出regex可以递归的深度。
If not zero, you may have exceeded a computing limit, such as how deeply a regex can recurse.
DB 2V9.5解除了这个限制，现在即使模式是递归的，用户也可以对数据进行注释和分解。
DB2 V9.5 lifts this restriction, and now users can annotate and decompose the data even when the schema is recursive.
应用推荐