可以通过修改清单4中定义的常量来改变最大递归深度。
You can adjust the recursion depth limit by changing a constant defined in Listing 4.
您可以设定xdebug. max_nesting_level参数来限定递归深度。
Parameter to limit the depth of recursion. For example, xdebug.max_nesting_level.
例如，xdebug.max_nesting_level =50 将把递归深度限定为 50 次嵌套调用，然后将强制终止应用程序。
50 limits recursion to a depth of 50 nested calls before the application is forced to terminate.
这个工具还支持递归到给定深度。
这两步递归地以深度优先的方式重复。
因此，递归查询解析人员、组的成员和子组的成员，而不管它们的嵌套深度如何。
Thus, recursive queries resolve persons, members of a group and members of subgroups, regardless of how deep they are nested.
请注意在SPE上编写深度递归函数有些问题，原因是在SPE上没有任何堆栈溢出保护，而且本地存储也很小。
Just note that writing deeply recursive functions on the SPE is problematic because there is no stack overflow protection on the SPE, and the local store is small to begin with.
在底层，DB2处理递归时采用的方法是逐层递归（广度优先），而Oracle采用的是深度优先的方法。
The underlying problem is that DB2 processes recursion by essentially producing one level of recursion at a time (breadth first), while Oracle uses depth first.
如果不为零，则可能已经超出计算范围，例如超出regex可以递归的深度。
If not zero, you may have exceeded a computing limit, such as how deeply a regex can recurse.
在此基础上，采用深度优先遍历的递归理论和数据库技术，实现了流域节点间关系的计算机存储。
In these foundations, the recursion theory of depth first traversal, database technology and visual programming technology are employed to computer memory, which is expressed to node relations.
卫星“与”核心“在整合式深度报道中往往呈现出显著的”递归结构。
Satellites "and "kernels" in one integrative In-depth Report often demonstrate the remarkable " passing and belonging to structure.
相对应的“深度”拷贝，也会递归地复制嵌套对象。
A "deep" copy, in contrast, would also recursively clone nested objects.
相对应的“深度”拷贝，也会递归地复制嵌套对象。
A "deep" copy, in contrast, would also recursively clone nested objects.
应用推荐