On Mon, Dec 27, 2021 at 10:43 AM [email protected] <[email protected]> wrote:
> Tree walk without stack or recursion > <https://stackoverflow.com/questions/3214312/traverse-tree-without-recursion-and-stack-in-c> Thanks for the link. I wasn't clear enough about the problem I am trying to solve. I want to duplicate the TokenOrderGenerator class in leoAst.py without recursion or generators. The graph theory literature may be vast, but it almost certainly does not include this exact problem. Anyway, I'm having fun with the puzzle, even if it may have been solved before :-) Edward -- You received this message because you are subscribed to the Google Groups "leo-editor" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/leo-editor/CAMF8tS2L9CrDgpH5vzw_v5ky3GO1QjmKHr0O6YrFUTpdgd3ASA%40mail.gmail.com.
