首先创建递归的concat函数。
递归的报告打印程序的证明。
工具不支持递归的XML模式的注释。
The tool does not support annotation of recursive XML schemas.
递归的系统分解和从抽象到具体的转换。
Recursive system decomposition and transformation from the abstract to the concrete.
稍后我们会讨论递归的速度和空间问题。
We will get to the speed and space issues of recursion later on.
您可以看到，文件夹和文档导航模式是递归的。
You can see that the pattern of navigating folders and documents is recursive.
提升是递归的。
这样做有一个优点：它足以发现将引入递归的任何子行。
There is one advantage, though: It is sufficient to find any child row that introduces recursion.
如果对象的目标属性为递归的(组)，则忽略该对象(无递归)。
If the object's target attribute is recursive (group), it will be ignored (no 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.
某个流程在其本身的分解层次结构中出现，这将导致一个递归的细化过程。
A process that occurs within its own decomposition hierarchy leads to a recursive refinement.
调用自身的函数就是递归的；执行这种函数的过程就叫递归运算。
A function that calls itself is recursive; the process of executing it is called recursion.
这只是个小例子，但在日常生活和日常用语中，递归的应用极为广泛。
And this is obviously a toy example but you could see the use of recursion in everyday life and in everyday use of language.
现在假设所处理的寄存器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.
XML文档非常适合使用递归算法，因为它们的层次结构在本质上是可递归的。
A recursive algorithm works well with XML documents because their hierarchical structure is inherently recursive. The algorithm is as follows.
如果不为零，则可能已经超出计算范围，例如超出regex可以递归的深度。
If not zero, you may have exceeded a computing limit, such as how deeply a regex can recurse.
过程调用可以是嵌套的或递归的，但是保存点的范围被限制为定义它的存储过程的执行。
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.
DB 2V9.5解除了这个限制，现在即使模式是递归的，用户也可以对数据进行注释和分解。
DB2 V9.5 lifts this restriction, and now users can annotate and decompose the data even when the schema is recursive.
在讨论伪列和更复杂的例子之前，我想简要地解释一下Oracle中递归的WHERE谓词应该放在哪里。
Before moving on to pseudo columns and more complex examples, I want to briefly explain where the where predicate of an Oracle recursion needs to be placed.
我最喜欢的是第十章，因为我喜欢它的标题：“第十章里面没有需要学习的新知识”，一个介绍递归的绝佳标题！
My favorite is Chapter 10 simply because I liked the title: "There's Nothing New to Learn in Chapter 10." What a great title for introducing recursion!
在大多数教程中可以发现的大多数经典Haskell函数都是递归的数学函数，例如fibonacci函数和阶乘。
The classic Haskell functions that you'll find in most tutorials are recursive math functions, such as Fibonacci functions and factorials.
递归的关系在单个Employee(团队领导)和许多Employee(团队成员)之间进一步建立起一对多的聚合。
A recursive relation establishes a further one-to-many aggregation between a single Employee (the team leader) and many Employees (the team members).
对刚开始接触计算机编程的人而言，这里有递归的一个简单定义：当函数直接或者间接调用自己时，则发生了递归。
For those of you who are new to computer programming, here's a simple definition of recursion: recursion occurs when a function calls itself directly or indirectly.
这种查找是递归的：如果在prototype 内定义的实例不能找到属性或函数，它就会在其原型中查找，依此类推。
This lookup is recursive: if the instance defined in prototype cannot find an attribute or function, it will look in its prototype, and so on.
这个递归函数能很好地工作，不过它有一个主要的缺点 ——递归的每一次迭代都要为the-string传递相同的值。
This recursive function works fine, but it has one main shortcoming -- every iteration of the recursion will be passing the same value for the-string.
这种遍历非常有趣，因为它是迭代的，而不是递归的，这是zippers 遍历与之前的 clojure.walk实现之间的主要差别。
This traversal is interesting because it is iterative, not recursive, which is a key difference between zipper traversal and the prior clojure.walk implementation.
至此我已经介绍了记录递归路径和在运行时检测递归的功能，实际上还可以映射Oracle的CONNECT BY查询语法中的NOCYCLE关键字。
Now that I have introduced the capability to record the path of a recursion and to detect recursion at runtime, it is possible to map the NOCYCLE keyword of Oracle's CONNECT BY query syntax.
这就证明了，你可以通过这三个简单的概念，以及它们的递归应用，对任何复杂的软件架构建模。
It turns out that with these three simple concepts and their recursive application, it is possible for you to model arbitrarily complex software architectures.
应用推荐