全部

1·I just used a recursive definition.

我需要进行递归定义。

2·It's actually a wonderful recursive definition.

这就是一个绝妙的递归定义。

3·A recursive definition like this is going to fill up the stack rapidly and lead to a stack overflow.

像这样的递归定义很快就会填满堆栈，从而导致堆栈溢出。

4·The important thing is that this is a recursive definition: at some point the attribute will be mapped to zero or more columns.

重要的是，这是一个递归定义：有时属性将映射成零或者多列。

5·Based on recursive definition idea in existing technique of developing loop invariants, two new strategies for developing loop invariants on complicated recursive problems are presented.

基于现有循环不变式开发技术中的递归定义思想，提出了开发复杂递归问题循环不变式的两种新策略；

6·Notice how like our recursive programs, the definition of a linked list also contains a base case -- in this case, the NULL pointer.

注意，与我们的递归程序非常类似，链表的定义也包括一个基线条件 —— 在这里是 NULL 指针。

7·Bugs of this sort result from defining a recursive datatype in such a way that certain base cases of the definition are not given their own classes.

这种类型的错误是这样产生的：定义的某些基本例没有被给出它们自己的类，然后以这种方法定义了一个递归的数据类型。

8·Cause: The recursive datatype is defined in such a way that certain base cases of the definition are not given their own classes.

原因：定义的某些基本例没有给出自己的类，然后以这种方法定义了递归数据类型。

9·Goto statements and recursive function calls may be supported by the language definition, but it is known that using other methods makes the code easier to understand.

语言规范可能支持goto语句和递归函数调用，但使用其他方法能够让代码更易于理解。

10·Notice how like our recursive programs, the definition of a linked list also contains a base case — in this case, the NULL pointer.

注意，与我们的递归程序非常类似，链表的定义也包括一个基线条件——在这里是NULL指针。