Searched refs:completionTree (Results 1 – 4 of 4) sorted by relevance
418 /* MR11 */ &(pred->completionTree), t);422 &(pred->completionTree), t);425 MR_check_pred_too_long(pred,pred->completionTree);595 p->completionTree=empty; in new_pred()674 while ( !set_nil(a->completionTree) )676 k2 = set_int(a->completionTree);677 set_rm(k2, a->completionTree);686 set_orin(&(a->completionTree), rk2);/* remember what we couldn't do */746 set_free(p->completionTree);792 q->completionTree=set_dup(p->completionTree);
110 set completionTree; /* which lookahead depths are required to complete tcontext? */ member
78 k=set_int(p->completionTree);
403 k=set_int(p->completionTree);509 if ( ! set_nil(p->completionTree)) return 0;1071 MR_complete_tree(predDepth,&(pred->tcontext),&(pred->completionTree));