一种多函数间的递归消除方法

Recursion-removal Method Among Multi-function

为解决多函数间互相调用的递归问题,提出一种多函数间的递归消除方法。使用人工栈拆除函数间的互相调用,把递归限制在单个函数内,通过一门多锁法解决单个函数内多处出现递归的问题,研究递归消除深度对程序性能的影响。对占优树的递归消除实验表明,该方法可以解决多函数间的递归问题,且其时间效率是递归消除前的2倍。

In order to solve the recursion problems involving several functions, this paper proposes a systematic recursion-removal method. It cuts the calls among different functions through artificial stack and replaces the recursions inside each function with iteration. It also researches on the relation between recursion-removal depth and the programs＇ time efficiency. Experiments prove that it can successfully remove the recursion of dominating tree and double the time efficiency before recursion-removal.