Every recursive program follows the same basic sequence of steps.
每一个递归程序都遵循相同的基本步骤。
In this paper, a gerenal designing method for the patterns of recursive program transformation is presented, and some related examples are given.
本文提出递归程序变换模式的一般设计方法，并以具体示例说明之。
It mainly investigates a special method for recursive program design and its applications a-bout the complicated recursion from the Angle of the mathematical formular.
重点从数学公式的角度探讨了复杂递归问题的一类特殊编程方法及其应用。
In this program, all state changes are brought about by re-running the recursive function with completely self-consistent data.
在这个程序中，所有状态改变都是通过使用完全前后一致的数据重新运行递归程序而实现的。
To begin looking at SPU assembly language, I will enter in a simple program for calculating the factorial of a 32-bit number using a recursive algorithm.
在开始介绍SPU汇编语言之前，先来看一个通过递归算法计算32 位数的阶乘的简单程序。
If your program has the RECURSIVE attribute or is compiled with the THREAD compiler option, data that is defined in the LINKAGE SECTION is not accessible on subsequent invocations of the program.
如果程序包含RECUR SIVE属性，或使用THREAD编译器选项编译，那么后续的程序调用将无法访问LINKAGESECTION中定义的数据。
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编译器选项。
Your first Erlang program, a recursive Fibonacci function.
第一个Erlang程序，一个递归的fibonacci函数。
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.
记住当程序进行函数调用（特别是针对递归函数）时，它必须在堆栈上存储返回地址和本地变量。
Proofs for recursive report-printing program.
递归的报告打印程序的证明。
Hnaoi Problem is an old-aged yet interesting one, which is often used as an typical example for recursive algorithm in program design.
汉诺塔问题古老而有趣，是经常用作程序设计递归算法的典型例题。
Examples are given for solving complex problem by transferring variables in recursive function program, and the recursive function programs show excellent capability for solving non-numeral problem.
给出了递归函数调用时利用变量传递解决复杂问题的实例，展示了递归算法在解决非数值运算问题中的独特解题方式和效果。
The calculations both by hand and by FORTRAN Program show that this method is simple in computation, rapidly recursive and more intuitive.
用列表手算和用FORTRAN语言进行程序设计以及所得到的计算结果表明：此法具有计算简便、递推快速和更为直观的特点。
This program for CFP uses a new recursive formula which includes explicitly the boson seniority number.
计算母分系数使用了包含辛弱数的递推公式。
A realizable recursive algorism is proposed to search all the File Spanning Trees for a given program in the distributed system.
设计和实现了一种得到分布式程序的所有文件生成树的递归算法。
It can show recursive folder sizes, as well as real disk space occupied, and hence system administrators can use the program as a disk usage tool. Hyperlinking makes it possible to create playlists.
该软件可以显示递归文件夹的尺寸，以及被占用的真实磁盘空间，因此系统管理员可以使用该软件作为一个磁盘使用情况工具。
It can show recursive folder sizes, as well as real disk space occupied, and hence system administrators can use the program as a disk usage tool. Hyperlinking makes it possible to create playlists.
该软件可以显示递归文件夹的尺寸，以及被占用的真实磁盘空间，因此系统管理员可以使用该软件作为一个磁盘使用情况工具。
应用推荐