From there, each successive recursive call USES the parameters as new values.
从那里开始，每一次后续的递归调用都使用那些参数作为新的值。
Each additional recursive call takes up memory, and eventually will slow down the browser.
每个额外的递归调用都会占用更多的内存，从而减慢浏览器的运行。
After the recursive call completes, we add the value of the current node to the results of the recursive call.
递归调用之后，我们将当前节点的值加到递归调用的结果上。
When we converted our loop to a recursive function, the recursive call was the last thing that the function did.
当我们将循环转化为递归函数时，递归调用是函数所做的最后一件事情。
If you evaluate print_report_i, you will see that there is nothing further that happens in the function after the recursive call.
如果仔细观察print _ report_i，您会发现在函数中递归调用之后没有再进一步发生任何事情。
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.
该表达式是对lazy - seq - fibo的一个递归调用，不过这次，它调用的是有两个参数的情况，并向其传递0和1。
The result of the present computation depended on the partial results before it, so in each successive recursive call, we pass those results forward.
当前计算的结果依赖于之前的部分结果，所以，在每次后续递归调用中，我们向前传递那些结果。
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.
它是由递归下行复合数据结构引起的，这种下行方式有时在一次递归调用中要下行多级。
If your logic does not require the operator procedure to call itself, then remove any recursive calls or replace them with statements that do not call their own procedure.
如果逻辑上不要求运算符过程调用自身，请移除任何递归调用，或将其替换为不调用自身过程的语句。
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.
要执行递归调用，必须在以递归方式调用的程序的PROGRAM - ID段落中编写RECURsive子句(或属性)，或指定THREAD编译器选项。
Designing and implementing a teaching-oriented C-like compiler, which supports the definition of local and global variables, function parameters, as well as recursive call of functions.
设计并实现了一个面向教学的类c编译器，支持全局或局部变量的定义、函数参数传递和函数递归调用。
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).
如果Group名称与另一个Ruleset相匹配，那么递归调用就尝试进一步分解字符串(对于上一篇专栏文章示例中的an：fields元素，也是这么做的)。
You need to do this because your parameter will get clobbered on the recursive function call, and you will need access to it afterwards.
之所以需要这么做是因为参数会在递归函数调用上被截断，而以后却还需要访问它。
The difference is that with recursive functions, you rarely have to modify any variable — you just pass the new values as parameters to the next function call.
区别在于，使用递归函数极少被迫修改任何一个变量——只需要将新值作为参数传递给下一次函数调用。
Call mining on different subsets of the data (for example, to create recursive drill-down reports).
在数据的不同子集上调用数据挖掘(例如，创建递归下钻报告)。
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.
获得新版本后，我们将调用这个find()方法，替代前面介绍的递归函数，您也应该如此。
Remember that when a program makes a function call (especially for recursive ones), it has to store its return address and local variables on the stack.
记住当程序进行函数调用（特别是针对递归函数）时，它必须在堆栈上存储返回地址和本地变量。
Functions can also be nested within each other, and you can create recursive functions that call themselves.
函数同样可以相互嵌套调用自身，例如，递归函数。
Functions can also be nested within each other, and you can create recursive functions that call themselves.
函数同样可以相互嵌套调用自身，例如，递归函数。
应用推荐