recursive call

if the string has not been entirely consumed by the regular expression, a recursive call processes the remainder.

如果正则表达式没有完全处理完字符串，那么对未处理完的字符串继续应用递归调用。

when we converted our loop to a recursive function, the recursive call was the last thing that the function did.

当我们将循环转化为递归函数时，递归调用是函数所做的最后一件事情。

will crash on its own recursive call.

在自身的递归调用上崩溃。

A recursive computer language, its function can call their own.

一种可递归的计算机语言, 它的函数能够自己调用自己.

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，您会发现在函数中递归调用之后没有再进一步发生任何事情。

after the recursive call completes, we add the value of the current node to the results of the recursive call.

递归调用之后，我们将当前节点的值加到递归调用的结果上。

The function of multiple recursive call may cause a stack overflow.

对函数的多次递归调用可能造成堆栈的溢出.

then we'll return a new map (made up of the newly created map and the map returned from the recursive call) to optionstomap.

然后，将一个新的Map（由新创建的Map和从递归调用返回的Map组成）返回到optionsToMap。

in many respects, you can think of xsl: apply-templates as a recursive call into the stylesheet itself!

在很多方面，可以认为xsl：apply-templates是对样式表自身的递归调用！

a recursive call is when a procedure calls itself.

当过程调用自身时，将发生递归调用。

in this case, it lets you maintain the y coordinate value, passing an updated y value to the next recursive call of the line template.

在本例中，它允许您维护y坐标值，从而将更新后的y值传递给下一次递归调用的line模板。

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。

Recursive call is not to copy the code to function again, the only parameter is new.

递归调用并不是把函数代码重新复制一遍, 仅仅参数是新的.