Affiliation:
1. Univ. of Reading, Reading, England
Abstract
Various methods of recursion elimination are applied to the schematic recursive procedure:
proc
S
(
x
);
px
then
N
(
x
);
S
(ƒ
x
);
S
(
gx
);
M
(
x
) fi. Procedures with this general form arise in connection with tree traversal and sorting algorithms. Each method of recursion removal involves the use of one or more stacks, and the solutions are compared on the basis of their running time.
Publisher
Association for Computing Machinery (ACM)
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献