You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Currently, Phreak's core code implements a tree of subparser objects, where code is recursively executed until an endpoint is reached (there are no more expected keywords). However, it might be more memory and time efficient to instead build up a tree of binding structs, then iteratively walk through that tree.
Worth considering, but not a priority. Would require major rewriting.
The text was updated successfully, but these errors were encountered:
Currently, Phreak's core code implements a tree of subparser objects, where code is recursively executed until an endpoint is reached (there are no more expected keywords). However, it might be more memory and time efficient to instead build up a tree of binding structs, then iteratively walk through that tree.
Worth considering, but not a priority. Would require major rewriting.
The text was updated successfully, but these errors were encountered: