Lines Matching defs:set

101 /********** From the file "set.h" ****************************************/
103 char *SetNew(/* void */); /* A new set for element 0..N */
104 void SetFree(/* char* */); /* Deallocate a set */
106 int SetAdd(/* char*,int */); /* Add element to a set */
109 #define SetFind(X,Y) (X[Y]) /* True if Y is in set X */
136 char *firstset; /* First-set for all rules of this symbol */
168 ** Configurations also contain a follow-set which is a list of terminal
174 char *fws; /* Follow-set for this configuration only */
175 struct plink *fplp; /* Follow-set forward propagation links */
176 struct plink *bplp; /* Follow-set backwards propagation links */
211 struct config *cfp; /* All configurations in this set */
411 *aLookahead; /* A single new transaction set */
446 /* Add a new action to the current transaction set
475 ** Add the transaction set built up with prior calls to acttab_action()
476 ** into the current action table. Then reset the transaction set back
477 ** to an empty set in preparation for a new round of acttab_action() calls.
486 ** in the worst case. The worst case occurs if the transaction set
506 ** insert the current transaction set. Fall out of the loop when that
508 ** i reaches p->nAction, which means we append the new transaction set.
541 break; /* Same as a prior transaction set */
545 /* Insert transaction set at index i. */
604 ** The first set is the set of all terminal symbols which can begin
703 /* The basis configuration set for the first state
737 /* A state with the same basis already exists! Copy all the follow-set
787 Configlist_reset(); /* Reset the new config set */
791 ** following its dot, add the same configuration to the basis set under
803 /* Get a pointer to the state described by the basis configuration set
835 ** links are used in the follow-set computation. */
849 ** A followset is the set of all symbols which can come immediately
1406 /* Compute all LR(0) states. Also record follow-set propagation
1407 ** links so that the follow-set can be computed later */
1415 /* Compute the follow set of every reducible configuration */
1550 char *set[LISTSIZE];
1553 for(i=0; i<LISTSIZE; i++) set[i] = 0;
1558 for(i=0; i<LISTSIZE-1 && set[i]!=0; i++){
1559 ep = merge(ep,set[i],cmp,offset);
1560 set[i] = 0;
1562 set[i] = ep;
1565 for(i=0; i<LISTSIZE; i++) if( set[i] ) ep = merge(ep,set[i],cmp,offset);
2422 ** Routines processing configuration follow-set propagation links
2437 "Unable to allocate memory for a new follow-set propagation link.\n");
2595 /* Print a set */
2596 PRIVATE void SetPrint(out,set,lemp)
2598 char *set;
2606 if( SetFind(set,i) ){
3007 ** union, also set the ".dtnum" field of every terminal and nonterminal
3138 ** Each state contains a set of token transaction and a set of
3461 ** rule in the rule set of the grammer. This information is used
3642 /***************** From the file "set.c" ************************************/
3649 /* Set the set size */
3656 /* Allocate a new set */
3669 /* Deallocate a set */
3676 /* Add a new element to the set. Return TRUE if the element was added