Nope. Its worse. The solutions given in the book for the Fibonacci sequence and the factorial won't be optimized into tail recursion even in scheme unless some additional transformations were carried out on them first. In the factorial sequence, the last call is to the multiply method, not the factorial sequence and in the Fibonacci sequence, the last call is to the addition function.

Sad that most people don't catch that.