In this paper a new method for removing recursion from algorithms is demonstrated. The method for removing recursion is based on algebraic manipulations of a mathematical model of the control flow. The method is not intended to solve all possible recursion removal problems, but instead can be seen as one tool in a larger tool box of program transformations. Our method can handle certain types o...

There is a longstanding debate in the literature about if, and where, recursion occurs prosodic structure. While there are clear cases of genuine at phrase level above, very few convincing word-level recursion. Most are—by definition—not recursive instead best analyzed as different constituents (e.g., Composite Group, Prosodic Word etc.). We show that two can easily be reanalyzed without if pho...