摘要
对递归程序的非递归作了较为深入的研究 ,给出了直接递归程序的非递归模板 ,提出了一个既适于直接递归程序 ,也适于间接递归程序的一般转化规则 ,并结合实例讨论了三类特殊情况下的递归转化方法。
This paper deeply studies how to convert recursive routine into nonrecursive version,provides a nonrecursive module of direct recursive routine and develops a general rule of transformation which is applicable to both direct recursive routine and indirect recursive routine.The methords for recursive elimation in three particular situations are also discussed,combining with several instances.
出处
《南阳师范学院学报》
CAS
2004年第6期66-71,共6页
Journal of Nanyang Normal University
关键词
非递归化
直接递归程序
间接递归程序
栈
nonrecursive transformation
direct recursive
routine indirect recursive routine
stack