首先创建递归的concat函数。
递归的报告打印程序的证明。
工具不支持递归的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.
以递归的方式进行定义；例如，应用程序包括其他应用程序。
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.
某个流程在其本身的分解层次结构中出现，这将导致一个递归的细化过程。
A process that occurs within its own decomposition hierarchy leads to a recursive refinement.
艾菲尔铁塔看起来惊人的部分原因在于它是一个递归的解决方案，塔上之塔。
The Eiffel tower looks striking partly because it is a recursive solution, a tower on a tower.
现在假设所处理的寄存器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.
递归的C代码是returnnum *factorial(num-1)。
DB 2V9.5解除了这个限制，现在即使模式是递归的，用户也可以对数据进行注释和分解。
DB2 V9.5 lifts this restriction, and now users can annotate and decompose the data even when the schema is recursive.
虽然谷歌的程序从一个很大的数据体中学习，但是它却不像拼写检查和搜索功能那样具有递归的性质。
But although it learns from a big body of data, it lacks the recursive qualities of spell-check and search.
这是一个递归的定义，你怎么知道你的父母，至少其中一个是满足天生的美国公民，这个定义的呢？
How do you know that your parents, at least one of your parents satisfies the definition?
如果查询是递归的(请参见usersofgroup或search查询)，则后续递归的数量将是无限的。
If the query is recursive (see usersOfGroup or search queries), the number of subsequent recursions is not limited.
而在本章，我们要深入地了解它在haskell中如此重要的原因，并能够以递归的思想写出简洁优雅的代码。
In this chapter, we'll take a closer look at recursion, why it's important to Haskell and how we can work out very concise and elegant solutions to problems by thinking recursively.
在讨论伪列和更复杂的例子之前，我想简要地解释一下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.
在大多数教程中可以发现的大多数经典Haskell函数都是递归的数学函数，例如fibonacci函数和阶乘。
The classic Haskell functions that you'll find in most tutorials are recursive math functions, such as Fibonacci functions and factorials.
应用推荐