Lines Matching refs:rule
164 struct rule;
181 struct config *Configlist_add(struct rule *, int);
182 struct config *Configlist_addbasis(struct rule *, int);
258 struct rule *rule; /* Linked list of rules of this (if an NT) */ member
283 struct rule { struct
304 struct rule *nextlhs; /* Next rule with the same LHS */ argument
305 struct rule *next; /* Next rule in the global list */ argument
318 struct rule *rp; /* The rule upon which the configuration is based */
349 struct rule *rp; /* The rule, if a reduce */
366 struct rule *pDfltReduce;/* The default REDUCE rule. */
385 struct rule *rule; /* List of all rules */ member
386 struct rule *startRule; /* First rule */
557 newaction->x.rp = (struct rule *)arg; in Action_add()
812 struct rule *rp; in FindRulePrecedences()
813 for(rp=xp->rule; rp; rp=rp->next){ in FindRulePrecedences()
842 struct rule *rp; in FindFirstSets()
855 for(rp=lemp->rule; rp; rp=rp->next){ in FindFirstSets()
873 for(rp=lemp->rule; rp; rp=rp->next){ in FindFirstSets()
905 struct rule *rp; in FindStates()
930 for(rp=lemp->rule; rp; rp=rp->next){ in FindStates()
946 for(rp=sp->rule; rp; rp=rp->nextlhs){ in FindStates()
1156 struct rule *rp; in FindActions()
1212 for(rp=lemp->rule; rp; rp=rp->next) rp->canReduce = LEMON_FALSE; in FindActions()
1219 for(rp=lemp->rule; rp; rp=rp->next){ in FindActions()
1346 struct rule *rp, /* The rule */ in Configlist_add()
1372 struct config *Configlist_addbasis(struct rule *rp, int dot) in Configlist_addbasis()
1403 struct rule *rp, *newrp; in Configlist_closure()
1414 if( sp->rule==0 && sp!=lemp->errsym ){ in Configlist_closure()
1419 for(newrp=sp->rule; newrp; newrp=newrp->nextlhs){ in Configlist_closure()
1566 static struct rule *Rule_merge(struct rule *pA, struct rule *pB){ in Rule_merge()
1567 struct rule *pFirst = 0; in Rule_merge()
1568 struct rule **ppPrev = &pFirst; in Rule_merge()
1591 static struct rule *Rule_sort(struct rule *rp){ in Rule_sort()
1593 struct rule *pNext; in Rule_sort()
1594 struct rule *x[32]; in Rule_sort()
1667 struct rule *rp; in main()
1719 for(i=0, rp=lem.rule; rp; rp=rp->next){ in main()
1723 for(rp=lem.rule; rp; rp=rp->next){ in main()
1726 lem.startRule = lem.rule; in main()
1727 lem.rule = Rule_sort(lem.rule); in main()
2245 struct rule *prevrule; /* Previous rule parsed */
2252 struct rule *firstrule; /* Pointer to first rule in the grammar */
2253 struct rule *lastrule; /* Pointer to the most recently parsed rule */
2382 struct rule *rp; in parseonetoken()
2383 rp = (struct rule *)calloc( sizeof(struct rule) + in parseonetoken()
2407 rp->nextlhs = rp->lhs->rule; in parseonetoken()
2408 rp->lhs->rule = rp; in parseonetoken()
3104 gp->rule = ps.firstrule; in Parse()
3233 void rule_print(FILE *out, struct rule *rp){ in rule_print()
3256 struct rule *rp; in Reprint()
3278 for(rp=lemp->rule; rp; rp=rp->next){ in Reprint()
3289 void RulePrint(FILE *fp, struct rule *rp, int iCursor){ in RulePrint()
3366 struct rule *rp = ap->x.rp; in PrintAction()
3372 struct rule *rp = ap->x.rp; in PrintAction()
3425 struct rule *rp; in ReportOutput()
3504 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()