Jeremy Hylton <jeremy at alum.mit.edu>: > I think it would only need to check that any path through the loop has a no > net effect on stack depth -- before branching back to the beginning of the > loop, it must pop everything it pushed. If the branching is sufficiently spaghettoid, it might have trouble identifying any coherent loops or paths. Greg Ewing, Computer Science Dept, +--------------------------------------+ University of Canterbury, | A citizen of NewZealandCorp, a | Christchurch, New Zealand | wholly-owned subsidiary of USA Inc. | greg at cosc.canterbury.ac.nz +--------------------------------------+
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4