Incrementally build a tree of skipped tokens
Rather than pushing them to the stack individually
This commit is contained in:
parent
1eafcf0ba7
commit
379a2fd121
9 changed files with 233 additions and 116 deletions
|
|
@ -65,7 +65,7 @@ void ts_stack_push(Stack *, StackVersion, Tree *, bool, TSStateId);
|
|||
StackSliceArray ts_stack_pop_count(Stack *, StackVersion, uint32_t count);
|
||||
|
||||
// Remove an error at the top of the given version of the stack.
|
||||
StackSliceArray ts_stack_pop_error(Stack *, StackVersion);
|
||||
TreeArray ts_stack_pop_error(Stack *, StackVersion);
|
||||
|
||||
// Remove any pending trees from the top of the given version of the stack.
|
||||
StackSliceArray ts_stack_pop_pending(Stack *, StackVersion);
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue