Lines Matching refs:RBBINode
196 RBBINode *n = NULL; in doParseActions()
203 pushNewNode(RBBINode::opStart); in doParseActions()
210 fixOpStack(RBBINode::precOpCat); in doParseActions()
211 RBBINode *operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()
212 RBBINode *orNode = pushNewNode(RBBINode::opOr); in doParseActions()
227 fixOpStack(RBBINode::precOpCat); in doParseActions()
228 RBBINode *operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()
229 RBBINode *catNode = pushNewNode(RBBINode::opCat); in doParseActions()
244 pushNewNode(RBBINode::opLParen); in doParseActions()
248 fixOpStack(RBBINode::precLParen); in doParseActions()
267 pushNewNode(RBBINode::opStart); in doParseActions()
279 fixOpStack(RBBINode::precStart); in doParseActions()
281 RBBINode *startExprNode = fNodeStack[fNodeStackPtr-2]; in doParseActions()
282 RBBINode *varRefNode = fNodeStack[fNodeStackPtr-1]; in doParseActions()
283 RBBINode *RHSExprNode = fNodeStack[fNodeStackPtr]; in doParseActions()
313 fixOpStack(RBBINode::precStart); // Terminate expression, leaves expression in doParseActions()
325 RBBINode *thisRule = fNodeStack[fNodeStackPtr]; in doParseActions()
326 RBBINode *endNode = pushNewNode(RBBINode::endMark); in doParseActions()
327 RBBINode *catNode = pushNewNode(RBBINode::opCat); in doParseActions()
347 RBBINode **destRules = (fReverseRule? &fRB->fReverseTree : fRB->fDefaultTree); in doParseActions()
355 RBBINode *thisRule = fNodeStack[fNodeStackPtr]; in doParseActions()
356 RBBINode *prevRules = *destRules; in doParseActions()
357 RBBINode *orNode = pushNewNode(RBBINode::opOr); in doParseActions()
399 RBBINode *operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()
400 RBBINode *plusNode = pushNewNode(RBBINode::opPlus); in doParseActions()
411 RBBINode *operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()
412 RBBINode *qNode = pushNewNode(RBBINode::opQuestion); in doParseActions()
423 RBBINode *operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()
424 RBBINode *starNode = pushNewNode(RBBINode::opStar); in doParseActions()
440 n = pushNewNode(RBBINode::setRef); in doParseActions()
454 n = pushNewNode(RBBINode::setRef); in doParseActions()
467 n = pushNewNode(RBBINode::lookAhead); in doParseActions()
481 n = pushNewNode(RBBINode::tag); in doParseActions()
544 n = pushNewNode(RBBINode::varRef); in doParseActions()
553 if (n==NULL || n->fType != RBBINode::varRef) { in doParseActions()
637 void RBBIRuleScanner::fixOpStack(RBBINode::OpPrecedence p) { in fixOpStack()
638 RBBINode *n; in fixOpStack()
648 if (n->fPrecedence < p || n->fPrecedence <= RBBINode::precLParen) { in fixOpStack()
662 if (p <= RBBINode::precLParen) { in fixOpStack()
699 void RBBIRuleScanner::findSetFor(const UnicodeString &s, RBBINode *node, UnicodeSet *setToAdopt) { in findSetFor()
710 U_ASSERT(node->fLeftChild->fType == RBBINode::uset); in findSetFor()
731 RBBINode *usetNode = new RBBINode(RBBINode::uset); in findSetFor()
1084 fRB->fReverseTree = pushNewNode(RBBINode::opStar); in parse()
1085 RBBINode *operand = pushNewNode(RBBINode::setRef); in parse()
1140 RBBINode *RBBIRuleScanner::pushNewNode(RBBINode::NodeType t) { in pushNewNode()
1151 fNodeStack[fNodeStackPtr] = new RBBINode(t); in pushNewNode()
1230 RBBINode *n; in scanSet()
1232 n = pushNewNode(RBBINode::setRef); in scanSet()