Lines Matching refs:alt
221 Junction *alt;
224 for (alt=q; alt != NULL; alt= (Junction *) alt->p2 )
226 for (i=1; i<=CLL_k; i++) set_free(alt->fset[i]);
1553 Junction *alt;
1575 for (alt=q; alt != NULL; alt= (Junction *) alt->p2 )
1577 if ( alt->p2 == NULL ) /* chk for empty alt */
1579 Node *p = alt->p1;
1582 /* we have empty alt */
1605 /* MR23 */ /* code to restore state if a prev alt didn't follow guess */
1616 } /* end of for loop on alt */
1618 /* MR10 */ if (alt->p2 == NULL &&
1620 /* MR10 */ if (first_item_is_guess_block(alt)) {
1622 /* MR10 */ FileStr[alt->file],alt->line);
1626 if ( alt != q ) gen("else ")
1635 if ( alt!=q )
1640 /* code to restore state if a prev alt didn't follow guess */
1644 if ( first_item_is_guess_block((Junction *)alt->p1)!=NULL )
1650 if ( first_item_is_guess_block((Junction *)alt->p1)!=NULL ) _gen("!zzrv && ");
1651 genExpr(alt);
1655 TRANS(alt->p1);
1658 /* MR10 */ if (alt->p2 == NULL) {
1659 /* MR10 */ if (first_item_is_guess_block(alt)) {
1663 /* MR10 */ /* code to restore state if a prev alt didn't follow guess */
1680 Junction *alt;
1682 for (alt=q; alt != NULL; alt= (Junction *) alt->p2 )
1684 if ( first_item_is_guess_block((Junction *)alt->p1)!=NULL ) return 1;
1697 Junction *alt;
1700 for (alt=q; alt->p2 != NULL && !( (Junction *) alt->p2)->ignore; alt= (Junction *) alt->p2 ) {};
1701 return first_item_is_guess_block( (Junction *) alt->p1) != NULL;
1734 /* return NULL if 1st item of alt is NOT (...)? block; else return ptr to aSubBlk node
2824 /* if no predicates have been hoisted for this single alt (..)*
3074 /* if the ignore flag is set on the 2nd alt and that alt is empty,
3076 * and, hence, only 1 alt.
3080 * Outer code for guess blocks ignored when there is only one alt
3092 /* if the only alt has a semantic predicate, hoist it; must test before
3243 * The last node in every alt points to q->end.
4449 /* MR13 */ errFL("empty error set for alt - probably because of undefined rule or infinite left recursion",
4451 /* MR13 */ gen(" /* MR13 empty error set for this alt - undef rule ? infinite left recursion ? */");
4493 ** Junction *alt; /* MR7 */
4495 ** for (alt=startJ; alt != NULL; alt=alt->outerAltstart) { /* MR7 */
4496 ** label=alt->exception_label; /* MR7 */
4723 /* MR23 Check for empty alt in a more intelligent way.
4724 Previously, an empty alt for genBlk had to point directly
4741 int isEmptyAlt(Node * alt, Node * endBlock)
4743 int isEmptyAlt(alt, endBlock)
4744 Node * alt;
4748 Node * n = alt;