27 RBBITableBuilder::RBBITableBuilder(RBBIRuleBuilder *rb, RBBINode **rootNode) :  in RBBITableBuilder()
93         RBBINode *bofTop    = new RBBINode(RBBINode::opCat);  in build()
94         RBBINode *bofLeaf   = new RBBINode(RBBINode::leafChar);  in build()
114     RBBINode *cn = new RBBINode(RBBINode::opCat);  in build()
122     cn->fRightChild = new RBBINode(RBBINode::endMark);  in build()
200 void RBBITableBuilder::calcNullable(RBBINode *n) {  in calcNullable()
204     if (n->fType == RBBINode::setRef ||  in calcNullable()
205         n->fType == RBBINode::endMark ) {  in calcNullable()
211     if (n->fType == RBBINode::lookAhead || n->fType == RBBINode::tag) {  in calcNullable()
225     if (n->fType == RBBINode::opOr) {  in calcNullable()
228     else if (n->fType == RBBINode::opCat) {  in calcNullable()
231     else if (n->fType == RBBINode::opStar || n->fType == RBBINode::opQuestion) {  in calcNullable()
247 void RBBITableBuilder::calcFirstPos(RBBINode *n) {  in calcFirstPos()
251     if (n->fType == RBBINode::leafChar  ||  in calcFirstPos()
252         n->fType == RBBINode::endMark   ||  in calcFirstPos()
253         n->fType == RBBINode::lookAhead ||  in calcFirstPos()
254         n->fType == RBBINode::tag) {  in calcFirstPos()
269     if (n->fType == RBBINode::opOr) {  in calcFirstPos()
273     else if (n->fType == RBBINode::opCat) {  in calcFirstPos()
279     else if (n->fType == RBBINode::opStar ||  in calcFirstPos()
280              n->fType == RBBINode::opQuestion ||  in calcFirstPos()
281              n->fType == RBBINode::opPlus) {  in calcFirstPos()
293 void RBBITableBuilder::calcLastPos(RBBINode *n) {  in calcLastPos()
297     if (n->fType == RBBINode::leafChar  ||  in calcLastPos()
298         n->fType == RBBINode::endMark   ||  in calcLastPos()
299         n->fType == RBBINode::lookAhead ||  in calcLastPos()
300         n->fType == RBBINode::tag) {  in calcLastPos()
315     if (n->fType == RBBINode::opOr) {  in calcLastPos()
319     else if (n->fType == RBBINode::opCat) {  in calcLastPos()
325     else if (n->fType == RBBINode::opStar     ||  in calcLastPos()
326              n->fType == RBBINode::opQuestion ||  in calcLastPos()
327              n->fType == RBBINode::opPlus) {  in calcLastPos()
339 void RBBITableBuilder::calcFollowPos(RBBINode *n) {  in calcFollowPos()
341         n->fType == RBBINode::leafChar ||  in calcFollowPos()
342         n->fType == RBBINode::endMark) {  in calcFollowPos()
350     if (n->fType == RBBINode::opCat) {  in calcFollowPos()
351         RBBINode *i;   // is 'i' in Aho's description  in calcFollowPos()
357             i = (RBBINode *)LastPosOfLeftChild->elementAt(ix);  in calcFollowPos()
363     if (n->fType == RBBINode::opStar ||  in calcFollowPos()
364         n->fType == RBBINode::opPlus) {  in calcFollowPos()
365         RBBINode   *i;  // again, n and i are the names from Aho's description.  in calcFollowPos()
369             i = (RBBINode *)n->fLastPosSet->elementAt(ix);  in calcFollowPos()
385 void RBBITableBuilder::calcChainedFollowPos(RBBINode *tree) {  in calcChainedFollowPos()
396     tree->findNodes(&endMarkerNodes, RBBINode::endMark, *fStatus);  in calcChainedFollowPos()
399     tree->findNodes(&leafNodes, RBBINode::leafChar, *fStatus);  in calcChainedFollowPos()
407     RBBINode *userRuleRoot = tree;  in calcChainedFollowPos()
421         RBBINode *tNode   = (RBBINode *)leafNodes.elementAt(endNodeIx);  in calcChainedFollowPos()
422         RBBINode *endNode = NULL;  in calcChainedFollowPos()
457         RBBINode *startNode;  in calcChainedFollowPos()
459             startNode = (RBBINode *)matchStartNodes->elementAt(startNodeIx);  in calcChainedFollowPos()
460             if (startNode->fType != RBBINode::leafChar) {  in calcChainedFollowPos()
505     RBBINode  *bofNode = fTree->fLeftChild->fLeftChild;  in bofFixup()
506     U_ASSERT(bofNode->fType == RBBINode::leafChar);  in bofFixup()
516     RBBINode *startNode;  in bofFixup()
519         startNode = (RBBINode *)matchStartNodes->elementAt(startNodeIx);  in bofFixup()
520         if (startNode->fType != RBBINode::leafChar) {  in bofFixup()
619             RBBINode   *p;  in buildStateTable()
622                 p = (RBBINode *)T->fPositions->elementAt(px);  in buildStateTable()
623                 if ((p->fType == RBBINode::leafChar) &&  (p->fVal == a)) {  in buildStateTable()
699     RBBINode    *endMarker;  in flagAcceptingStates()
707     fTree->findNodes(&endMarkerNodes, RBBINode::endMark, *fStatus);  in flagAcceptingStates()
713         endMarker = (RBBINode *)endMarkerNodes.elementAt(i);  in flagAcceptingStates()
761     RBBINode    *lookAheadNode;  in flagLookAheadStates()
765     fTree->findNodes(&lookAheadNodes, RBBINode::lookAhead, *fStatus);  in flagLookAheadStates()
770         lookAheadNode = (RBBINode *)lookAheadNodes.elementAt(i);  in flagLookAheadStates()
794     RBBINode    *tagNode;  in flagTaggedStates()
801     fTree->findNodes(&tagNodes, RBBINode::tag, *fStatus);  in flagTaggedStates()
806         tagNode = (RBBINode *)tagNodes.elementAt(i);  in flagTaggedStates()
1031 void RBBITableBuilder::printPosSets(RBBINode *n) {  in printPosSets()