35         fTree(*rootNode),  in RBBITableBuilder()
76     if (fTree==nullptr) {  in buildForwardTable()
84     fTree = fTree->flattenVariables();  in buildForwardTable()
88         RBBINode::printTree(fTree, true);  in buildForwardTable()
109         bofTop->fRightChild = fTree;  in buildForwardTable()
112         fTree               = bofTop;  in buildForwardTable()
126     cn->fLeftChild = fTree;  in buildForwardTable()
127     fTree->fParent = cn;  in buildForwardTable()
136     fTree = cn;  in buildForwardTable()
142     fTree->flattenSets();  in buildForwardTable()
146         RBBINode::printTree(fTree, true);  in buildForwardTable()
158     calcNullable(fTree);  in buildForwardTable()
159     calcFirstPos(fTree);  in buildForwardTable()
160     calcLastPos(fTree);  in buildForwardTable()
161     calcFollowPos(fTree);  in buildForwardTable()
164         printPosSets(fTree);  in buildForwardTable()
171         calcChainedFollowPos(fTree, endMarkerNode);  in buildForwardTable()
511     RBBINode  *bofNode = fTree->fLeftChild->fLeftChild;  in bofFixup()
520     UVector *matchStartNodes = fTree->fLeftChild->fRightChild->fFirstPosSet;  in bofFixup()
593     setAdd(initialState->fPositions, fTree->fFirstPosSet);  in buildStateTable()
783     fTree->findNodes(&endMarkerNodes, RBBINode::endMark, *fStatus);  in flagAcceptingStates()
832     fTree->findNodes(&lookAheadNodes, RBBINode::lookAhead, *fStatus);  in flagLookAheadStates()
877     fTree->findNodes(&tagNodes, RBBINode::tag, *fStatus);  in flagTaggedStates()
1327     if (fTree == nullptr) {  in getTableSize()
1361     if (U_FAILURE(*fStatus) || fTree == nullptr) {  in exportTable()