Post #2070923
2026-05-05 18:21 UTC
This just has to be incorporated into hiha for use to make symbol tables.
https://pastebin.com/AzyUwY70
Replies (1)
-
@chemoelectric@masto.ai 2026-05-05 18:24
I would rather have iterators/cursors for the tree walks, but those are much more work to implement. They also are not as fast. But they are far more flexible. Given that the tree height is known, it is not THAT bad. One can allocate an array rather than use linked lists to store backtracking data. Really the way I like to implement such a thing is either with call/cc or by continuation-passing style. The former is definitely not possible. Even using libguile, its call/cc is broken!