Lines Matching refs:rule
164 struct rule;
181 struct config *Configlist_add(struct rule *, int);
182 struct config *Configlist_addbasis(struct rule *, int);
259 struct rule *rule; /* Linked list of rules of this (if an NT) */ member
284 struct rule { struct
305 struct rule *nextlhs; /* Next rule with the same LHS */ argument
306 struct rule *next; /* Next rule in the global list */ argument
319 struct rule *rp; /* The rule upon which the configuration is based */
350 struct rule *rp; /* The rule, if a reduce */
367 struct rule *pDfltReduce;/* The default REDUCE rule. */
386 struct rule *rule; /* List of all rules */ member
387 struct rule *startRule; /* First rule */
558 newaction->x.rp = (struct rule *)arg; in Action_add()
813 struct rule *rp; in FindRulePrecedences()
814 for(rp=xp->rule; rp; rp=rp->next){ in FindRulePrecedences()
843 struct rule *rp; in FindFirstSets()
856 for(rp=lemp->rule; rp; rp=rp->next){ in FindFirstSets()
874 for(rp=lemp->rule; rp; rp=rp->next){ in FindFirstSets()
906 struct rule *rp; in FindStates()
931 for(rp=lemp->rule; rp; rp=rp->next){ in FindStates()
947 for(rp=sp->rule; rp; rp=rp->nextlhs){ in FindStates()
1157 struct rule *rp; in FindActions()
1213 for(rp=lemp->rule; rp; rp=rp->next) rp->canReduce = LEMON_FALSE; in FindActions()
1220 for(rp=lemp->rule; rp; rp=rp->next){ in FindActions()
1347 struct rule *rp, /* The rule */ in Configlist_add()
1373 struct config *Configlist_addbasis(struct rule *rp, int dot) in Configlist_addbasis()
1404 struct rule *rp, *newrp; in Configlist_closure()
1415 if( sp->rule==0 && sp!=lemp->errsym ){ in Configlist_closure()
1420 for(newrp=sp->rule; newrp; newrp=newrp->nextlhs){ in Configlist_closure()
1567 static struct rule *Rule_merge(struct rule *pA, struct rule *pB){ in Rule_merge()
1568 struct rule *pFirst = 0; in Rule_merge()
1569 struct rule **ppPrev = &pFirst; in Rule_merge()
1592 static struct rule *Rule_sort(struct rule *rp){ in Rule_sort()
1594 struct rule *pNext; in Rule_sort()
1595 struct rule *x[32]; in Rule_sort()
1668 struct rule *rp; in main()
1720 for(i=0, rp=lem.rule; rp; rp=rp->next){ in main()
1724 for(rp=lem.rule; rp; rp=rp->next){ in main()
1727 lem.startRule = lem.rule; in main()
1728 lem.rule = Rule_sort(lem.rule); in main()
2246 struct rule *prevrule; /* Previous rule parsed */
2253 struct rule *firstrule; /* Pointer to first rule in the grammar */
2254 struct rule *lastrule; /* Pointer to the most recently parsed rule */
2383 struct rule *rp; in parseonetoken()
2384 rp = (struct rule *)calloc( sizeof(struct rule) + in parseonetoken()
2408 rp->nextlhs = rp->lhs->rule; in parseonetoken()
2409 rp->lhs->rule = rp; in parseonetoken()
3105 gp->rule = ps.firstrule; in Parse()
3234 void rule_print(FILE *out, struct rule *rp){ in rule_print()
3257 struct rule *rp; in Reprint()
3279 for(rp=lemp->rule; rp; rp=rp->next){ in Reprint()
3290 void RulePrint(FILE *fp, struct rule *rp, int iCursor){ in RulePrint()
3367 struct rule *rp = ap->x.rp; in PrintAction()
3373 struct rule *rp = ap->x.rp; in PrintAction()
3426 struct rule *rp; in ReportOutput()
3505 for(rp=lemp->rule; rp; rp=rp->next){ in ReportOutput()
3846 PRIVATE int translate_code(struct lemon *lemp, struct rule *rp){ in translate_code()
4045 struct rule *rp, in emit_code()
4269 static void writeRuleText(FILE *out, struct rule *rp){ in writeRuleText()
4297 struct rule *rp; in ReportTable()
4367 for(i=0, rp=lemp->rule; rp; rp=rp->next, i++){ in ReportTable()
4577 for(rp=lemp->rule; rp; rp=rp->next) rp->doesReduce = LEMON_FALSE; in ReportTable()
4776 for(i=0, rp=lemp->rule; rp; rp=rp->next, i++){ in ReportTable()
4857 for(i=0, rp=lemp->rule; rp; rp=rp->next, i++){ in ReportTable()
4863 for(i=0, rp=lemp->rule; rp; rp=rp->next, i++){ in ReportTable()
4872 for(rp=lemp->rule; rp; rp=rp->next){ in ReportTable()
4879 for(rp=lemp->rule; rp; rp=rp->next){ in ReportTable()
4880 struct rule *rp2; /* Other rules with the same action */ in ReportTable()
4905 for(rp=lemp->rule; rp; rp=rp->next){ in ReportTable()
4992 struct rule *rp, *rp2, *rbest; in CompressTables()
5388 sp->rule = 0; in Symbol_new()