Presentation 1997/1/24
Removal of recursive call in procedural language
Taku Kitagawa, Tan Watanabe,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Execution overhead of recursive call is high and it is desirable to improve its object code. However, only a few compilers do it. We propose a technique of object code optimization for recursive calls and implemented it in our complier. In this technique, liner recursion is transformed to tail recursion by using Arsac and Kodratoff's method and then transformed to loop. Arsac and Kodratoff use heuristic method in finding tail recursion function, but we propose an algorithmic method suitable for computer.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) recursive program / recursion removal / complier / optimization
Paper # COMP96-71
Date of Issue

Conference Information
Committee COMP
Conference Date 1997/1/24(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Removal of recursive call in procedural language
Sub Title (in English)
Keyword(1) recursive program
Keyword(2) recursion removal
Keyword(3) complier
Keyword(4) optimization
1st Author's Name Taku Kitagawa
1st Author's Affiliation Department of Computer Science, University of Electro-Communications()
2nd Author's Name Tan Watanabe
2nd Author's Affiliation Department of Computer Science, University of Electro-Communications
Date 1997/1/24
Paper # COMP96-71
Volume (vol) vol.96
Number (no) 488
Page pp.pp.-
#Pages 7
Date of Issue