Lines Matching refs:RBBINode
199 RBBINode *n = NULL; in doParseActions()
206 pushNewNode(RBBINode::opStart); in doParseActions()
213 fixOpStack(RBBINode::precOpCat); in doParseActions()
214 RBBINode *operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()
215 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()
241 pushNewNode(RBBINode::opLParen); in doParseActions()
245 fixOpStack(RBBINode::precLParen); in doParseActions()
264 pushNewNode(RBBINode::opStart); in doParseActions()
276 fixOpStack(RBBINode::precStart); in doParseActions()
278 RBBINode *startExprNode = fNodeStack[fNodeStackPtr-2]; in doParseActions()
279 RBBINode *varRefNode = fNodeStack[fNodeStackPtr-1]; in doParseActions()
280 RBBINode *RHSExprNode = fNodeStack[fNodeStackPtr]; in doParseActions()
310 fixOpStack(RBBINode::precStart); // Terminate expression, leaves expression in doParseActions()
322 RBBINode *thisRule = fNodeStack[fNodeStackPtr]; in doParseActions()
323 RBBINode *endNode = pushNewNode(RBBINode::endMark); in doParseActions()
324 RBBINode *catNode = pushNewNode(RBBINode::opCat); in doParseActions()
341 RBBINode **destRules = (fReverseRule? &fRB->fReverseTree : fRB->fDefaultTree); in doParseActions()
349 RBBINode *thisRule = fNodeStack[fNodeStackPtr]; in doParseActions()
350 RBBINode *prevRules = *destRules; in doParseActions()
351 RBBINode *orNode = pushNewNode(RBBINode::opOr); in doParseActions()
390 RBBINode *operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()
391 RBBINode *plusNode = pushNewNode(RBBINode::opPlus); in doParseActions()
399 RBBINode *operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()
400 RBBINode *qNode = pushNewNode(RBBINode::opQuestion); in doParseActions()
408 RBBINode *operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()
409 RBBINode *starNode = pushNewNode(RBBINode::opStar); in doParseActions()
422 n = pushNewNode(RBBINode::setRef); in doParseActions()
433 n = pushNewNode(RBBINode::setRef); in doParseActions()
443 n = pushNewNode(RBBINode::lookAhead); in doParseActions()
454 n = pushNewNode(RBBINode::tag); in doParseActions()
514 n = pushNewNode(RBBINode::varRef); in doParseActions()
523 if (n==NULL || n->fType != RBBINode::varRef) { in doParseActions()
607 void RBBIRuleScanner::fixOpStack(RBBINode::OpPrecedence p) { in fixOpStack()
608 RBBINode *n; in fixOpStack()
618 if (n->fPrecedence < p || n->fPrecedence <= RBBINode::precLParen) { in fixOpStack()
632 if (p <= RBBINode::precLParen) { in fixOpStack()
669 void RBBIRuleScanner::findSetFor(const UnicodeString &s, RBBINode *node, UnicodeSet *setToAdopt) { in findSetFor()
680 U_ASSERT(node->fLeftChild->fType == RBBINode::uset); in findSetFor()
701 RBBINode *usetNode = new RBBINode(RBBINode::uset); in findSetFor()
1054 fRB->fReverseTree = pushNewNode(RBBINode::opStar); in parse()
1055 RBBINode *operand = pushNewNode(RBBINode::setRef); in parse()
1107 RBBINode *RBBIRuleScanner::pushNewNode(RBBINode::NodeType t) { in pushNewNode()
1115 fNodeStack[fNodeStackPtr] = new RBBINode(t); in pushNewNode()
1194 RBBINode *n; in scanSet()
1196 n = pushNewNode(RBBINode::setRef); in scanSet()