Searched refs:fReverseTree (Results 1 – 5 of 5) sorted by relevance
269 int destRules = (fReverseRule ? RBBIRuleBuilder.fReverseTree : fRB.fDefaultTree); in doParseActions()417 fRB.fDefaultTree = RBBIRuleBuilder.fReverseTree; in doParseActions()938 if (fRB.fTreeRoots[RBBIRuleBuilder.fReverseTree] == null) { in parse()939 fRB.fTreeRoots[RBBIRuleBuilder.fReverseTree] = pushNewNode(RBBINode.opStar); in parse()942 fRB.fTreeRoots[RBBIRuleBuilder.fReverseTree].fLeftChild = operand; in parse()943 operand.fParent = fRB.fTreeRoots[RBBIRuleBuilder.fReverseTree]; in parse()959 fRB.fTreeRoots[RBBIRuleBuilder.fReverseTree].printTree(true); in parse()
39 static final int fReverseTree = 1; // for each of the trees. field in RBBIRuleBuilder313 builder.fReverseTables = new RBBITableBuilder(builder, fReverseTree); in compileRules()
339 RBBINode **destRules = (fReverseRule? &fRB->fReverseTree : fRB->fDefaultTree); in doParseActions()494 fRB->fDefaultTree = &fRB->fReverseTree; in doParseActions()1051 if (fRB->fReverseTree == NULL) { in parse()1052 fRB->fReverseTree = pushNewNode(RBBINode::opStar); in parse()1055 fRB->fReverseTree->fLeftChild = operand; in parse()1056 operand->fParent = fRB->fReverseTree; in parse()1073 fRB->fReverseTree->printTree(TRUE); in parse()
59 fReverseTree = NULL; in RBBIRuleBuilder()121 delete fReverseTree; in ~RBBIRuleBuilder()260 builder.fReverseTables = new RBBITableBuilder(&builder, &builder.fReverseTree); in createRuleBasedBreakIterator()
131 RBBINode *fReverseTree; // then manipulated by subsequent steps. variable