32         fTree(*rootNode),  in RBBITableBuilder()
72     if (fTree==NULL) {  in buildForwardTable()
80     fTree = fTree->flattenVariables();  in buildForwardTable()
84         RBBINode::printTree(fTree, TRUE);  in buildForwardTable()
105         bofTop->fRightChild = fTree;  in buildForwardTable()
108         fTree               = bofTop;  in buildForwardTable()
122     cn->fLeftChild = fTree;  in buildForwardTable()
123     fTree->fParent = cn;  in buildForwardTable()
132     fTree = cn;  in buildForwardTable()
138     fTree->flattenSets();  in buildForwardTable()
142         RBBINode::printTree(fTree, TRUE);  in buildForwardTable()
154     calcNullable(fTree);  in buildForwardTable()
155     calcFirstPos(fTree);  in buildForwardTable()
156     calcLastPos(fTree);  in buildForwardTable()
157     calcFollowPos(fTree);  in buildForwardTable()
160         printPosSets(fTree);  in buildForwardTable()
167         calcChainedFollowPos(fTree);  in buildForwardTable()
529     RBBINode  *bofNode = fTree->fLeftChild->fLeftChild;  in bofFixup()
538     UVector *matchStartNodes = fTree->fLeftChild->fRightChild->fFirstPosSet;  in bofFixup()
611     setAdd(initialState->fPositions, fTree->fFirstPosSet);  in buildStateTable()
731     fTree->findNodes(&endMarkerNodes, RBBINode::endMark, *fStatus);  in flagAcceptingStates()
789     fTree->findNodes(&lookAheadNodes, RBBINode::lookAhead, *fStatus);  in flagLookAheadStates()
825     fTree->findNodes(&tagNodes, RBBINode::tag, *fStatus);  in flagTaggedStates()
1274     if (fTree == NULL) {  in getTableSize()
1301     if (U_FAILURE(*fStatus) || fTree == NULL) {  in exportTable()