Complete inlining of recursive calls

Peiyi Tang · 2006

A compiler optimizing transformation called complete inlining to inline and eliminate recursive calls is presented. The complete inlining can eliminate the recursive calls that cannot be eliminated by tail-recursion elimination. It can inline the recursive calls completely which the existing procedure inlining can only inline partially.

Read the paper · More papers on PaperTik