所以我们递归处理列表其余部分，并再次尝试。
此外，我们必须递归处理MySQL结果，删除非法字符以及逐位构建我们的XML文档。
In addition, we have to work through our MySQL results recursively, removing illegal characters and building our XML document bit by bit.
二叉树平衡的条件是左子树平衡且右子树平衡且左右子树的高度相差最多为1。基于这个思路递归处理。
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
当然，列表的强大力量部分来自于递归处理列表元素的能力，这表示可以从列表提取头部，直到列表为空，然后累积结果。
Of course, part of the power of lists comes in recursive processing of the list elements, which simply means pulling the head from the list until the list is empty, then accumulating the results.
在处理一个节点时，该模板递归地调用自身，以便处理该节点的孩子。
When processing a node, the template recursively calls itself to process the children of the node.
这一递归技术确保所有HTML元素都能得以处理，不管它们是如何相互嵌套的。
This recursive technique ensures that all of the HTML elements are processed, regardless of how they are nested within each other.
通过简单的递归语句，可以轻松地推动处理符号和数据列表。
Through simple recursive statements, you can power process lists of symbols and data easily.
我使用目录技术来处理这种递归引用。
I use a directory approach to handle these recursive references.
您可以开发递归函数来处理项、项中的对象、作者等等。
You can develop recursive functions to handle entries, objects within entries, authors, and so on.
而且，令人感兴趣的是，DB2返回结果时所依照的顺序暴露了递归如何逐层地而不是采用遍历树的方法进行处理。
Further, it is interesting to note that the order in which DB2 has returned the results exposes how the recursion is processed one level at a time, instead of using a tree-walk.
异常处理应用程序块使用不恰当，这是常见的一个隐晦的无穷递归情形。
A bit of an obscure infinite recursion situtaion that unfortunately is pretty common is incorrect usage of the Exception Handling application block.
让我们完善脚本，实现递归访问子目录并处理包含需要上载文件的目录在远程服务器不存在的情况。
Let's finish up our script by descending into subdirectories and handling the situation where the directory containing the file being transferred may not exist on the remote server.
创建NotesGroupManager对象时，可以选择禁用递归功能并将组作为成员的“平面（flat）”集合来处理，以便获得更好的性能。
When you create a NotesGroupManager object, you have the option to disable recursive functionality and deal with the groups as "flat" collections of members for better performance.
对于——delete，它处理bucket删除(非递归的，因此用户必须先删除bucket中的所有密匙)或bucket中的密匙删除。
For — delete, handle either bucket deletion (non-recursive so the user has to remove all the keys in the bucket first) or key deletion within a bucket.
实际上，它会递归地尝试编译目标；如果所依赖的内容碰巧又依赖其他内容，那么在这条规则继续之前，必须对所依赖的内容进行处理。
In fact, it will recursively attempt to build them; if the dependencies in turn have dependencies, those will be dealt with before this rule continues.
这个示例相当复杂，结合使用了多种处理递归数据的技术。
This example is quite complex and combines a number of techniques for dealing with recursive data.
鉴于处理器、连接器和内存的组合就是一台机器，因此这个模型能够用于描述递归流程。
Since the combination of processor, connection and memory is a machine, the model can be used to describe recursive processes.
无论是太多的循环、递归还是其他的什么，你现在应该知道如果处理类似的情况。
Whether there be too many loops, too much recursion, or just plain too much going on, you now know how to deal with each.
在处理一些复杂问题的时候，最常用到的两个方法是递归和叠代，它们直接利用计算机的高速计算能力解决问题。
Recursion and iteration are two very commonly used, powerful methods of solving complex problems, directly harnessing the power of the computer to calculate things very quickly.
为此，它将选取列表的第一个元素 — 列表头部 —来对该元素执行处理，然后再递归式地将列表的其余部分传递给自身。
To do so, it will pick off the first element of the list — the head — to do the processing on that element, and recursively pass the rest of the list to itself again.
大多数问题与递归结构以及如何处理动态输入和输出数据有关。
The majority of the issues relate to recursive structures and how to cope with dynamic input and output data.
的确，在本报告中提到的很多技术，从商业分析到进行递归分析与可视化的软件，都是为了把数据处理得让人更容易理解。
Indeed, many of the technologies described in this report, from business analytics to recursive machine-learning to visualisation software, exist to make data more digestible for humans.
例如，可以为同一函数定义多种处理方式，还可以对递归调用应用模式匹配，这样做可以简化某些函数。
For example, the ability to define multiple approaches to the same functions and employ pattern matching for recursive calls simplifies some functions.
此代码会利用递归概念多次调用主函数，直至处理完最后一个目录为止。
This code USES the concept of recursion to call the main function multiple times until the last directory has been traversed.
现在假设所处理的寄存器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消息可以用来强制进行递归实体扩展(或其他重复性处理)以耗尽服务器资源。
Recursive elements — XML messages that can be used to force recursive entity expansion (or other repeated processing) to exhaust server resources.
当编写xslt样式表时，记住XSLT处理器遵循递归算法是很有帮助的。
When writing XSLT style sheets, it helps to remember that the XSLT processor follows a recursive algorithm.
使用递归和诸如car和cdr之类的lisp函数处理这些列表是使用Lisp处理列表的强大之处。
The processing of these lists using recursion and Lisp functions like car and CDR is the power of list processing using Lisp.
递归是十分难于处理的概念，因此让我们一起来查看这个概念。
Recursion can be a difficult concept to tackle, so lets walk through this one.
应用推荐