Lines Matching refs:nodes
109 /// Is tree considered a nil node used to make lists of child nodes?
159 /// constructing these nodes so we should have this control for
181 /// For identifying trees. How to identify nodes so we can say "add node
187 /// <item>Number the nodes as they are created?</item>
267 /// Each rule that creates AST nodes will call this
331 /// <summary>A stream of tree nodes, accessing nodes from a tree of some kind </summary>
344 /// If you don't want to buffer up nodes, then this method makes no
351 /// i<0 indicates nodes in the past. So LT(-1) is previous node, but
363 /// <summary>Return the text of all nodes from start to stop, inclusive.
364 /// If the stream does not buffer all the nodes then it can still
392 /// Where is this stream pulling nodes from? This is not the name, but
412 /// What adaptor can tell me how to interpret/navigate nodes and trees.
418 /// As we flatten the tree, we use UP, DOWN nodes to represent
419 /// the tree structure. When debugging we need unique nodes
422 /// navigation nodes. Default should be false;
645 /// Tell me how to create a token for use with imaginary token nodes.
656 /// Tell me how to create a token for use with imaginary token nodes.
680 /// To get your parser to build nodes of a different type, override
688 /// A buffered stream of tree nodes. Nodes can be from a tree of ANY kind.
691 /// This node stream sucks all nodes out of the tree specified in the
694 /// pointers to DOWN and UP and EOF nodes.
721 /// Walk tree with depth-first-search and fill nodes buffer.
722 /// Don't do DOWN, UP nodes if its a list (t is isNil).
731 /// Look backwards k nodes
758 /// Where is this stream pulling nodes from? This is not the name, but
771 /// end up as the leaves of this tree and rule nodes are the interior nodes.
779 // Emit a token and all hidden nodes before. EOF node holds all
837 /// Queues up nodes matched on left side of -> in a tree parser. This is
879 /// A parser for a stream of tree nodes. "tree grammars" result in a subclass
918 /// In order to create nodes and navigate, this class needs a TreeAdaptor.
921 /// iterating over the various nodes with a particular type.
944 /// Walk the entire tree and make a node name to nodes mapping.
955 /// <summary>Return a List of tree nodes with token type ttype</summary>
989 /// on the various nodes and '.' (dot) as the node/subtree wildcard,
991 /// the labels pointing at the appropriate nodes. Return false if
1062 /// A stream of tree nodes, accessing nodes from a tree of ANY kind.
1065 /// No new nodes should be created in tree during the walk. A small buffer
1346 // all these navigation nodes are shared and hence they
1354 /// includes pointers to DOWN, UP, and EOF nodes.
1363 /// <summary>Pull nodes from which tree? </summary>
1373 /// Reuse same DOWN, UP navigation nodes unless this is true
1378 /// The index into the nodes list of the current node (next node
1379 /// to consume). If -1, nodes array not filled yet.
1433 /// Walk tree with depth-first-search and fill nodes buffer.
1434 /// Don't do DOWN, UP nodes if its a list (t is isNil).
1439 /// As we flatten the tree, we use UP, DOWN nodes to represent
1440 /// the tree structure. When debugging we need unique nodes
1544 /// Ensure stream emits trees; tokens must be converted to AST nodes.
1545 /// AST nodes can be passed through unmolested.
1939 /// <summary>Reuse same DOWN, UP navigation nodes unless this is true</summary>
1942 /// <summary>Pull nodes from which tree? </summary>
1952 /// As we walk down the nodes, we must track parent nodes so we know
2016 // navigation nodes
2058 /// Also, adds these nodes and DOWN/UP imaginary nodes into the lokoahead
2065 /// DOWN/UP nodes; those are only returned by the LT() method.
2068 /// solution, but it's the only way to provide nodes on-demand instead
2069 /// of walking once completely through and buffering up the nodes. :(
2080 /// and copy all the nodes over plus reset head, tail. After
2097 /// As we flatten the tree, we use UP, DOWN nodes to represent
2098 /// the tree structure. When debugging we need unique nodes
2306 // if same number of nodes, do direct replace
2322 // fewer new nodes than there were
2337 // more new nodes than were there before
3082 FP := 0; // buffer of nodes intialized now
3316 // else use token range from start/stop nodes
3326 // walk nodes looking for start
3682 // if necessary, dup (at most a single node since this is for making root nodes).
4592 MoveNext; // get at least k-depth lookahead nodes
