Give examples of two functions that are not completely tail recursive but are almost tail recursive. Describe a general pattern for turning an almost tail-recursive function into a loop in the same way that a tail-recursive function can be transformed. Can an interpreter recognize almost tail recursion as easily as tail recursion? Explain how.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here