109         bofTop->fRightChild = fTree;  in buildForwardTable()
128     RBBINode *endMarkerNode = cn->fRightChild = new RBBINode(RBBINode::endMark);  in buildForwardTable()
130     if (cn->fRightChild == NULL) {  in buildForwardTable()
135     cn->fRightChild->fParent = cn;  in buildForwardTable()
227     calcNullable(n->fRightChild);  in calcNullable()
231         n->fNullable = n->fLeftChild->fNullable || n->fRightChild->fNullable;  in calcNullable()
234         n->fNullable = n->fLeftChild->fNullable && n->fRightChild->fNullable;  in calcNullable()
271     calcFirstPos(n->fRightChild);  in calcFirstPos()
276         setAdd(n->fFirstPosSet, n->fRightChild->fFirstPosSet);  in calcFirstPos()
281             setAdd(n->fFirstPosSet, n->fRightChild->fFirstPosSet);  in calcFirstPos()
317     calcLastPos(n->fRightChild);  in calcLastPos()
322         setAdd(n->fLastPosSet, n->fRightChild->fLastPosSet);  in calcLastPos()
325         setAdd(n->fLastPosSet, n->fRightChild->fLastPosSet);  in calcLastPos()
326         if (n->fRightChild->fNullable) {  in calcLastPos()
352     calcFollowPos(n->fRightChild);  in calcFollowPos()
363             setAdd(i->fFollowPos, n->fRightChild->fFirstPosSet);  in calcFollowPos()
400     addRuleRootNodes(dest, node->fRightChild);  in addRuleRootNodes()
534     UVector *matchStartNodes = fTree->fLeftChild->fRightChild->fFirstPosSet;  in bofFixup()
1140     printPosSets(n->fRightChild);  in printPosSets()