-
-
Notifications
You must be signed in to change notification settings - Fork 407
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Trees are always simpler to work with than state-machines. #4
Comments
Hi, thanks!
I am not aware of any benefits for state-machines, besides performance. But Lark solves that too: Once you write a complete transformer, you can hand it off to Lark and it will execute it as a state-machine, without building a tree (for example, when parsing json, it uses about half the memory) |
This could go in the docs somewhere if it's not already there. |
Cool, then I think this ticket can be closed. |
Hey, it looks very interesting!
You make this statement 2 times: "Trees are always simpler to work with than state-machines."
Could you back this up with some resource or examples? I'm very curious.
The text was updated successfully, but these errors were encountered: