Lines Matching refs:parse
10 // scanning the rules and assembling a parse tree. This is the first phase
177 // Normally has one entry, which is the entire parse tree for the rules.
189 // Called by the parse state machine.
190 // Actions build the parse tree and Unicode Sets,
191 // and maintain the parse stack for nested expressions.
277 // Push a new start-of-expression node; needed to keep parse of the
290 // Terminate expression, leaves expression parse tree rooted in TOS node.
303 // Expression parse tree becomes l. child of the $variable reference node.
310 // This is a round-about way to get the parse position set
326 if (U_FAILURE(*fRB->fStatus)) { // parse tree rooted in TOS node.
398 // Just move its parse tree from the stack to *destRules.
636 // Error Report a rule parse error.
657 // fixOpStack The parse stack holds partially assembled chunks of the parse tree.
659 // or as large as the parse tree
986 void RBBIRuleScanner::parse() {
1090 RBBIDebugPuts("RBBIRuleScanner::parse() - state stack overflow.");
1109 RBBIDebugPuts("RBBIRuleScanner::parse() - state stack underflow.");
1129 // We now have a parse tree for the rule expressions
1226 RBBIDebugPrintf("UnicodeSet parse position.ErrorIndex = %d\n", pos.getIndex());
1247 // Advance the RBBI parse position over the UnicodeSet pattern.