By E. W. Dijkstra. Recursive Programming. The Aim . Old-skool way: static allocation Two problems: More memory is used than is needed No recursion!!!. The Aim. Dijkstra's way: the stack!. Stack Requirements. A static stack pointer variable
PowerPoint Slideshow about ' Recursive Programming' - arnon
An Image/Link below is provided (as is) to download presentation
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
What if symbols A, B, C, etc. are functions requiring further calculations? For example, ifC := P/Q-R+SxTthen C's value would still end up in v2, and the subroutine's temporary data could be stored on the stack the same way without ruining anything before or after the call of the C function.
This means Dijkstra's simple stack system works for lotsa cases.