Tail Recursion and Tail Call Optimization: Difference between revisions
Jump to navigation
Jump to search
| [unchecked revision] | [unchecked revision] |
Content deleted Content added
No edit summary |
|||
| Line 76: | Line 76: | ||
== Epilogues and Prologues == |
== Epilogues and Prologues == |
||
In the above examples, it is assumed that functions don't have a prologue or epilogue which is highly impractical. As such a proper implementation of tail call optimization is a lot trickier than shown here. This is only a rudimentary example. |
In the above examples, it is assumed that functions don't have a prologue or epilogue which is highly impractical. As such a proper implementation of tail call optimization is a lot trickier than shown here. This is only a rudimentary example. |
||
[[Category:Programming]] |
|||