Lines Matching refs:parse
9 // scanning the rules and assembling a parse tree. This is the first phase
173 // Normally has one entry, which is the entire parse tree for the rules.
185 // Called by the parse state machine.
186 // Actions build the parse tree and Unicode Sets,
187 // and maintain the parse stack for nested expressions.
261 // Push a new start-of-expression node; needed to keep parse of the
274 // Terminate expression, leaves expression parse tree rooted in TOS node.
287 // Expression parse tree becomes l. child of the $variable reference node.
294 // This is a round-about way to get the parse position set
310 if (U_FAILURE(*fRB->fStatus)) { // parse tree rooted in TOS node.
360 // Just move its parse tree from the stack to *destRules.
572 // Error Report a rule parse error.
593 // fixOpStack The parse stack holds partially assembled chunks of the parse tree.
595 // or as large as the parse tree
913 // Parse
919 void RBBIRuleScanner::parse() {
1022 RBBIDebugPuts("RBBIRuleScanner::parse() - state stack overflow.");
1041 RBBIDebugPuts("RBBIRuleScanner::parse() - state stack underflow.");
1063 // We now have a parse tree for the rule expressions
1070 RBBIDebugPrintf("Completed Forward Rules Parse Tree...\n");
1072 RBBIDebugPrintf("\nCompleted Reverse Rules Parse Tree...\n");
1074 RBBIDebugPrintf("\nCompleted Safe Point Forward Rules Parse Tree...\n");
1076 RBBIDebugPrintf("\nCompleted Safe Point Reverse Rules Parse Tree...\n");
1159 RBBIDebugPrintf("UnicodeSet parse postion.ErrorIndex = %d\n", pos.getIndex());
1179 // Advance the RBBI parse postion over the UnicodeSet pattern.
