4 ms·
Yes, I meant any recursive calls via a chain of calls to other functions. I think proving that no recursion exists should be relatively simple, just keep follo
by nine_k 9y ago
Yes, I meant any recursive calls via a chain of calls to other functions.
I think proving that no recursion exists should be relatively simple, just keep following the call graph and keep a set of the nodes (functions) called; you either reach the terminal node(s), or reach an already-visited node again, which means a recursion exists.
- soberhoff 9y agoWhat if functions are first class? Then imagine a function gets passed in as an argument and called. You won't know what function you're calling until runtime.