On Wed, Dec 29, 2021 at 11:13 AM vitalije <[email protected]> wrote:
It is O.K. if you just want to have some fun to play around with these > ideas, but you should know that you can't avoid recursion because the data > is recursive > I agree that you can't avoid stacks. However, stacks on the heap can be *much* larger than python's call stack. > generators actually produce the fastest code for solving recursive > problems in Python. > I agree. Any simulation of coroutines will be significantly slower than generators. In short, it is challenging to solve this puzzle, but the solution isn't going to make it into leoAst.py :-) 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/CAMF8tS3-%2B6xmkqtbEJ%2BLZsTW_d9FAWixs16Bo3gnkOvaNWi_iA%40mail.gmail.com.
