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.
当我们将循环转化为递归函数时，递归调用是函数所做的最后一件事情。
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.
它是由递归下行复合数据结构引起的，这种下行方式有时在一次递归调用中要下行多级。
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编译器，支持全局或局部变量的定义、函数参数传递和函数递归调用。
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编译器，支持全局或局部变量的定义、函数参数传递和函数递归调用。
应用推荐