如果Group名称与另一个Ruleset相匹配，那么递归调用就尝试进一步分解字符串(对于上一篇专栏文章示例中的an：fields元素，也是这么做的)。
If the Group name matches another Ruleset, a recursive call attempts to further decompose the string (this was true for the an: fields element that appeared in the examples in the last column).
在处理一个节点时，该模板递归地调用自身，以便处理该节点的孩子。
When processing a node, the template recursively calls itself to process the children of the node.
当前计算的结果依赖于之前的部分结果，所以，在每次后续递归调用中，我们向前传递那些结果。
The result of the present computation depended on the partial results before it, so in each successive recursive call, we pass those results forward.
这就是递归函数是如何保证其他活动函数调用中的变量值不受影响的。
This is how recursive functions keep from trashing the values of the variables in other, active function calls.
设想一个场景，您想要递归地访问一个目录树，在该树中的每个文件及目录上停下来，并为每个查找到的条目调用您自己的回调方法。
Imagine a scenario in which you want to traverse a directory tree recursively, stopping at each file and directory under that tree and having your own callback methods invoked for each entry found.
注意，此版本甚至可以在循环自身中使用递归，两次调用循环本身，一次用于对列表左手边的内容进行排序，另一次对列表右手边的内容进行排序。
Notice that this version even makes use of recursiveness in itself, calling itself twice, once to sort the left-hand side of the list, and once again to sort the right-hand side of the list.
要执行递归调用，必须在以递归方式调用的程序的PROGRAM - ID段落中编写RECURsive子句(或属性)，或指定THREAD编译器选项。
To make a recursive call, you must either code the recursive clause (or attribute) in the PROGRAM-ID paragraph of the recursively called program or specify the THREAD compiler option.
对刚开始接触计算机编程的人而言，这里有递归的一个简单定义：当函数直接或者间接调用自己时，则发生了递归。
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.
方法的递归调用在报表显示为调用的总合，显示程序在这方面需要更聪明一些。
Recursive methods is reported as sum of the calls. The viewer should be more clever in this respect.
过程调用可以是嵌套的或递归的，但是保存点的范围被限制为定义它的存储过程的执行。
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.
当我们将循环转化为递归函数时，递归调用是函数所做的最后一件事情。
When we converted our loop to a recursive function, the recursive call was the last thing that the function did.
这可以使一个嵌套很深，被递归调用的函数很快退出。
This can be used to allow a quick exit to deeply nested, recursively called functions.
添加一个可到达的退出分支以停止递归调用。
Add a reachable exit branch to stop the recursive invocation.
目前的实现提供一个服务，可以递归地调用TCS来建立其自己的事务。
The current implementation provides for a service to recursively call the TCS to set up its own transaction.
每个额外的递归调用都会占用更多的内存，从而减慢浏览器的运行。
Each additional recursive call takes up memory, and eventually will slow down the browser.
因此，只有在非常复杂的大量使用循环和递归调用的应用程序中，才需要考虑这种潜在的影响。
Therefore, the potential impact is a factor only in complex applications where iterations and recursive invocations are heavily used.
你也可以从更高层递归地调用这些打包了的交互活动，类似于宏调用(图4)。
You can invoke these packaged interactions recursively from within higher-level interactions analogous to macro invocations (Figure 4).
注意，对于带有测试的其他方法或字段的调用也会触发这些测试，所以要有一些特殊情况的例外，以防止方面代码中的无限递归之类的问题。
Note that nested calls to other methods or fields with tests will trigger those tests, with some special-case exceptions to prevent infinite recursions in aspect code, etc.
递归调用之后，我们将当前节点的值加到递归调用的结果上。
After the recursive call completes, we add the value of the current node to the results of the recursive call.
就象静态检测糟糕的泛型构造函数调用一样，禁止多态递归会与递增式类编译发生冲突。
Just like static detection of bad generic constructor calls, forbidding polymorphic recursion conflicts with incremental class compilation.
从那里开始，每一次后续的递归调用都使用那些参数作为新的值。
From there, each successive recursive call USES the parameters as new values.
它是由递归下行复合数据结构引起的，这种下行方式有时在一次递归调用中要下行多级。
It is caused by recursively descending a composite data structure in such a way that, sometimes, more than one step in the descent is taken in a single recursive call.
用a | a格式写的剩余字母的值如果已没有字母，则该值为空；否则，递归调用该模板。
The value of the remaining letters written in the a | a format. If there are no letters left, the value is empty; otherwise, you call the template recursively.
递归实际上是定义一个调用自身的函数的方式。
Recursion is actually a way of defining functions in which the function is applied inside its own definition.
在访问者实现中可以清楚地看到这一点，您可以看到对eval - concat函数的所有递归调用。
This is obvious in the Visitor implementation where you see all of the recursive calls to the eval-concat function.
在围绕g _ range参数所定义的全部可能范围构建签名时，check_dynamics函数将递归调用自身。
The check_dynamics function recursively calls itself while building signatures encompassing the full range of possibilities defined by the g_range parameter.
为了实现递归，可以通过将proceed(. .)调用封装在匿名类中来隐藏连接点的其他部分。
To do this recursively, you close over the rest of the join point by encapsulating the proceed (..) call in an anonymous class.
该表达式是对lazy - seq - fibo的一个递归调用，不过这次，它调用的是有两个参数的情况，并向其传递0和1。
That expression is a recursive call to lazy-seq-fibo, but this time, it is calling the two argument case, passing in 0 and 1 to it.
获得新版本后，我们将调用这个find()方法，替代前面介绍的递归函数，您也应该如此。
We will be substituting a call to this find() method for our recursive function described previously when we get this new version, and so should you.
在很多方面，可以认为xsl：apply - templates是对样式表自身的递归调用！
In many respects, you can think of XSL: apply-templates as a recursive call into the stylesheet itself!
应用推荐