-
Notifications
You must be signed in to change notification settings - Fork 5
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
Node info #3
Comments
The current node type is good enough to me. I really don't mind working with a custom node syntax, be it 2-level array or tree. Because there is no standard amongst the different parsers, effort in making a nice node format would not have a large positive impact. |
Initial problem is related to parser algorythms. Sometime scanner needs to discad data and jump back, or modify last created node. The same for "path stack" to current node. This is more difficult with existing arrays and recursive calls. But this can be improved via better data store:
And we still can keep 2-level lists. Those are more easy to scan (without recursion), but more difficult to modify. Situation with AST is reverse. |
What about use a component array with keys that allow easy component loop up and easly modify: how to generate these keys is an art in itself. In some sense incrementing integers is good enough and other id generation doesn't get you much.
|
Problem:
Fields
Checklist
The text was updated successfully, but these errors were encountered: