1

In a recursive function call it is all about a implicit stack maintenance, so is it possible to replace all the recursive functions with an iterative one using a stack explicitly?

Improve this question
3
  • Are you asking if Lisp can be implemented in low-level language? Commented Aug 4, 2015 at 8:36
  • @ John Coleman no i'm asking for a generalized way. Commented Aug 4, 2015 at 14:23
  • the point of my tangential comment was that the answer is obviously yes because languages like Lisp are routinely implemented in low-level languages which lack recursion. Recursion is a higher-order abstraction which is in practice almost always implemented in terms of lower level abstractions (such as stacks) which are themselves implemented in terms of even lower level abstractions. Commented Aug 4, 2015 at 14:27
Related questions
18
How to convert a recursive function to use a stack?
2
Replacing recursion (with return values) with explicit stack
3
Translating recursion with globals to iteration using stack
Load 7 more related questions Show fewer related questions

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.