A NOTE ON ON THE CONVERSION OF INDIRECT TO DIRECT RECURSION

Authors
YU T KASER O
Citation
T. Yu et O. Kaser, A NOTE ON ON THE CONVERSION OF INDIRECT TO DIRECT RECURSION, ACM transactions on programming languages and systems, 19(6), 1997, pp. 1085-1087
Citations number
1
Categorie Soggetti
Computer Science Software Graphycs Programming","Computer Science Software Graphycs Programming
Journal title
ACM transactions on programming languages and systems → ACNP
ISSN journal
01640925
Volume
19
Issue
6
Year of publication
1997
Pages
1085 - 1087
Database
ISI
SICI code
0164-0925(1997)19:6<1085:ANOOTC>2.0.ZU;2-2
Abstract
In the article, ''On the Conversion of Indirect to Direct Recursion'' (ACM Lett. Program. Lang. 2, 1-4. pp. 151-164), a method was introduce d to convert indirect to direct recursion. It was claimed that for any call graph, there is a mutual-recursion elimination sequence if and o nly if no strongly connected component contains two node-disjoint circ uits. We first give a counterexample and then provide a correction.