![]() ![]() AS there is no way out of this loop you will continue to push the return addresses onto the stack until it overflows which generally results in a 'crash' of you program. It will then call itself yet again and push yet another return address on the stack. The first time you call "show" is OK but it will then call itself again pushing another return address onto the stack. I don't think you have anywhere said exactly which device you are using but some have a special 'call stack' that only contains a few entries and other devices create a stack in memory. ![]() The way you have written the 'show' function in the first post will certainly cause problems at run time as there is no conditional statement to stop the recursive calling of the function. Probably too late now but I want to go back to the comments about the recursive function.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |