Lines Matching defs:tree
59 // table from the RBBI rules parse tree.
75 // Walk through the tree, replacing any references to $variables with a copy of the
76 // parse tree for the substition expression.
81 RBBIDebugPuts("Parse tree after flattening variable references.");
88 // add a {bof} <cat> <former root of tree> to the
89 // tree. Means that all matches must start out with the
111 // Appears as a cat-node, left child being the original tree,
133 // Replace all references to UnicodeSets with the tree for the equivalent
139 RBBIDebugPuts("Parse tree after flattening Unicode Set references.");
147 // nodes in the parse tree.
385 void RBBITableBuilder::calcChainedFollowPos(RBBINode *tree) {
396 tree->findNodes(&endMarkerNodes, RBBINode::endMark, *fStatus);
399 tree->findNodes(&leafNodes, RBBINode::leafChar, *fStatus);
405 // of the portion of the tree corresponding to user-written rules.
406 // See the tree description in bofFixup().
407 RBBINode *userRuleRoot = tree;
409 userRuleRoot = tree->fLeftChild->fRightChild;
484 // scattered through the tree.
495 // The parse tree looks like this ...
501 // of tree
512 // part labeled "rest of tree"
528 // followPos set of the fake bofNode at the start of the tree.
572 // where toot is the root of the syntax tree for (r)#;
690 // if s contains one of the end marker nodes in its list of tree positions then
1027 // for each node in the tree.