Number of children (0 for a non-tree node).
The index-th child's position, or undefined when out of range / not
a tree.
find_token: only Token leaves of this type are hits.
lark scan_values order over non-tree leaves (Token / null / foreign).
Post-order DFS (Visitor_Recursive / Transformer.transform order).
lark iter_subtrees_topdown order (live pre-order; skipChildren
prunes the last-yielded node's subtree).
The rule display name (tree nodes only).
cursorFindData with the name FIRST (matching the toolkit's
findData(tree, name) argument order) and start defaulting to the
root.
Optionalstart: numbercursorFindToken, name first, start defaulting to the root.
Optionalstart: number"tree" | "token" | "null" | "foreign" ("null" for an invalid
position — never throws).
The node's Meta (tree nodes under propagate_positions), else
undefined.
The root node's position.
Materialize the subtree at pos into the plain Node shape parse
returns (undefined for an invalid position).
The Token object at a token position, else undefined.
A finished parse retained behind a handle (
Lark.parseHandle): nodes stay WASM-side, addressed byu32arena positions (rootPos()= the root); cursors enumerate them in the lark traversal orders. Re-declared over the generated class to add the pure-JS query sugar (findData/subtrees/ ...), thin delegations to thecursor*factories withstartdefaulting torootPos().