Draft: Quick and dirty node counting in the parser #6083
Closed
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This is a quick and dirty implementation for counting nodes in the parser instead of a separate
oxc_semantic
pass. Currently, this draft PR is not in a production-ready state, introducing printing statements in the AST builder to debug the node incrementing and reconciliation.The debugging statements have this form:
<function>: nodes<++|~~>
<function>
tag represents the function name in the builder.nodes
will be followed by++
.nodes
will be followed by~~
indicating a reconciliation.