30  fTree(*rootNode) {  in RBBITableBuilder()
72     if (fTree==NULL) {  in build()
80     fTree = fTree->flattenVariables();  in build()
84         RBBINode::printTree(fTree, TRUE);  in build()
105         bofTop->fRightChild = fTree;  in build()
108         fTree               = bofTop;  in build()
122     cn->fLeftChild = fTree;  in build()
123     fTree->fParent = cn;  in build()
132     fTree = cn;  in build()
138     fTree->flattenSets();  in build()
142         RBBINode::printTree(fTree, TRUE);  in build()
154     calcNullable(fTree);  in build()
155     calcFirstPos(fTree);  in build()
156     calcLastPos(fTree);  in build()
157     calcFollowPos(fTree);  in build()
160         printPosSets(fTree);  in build()
167         calcChainedFollowPos(fTree);  in build()
531     RBBINode  *bofNode = fTree->fLeftChild->fLeftChild;  in bofFixup()
540     UVector *matchStartNodes = fTree->fLeftChild->fRightChild->fFirstPosSet;  in bofFixup()
613     setAdd(initialState->fPositions, fTree->fFirstPosSet);  in buildStateTable()
733     fTree->findNodes(&endMarkerNodes, RBBINode::endMark, *fStatus);  in flagAcceptingStates()
791     fTree->findNodes(&lookAheadNodes, RBBINode::lookAhead, *fStatus);  in flagLookAheadStates()
827     fTree->findNodes(&tagNodes, RBBINode::tag, *fStatus);  in flagTaggedStates()
1094     if (fTree == NULL) {  in getTableSize()
1125     if (U_FAILURE(*fStatus) || fTree == NULL) {  in exportTable()