摘要
递归消除是计算机科学中的常见操作,然而在编程实践中现有的递归消除方法并不易于掌握。提出了一种基于面向对象技术的新方法和相应的若干规则,应用这些规则自顶向下地把函数体分成一系列语句块,每个语句块看成某个对象的操作,函数功能就是这些对象的操作总和。
The reeursion-removal is a common operation in Computer Science,but in programming pratice,all the existed methods for removing recursion are not easily grasped.Based on object-oriented technology,this paper proposes a new method and corresponding rules.Applying these rules function body can be divided into a sequence of statement blocks from top to down,each of which is viewed as an object＇s action,then function is the sum of the object＇s action.
出处
《计算机工程与应用》
CSCD
北大核心
2006年第4期73-75,141,共4页
Computer Engineering and Applications
基金
湖南省教育厅项目(编号:04C199)
关键词
递归
递归消除
面向对象
recursion, recursion-removal, object-oriented
