Lines Matching refs:child
49 static void addChild (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t, pANTLR3_BASE_TREE child);
50 static void dbgAddChild (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t, pANTLR3_BASE_TREE child);
54 static void addChildToken (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t, pANTLR3_COMMON_TOKEN child);
55 static void dbgAddChildToken (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t, pANTLR3_COMMON_TOKEN child);
166 pANTLR3_BASE_TREE child;
181 // This will already have been included as a child of another node
187 // For each child of the current tree, define a node using the
193 // Pick up a pointer for the child
195 child = adaptor->getChild(adaptor, t, i);
199 sprintf(buff, "\tn%p[label=\"", child);
201 text = adaptor->getText(adaptor, child);
229 // And now define the children of this child (if any)
231 defineDotNodes(adaptor, child, dotSpec);
260 // This will already have been included as a child of another node
266 // For each child, define an edge from this parent, then process
267 // and children of this child in the same way
271 pANTLR3_BASE_TREE child;
276 // Next child
278 child = adaptor->getChild(adaptor, t, i);
282 sprintf(buff, "\t\tn%p -> n%p\t\t// ", t, child);
317 text = adaptor->getText(adaptor, child);
346 // Define edges for this child
348 defineDotEdges(adaptor, child, dotSpec);
470 pANTLR3_BASE_TREE child;
481 // Ensure new subtree root has parent/child index set
489 child = adaptor->getChild (adaptor, t, i);
490 newSubTree = adaptor->dupTreeTT (adaptor, child, t);
504 pANTLR3_BASE_TREE child;
513 child = adaptor->getChild(adaptor, tree, i);
514 simulateTreeConstruction(adaptor, child);
515 adaptor->debugger->addChild(adaptor->debugger, tree, child);
538 /** Add a child to the tree t. If child is a flat tree (a list), make all
539 * in list children of t. Warning: if t has no children, but child does
540 * and child isNilNode then it is ok to move children to t via
541 * t.children = child.children; i.e., without copying the array. This
548 addChild (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t, pANTLR3_BASE_TREE child)
550 if (t != NULL && child != NULL)
552 t->addChild(t, child);
556 dbgAddChild (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t, pANTLR3_BASE_TREE child)
558 if (t != NULL && child != NULL)
560 t->addChild(t, child);
561 adaptor->debugger->addChild(adaptor->debugger, t, child);
564 /** Use the adaptor implementation to add a child node with the supplied token
567 addChildToken (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t, pANTLR3_COMMON_TOKEN child)
569 if (t != NULL && child != NULL)
571 adaptor->addChild(adaptor, t, adaptor->create(adaptor, child));
575 dbgAddChildToken (pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE t, pANTLR3_COMMON_TOKEN child)
579 if (t != NULL && child != NULL)
581 tc = adaptor->create(adaptor, child);
588 * If not a nil root, make oldRoot a child of newRoot.
595 * If newRoot is a nil-rooted single child tree, use the single
596 * child as the new root node.
611 * simple node or nil root with a single child node--it must be a root
653 /* The new root is the first child, keep track of the original newRoot
725 // The root we were given was a nil node, wiht one child, which means it has
