-;;; If our final stack isn't empty, then we walk all the predecessor blocks
-;;; that don't have all the continuations that we have on our Start-Stack on
-;;; their End-Stack. This is our termination condition for the graph walk. We
-;;; put the test around the recursive call so that the initial call to this
-;;; function will do something even though there isn't initially anything on
-;;; the stack.
+;;; If our final stack isn't empty, then we walk all the predecessor
+;;; blocks that don't have all the continuations that we have on our
+;;; START-STACK on their END-STACK. This is our termination condition
+;;; for the graph walk. We put the test around the recursive call so
+;;; that the initial call to this function will do something even
+;;; though there isn't initially anything on the stack.