📄 dagcheck.c
字号:
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_P_NT] + 0;
if (c + 0 < p->cost[_P_NT]) {
p->cost[_P_NT] = c + 0;
p->rule._P = 3;
_closure_P(a, c + 0);
}
break;
case 73: /* INDIRB */
_label(LEFT_CHILD(a));
/* stmt: INDIRB(P) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_P_NT] + 0;
if (c + 0 < p->cost[_stmt_NT]) {
p->cost[_stmt_NT] = c + 0;
p->rule._stmt = 1;
}
/* B: INDIRB(P) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_P_NT] + 0;
if (c + 0 < p->cost[_B_NT]) {
p->cost[_B_NT] = c + 0;
p->rule._B = 2;
_closure_B(a, c + 0);
}
break;
case 113: /* CVFF */
_label(LEFT_CHILD(a));
/* F: CVFF(F) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_F_NT] + 0;
if (c + 0 < p->cost[_F_NT]) {
p->cost[_F_NT] = c + 0;
p->rule._F = 5;
_closure_F(a, c + 0);
}
break;
case 117: /* CVFI */
_label(LEFT_CHILD(a));
/* I: CVFI(F) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_F_NT] + 0;
if (c + 0 < p->cost[_I_NT]) {
p->cost[_I_NT] = c + 0;
p->rule._I = 6;
_closure_I(a, c + 0);
}
break;
case 129: /* CVIF */
_label(LEFT_CHILD(a));
/* F: CVIF(I) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_I_NT] + 0;
if (c + 0 < p->cost[_F_NT]) {
p->cost[_F_NT] = c + 0;
p->rule._F = 4;
_closure_F(a, c + 0);
}
break;
case 133: /* CVII */
_label(LEFT_CHILD(a));
/* I: CVII(I) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_I_NT] + 0;
if (c + 0 < p->cost[_I_NT]) {
p->cost[_I_NT] = c + 0;
p->rule._I = 4;
_closure_I(a, c + 0);
}
break;
case 134: /* CVIU */
_label(LEFT_CHILD(a));
/* U: CVIU(I) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_I_NT] + 0;
if (c + 0 < p->cost[_U_NT]) {
p->cost[_U_NT] = c + 0;
p->rule._U = 4;
_closure_U(a, c + 0);
}
break;
case 150: /* CVPU */
_label(LEFT_CHILD(a));
/* U: CVPU(P) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_P_NT] + 0;
if (c + 0 < p->cost[_U_NT]) {
p->cost[_U_NT] = c + 0;
p->rule._U = 6;
_closure_U(a, c + 0);
}
break;
case 151: /* CVPP */
_label(LEFT_CHILD(a));
/* P: CVPP(P) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_P_NT] + 0;
if (c + 0 < p->cost[_P_NT]) {
p->cost[_P_NT] = c + 0;
p->rule._P = 5;
_closure_P(a, c + 0);
}
break;
case 181: /* CVUI */
_label(LEFT_CHILD(a));
/* I: CVUI(U) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_U_NT] + 0;
if (c + 0 < p->cost[_I_NT]) {
p->cost[_I_NT] = c + 0;
p->rule._I = 5;
_closure_I(a, c + 0);
}
break;
case 182: /* CVUU */
_label(LEFT_CHILD(a));
/* U: CVUU(U) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_U_NT] + 0;
if (c + 0 < p->cost[_U_NT]) {
p->cost[_U_NT] = c + 0;
p->rule._U = 5;
_closure_U(a, c + 0);
}
break;
case 183: /* CVUP */
_label(LEFT_CHILD(a));
/* P: CVUP(U) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_U_NT] + 0;
if (c + 0 < p->cost[_P_NT]) {
p->cost[_P_NT] = c + 0;
p->rule._P = 4;
_closure_P(a, c + 0);
}
break;
case 193: /* NEGF */
_label(LEFT_CHILD(a));
/* F: NEGF(F) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_F_NT] + 0;
if (c + 0 < p->cost[_F_NT]) {
p->cost[_F_NT] = c + 0;
p->rule._F = 6;
_closure_F(a, c + 0);
}
break;
case 197: /* NEGI */
_label(LEFT_CHILD(a));
/* I: NEGI(I) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_I_NT] + 0;
if (c + 0 < p->cost[_I_NT]) {
p->cost[_I_NT] = c + 0;
p->rule._I = 7;
_closure_I(a, c + 0);
}
break;
case 209: /* CALLF */
_label(LEFT_CHILD(a));
/* stmt: CALLF(P) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_P_NT] + 0;
if (c + 0 < p->cost[_stmt_NT]) {
p->cost[_stmt_NT] = c + 0;
p->rule._stmt = 6;
}
/* F: CALLF(P) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_P_NT] + 0;
if (c + 0 < p->cost[_F_NT]) {
p->cost[_F_NT] = c + 0;
p->rule._F = 7;
_closure_F(a, c + 0);
}
break;
case 213: /* CALLI */
_label(LEFT_CHILD(a));
/* stmt: CALLI(P) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_P_NT] + 0;
if (c + 0 < p->cost[_stmt_NT]) {
p->cost[_stmt_NT] = c + 0;
p->rule._stmt = 7;
}
/* I: CALLI(P) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_P_NT] + 0;
if (c + 0 < p->cost[_I_NT]) {
p->cost[_I_NT] = c + 0;
p->rule._I = 8;
_closure_I(a, c + 0);
}
break;
case 214: /* CALLU */
_label(LEFT_CHILD(a));
/* stmt: CALLU(P) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_P_NT] + 0;
if (c + 0 < p->cost[_stmt_NT]) {
p->cost[_stmt_NT] = c + 0;
p->rule._stmt = 8;
}
/* U: CALLU(P) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_P_NT] + 0;
if (c + 0 < p->cost[_U_NT]) {
p->cost[_U_NT] = c + 0;
p->rule._U = 7;
_closure_U(a, c + 0);
}
break;
case 215: /* CALLP */
_label(LEFT_CHILD(a));
/* stmt: CALLP(P) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_P_NT] + 0;
if (c + 0 < p->cost[_stmt_NT]) {
p->cost[_stmt_NT] = c + 0;
p->rule._stmt = 9;
}
/* P: CALLP(P) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_P_NT] + 0;
if (c + 0 < p->cost[_P_NT]) {
p->cost[_P_NT] = c + 0;
p->rule._P = 6;
_closure_P(a, c + 0);
}
break;
case 216: /* CALLV */
_label(LEFT_CHILD(a));
/* V: CALLV(P) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_P_NT] + 0;
if (c + 0 < p->cost[_V_NT]) {
p->cost[_V_NT] = c + 0;
p->rule._V = 13;
_closure_V(a, c + 0);
}
break;
case 217: /* CALLB */
_label(LEFT_CHILD(a));
_label(RIGHT_CHILD(a));
/* V: CALLB(P,P) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_P_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_P_NT] + 0;
if (c + 0 < p->cost[_V_NT]) {
p->cost[_V_NT] = c + 0;
p->rule._V = 12;
_closure_V(a, c + 0);
}
break;
case 241: /* RETF */
_label(LEFT_CHILD(a));
/* V: RETF(F) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_F_NT] + 0;
if (c + 0 < p->cost[_V_NT]) {
p->cost[_V_NT] = c + 0;
p->rule._V = 14;
_closure_V(a, c + 0);
}
break;
case 245: /* RETI */
_label(LEFT_CHILD(a));
/* V: RETI(I) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_I_NT] + 0;
if (c + 0 < p->cost[_V_NT]) {
p->cost[_V_NT] = c + 0;
p->rule._V = 15;
_closure_V(a, c + 0);
}
break;
case 246: /* RETU */
_label(LEFT_CHILD(a));
/* V: RETU(U) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_U_NT] + 0;
if (c + 0 < p->cost[_V_NT]) {
p->cost[_V_NT] = c + 0;
p->rule._V = 16;
_closure_V(a, c + 0);
}
break;
case 247: /* RETP */
_label(LEFT_CHILD(a));
/* V: RETP(P) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_P_NT] + 0;
if (c + 0 < p->cost[_V_NT]) {
p->cost[_V_NT] = c + 0;
p->rule._V = 17;
_closure_V(a, c + 0);
}
break;
case 248: /* RETV */
/* V: RETV */
if (0 + 0 < p->cost[_V_NT]) {
p->cost[_V_NT] = 0 + 0;
p->rule._V = 18;
_closure_V(a, 0 + 0);
}
break;
case 263: /* ADDRGP */
/* P: ADDRGP */
if (0 + 0 < p->cost[_P_NT]) {
p->cost[_P_NT] = 0 + 0;
p->rule._P = 7;
_closure_P(a, 0 + 0);
}
break;
case 279: /* ADDRFP */
/* P: ADDRFP */
if (0 + 0 < p->cost[_P_NT]) {
p->cost[_P_NT] = 0 + 0;
p->rule._P = 8;
_closure_P(a, 0 + 0);
}
break;
case 295: /* ADDRLP */
/* P: ADDRLP */
if (0 + 0 < p->cost[_P_NT]) {
p->cost[_P_NT] = 0 + 0;
p->rule._P = 9;
_closure_P(a, 0 + 0);
}
break;
case 305: /* ADDF */
_label(LEFT_CHILD(a));
_label(RIGHT_CHILD(a));
/* F: ADDF(F,F) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_F_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_F_NT] + 0;
if (c + 0 < p->cost[_F_NT]) {
p->cost[_F_NT] = c + 0;
p->rule._F = 8;
_closure_F(a, c + 0);
}
break;
case 309: /* ADDI */
_label(LEFT_CHILD(a));
_label(RIGHT_CHILD(a));
/* I: ADDI(I,I) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_I_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_I_NT] + 0;
if (c + 0 < p->cost[_I_NT]) {
p->cost[_I_NT] = c + 0;
p->rule._I = 9;
_closure_I(a, c + 0);
}
break;
case 310: /* ADDU */
_label(LEFT_CHILD(a));
_label(RIGHT_CHILD(a));
/* U: ADDU(U,U) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_U_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_U_NT] + 0;
if (c + 0 < p->cost[_U_NT]) {
p->cost[_U_NT] = c + 0;
p->rule._U = 8;
_closure_U(a, c + 0);
}
break;
case 311: /* ADDP */
_label(LEFT_CHILD(a));
_label(RIGHT_CHILD(a));
/* P: ADDP(P,I) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_P_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_I_NT] + 0;
if (c + 0 < p->cost[_P_NT]) {
p->cost[_P_NT] = c + 0;
p->rule._P = 10;
_closure_P(a, c + 0);
}
/* P: ADDP(I,P) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_I_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_P_NT] + 0;
if (c + 0 < p->cost[_P_NT]) {
p->cost[_P_NT] = c + 0;
p->rule._P = 11;
_closure_P(a, c + 0);
}
/* P: ADDP(U,P) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_U_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_P_NT] + 0;
if (c + 0 < p->cost[_P_NT]) {
p->cost[_P_NT] = c + 0;
p->rule._P = 12;
_closure_P(a, c + 0);
}
/* P: ADDP(P,U) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_P_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_U_NT] + 0;
if (c + 0 < p->cost[_P_NT]) {
p->cost[_P_NT] = c + 0;
p->rule._P = 13;
_closure_P(a, c + 0);
}
break;
case 321: /* SUBF */
_label(LEFT_CHILD(a));
_label(RIGHT_CHILD(a));
/* F: SUBF(F,F) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_F_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_F_NT] + 0;
if (c + 0 < p->cost[_F_NT]) {
p->cost[_F_NT] = c + 0;
p->rule._F = 9;
_closure_F(a, c + 0);
}
break;
case 325: /* SUBI */
_label(LEFT_CHILD(a));
_label(RIGHT_CHILD(a));
/* I: SUBI(I,I) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_I_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_I_NT] + 0;
if (c + 0 < p->cost[_I_NT]) {
p->cost[_I_NT] = c + 0;
p->rule._I = 10;
_closure_I(a, c + 0);
}
break;
case 326: /* SUBU */
_label(LEFT_CHILD(a));
_label(RIGHT_CHILD(a));
/* U: SUBU(U,U) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_U_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_U_NT] + 0;
if (c + 0 < p->cost[_U_NT]) {
p->cost[_U_NT] = c + 0;
p->rule._U = 9;
_closure_U(a, c + 0);
}
break;
case 327: /* SUBP */
_label(LEFT_CHILD(a));
_label(RIGHT_CHILD(a));
/* P: SUBP(P,I) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_P_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_I_NT] + 0;
if (c + 0 < p->cost[_P_NT]) {
p->cost[_P_NT] = c + 0;
p->rule._P = 14;
_closure_P(a, c + 0);
}
/* P: SUBP(P,U) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_P_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_U_NT] + 0;
if (c + 0 < p->cost[_P_NT]) {
p->cost[_P_NT] = c + 0;
p->rule._P = 15;
_closure_P(a, c + 0);
}
break;
case 341: /* LSHI */
_label(LEFT_CHILD(a));
_label(RIGHT_CHILD(a));
/* I: LSHI(I,I) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_I_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_I_NT] + 0;
if (c + 0 < p->cost[_I_NT]) {
p->cost[_I_NT] = c + 0;
p->rule._I = 11;
_closure_I(a, c + 0);
}
break;
case 342: /* LSHU */
_label(LEFT_CHILD(a));
_label(RIGHT_CHILD(a));
/* U: LSHU(U,I) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_U_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_I_NT] + 0;
if (c + 0 < p->cost[_U_NT]) {
p->cost[_U_NT] = c + 0;
p->rule._U = 10;
_closure_U(a, c + 0);
}
break;
case 357: /* MODI */
_label(LEFT_CHILD(a));
_label(RIGHT_CHILD(a));
/* I: MODI(I,I) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_I_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_I_NT] + 0;
if (c + 0 < p->cost[_I_NT]) {
p->cost[_I_NT] = c + 0;
p->rule._I = 12;
_closure_I(a, c + 0);
}
break;
case 358: /* MODU */
_label(LEFT_CHILD(a));
_label(RIGHT_CHILD(a));
/* U: MODU(U,U) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_U_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_U_NT] + 0;
if (c + 0 < p->cost[_U_NT]) {
p->cost[_U_NT] = c + 0;
p->rule._U = 11;
_closure_U(a, c + 0);
}
break;
case 373: /* RSHI */
_label(LEFT_CHILD(a));
_label(RIGHT_CHILD(a));
/* I: RSHI(I,I) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_I_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_I_NT] + 0;
if (c + 0 < p->cost[_I_NT]) {
p->cost[_I_NT] = c + 0;
p->rule._I = 13;
_closure_I(a, c + 0);
}
break;
case 374: /* RSHU */
_label(LEFT_CHILD(a));
_label(RIGHT_CHILD(a));
/* U: RSHU(U,I) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_U_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_I_NT] + 0;
if (c + 0 < p->cost[_U_NT]) {
p->cost[_U_NT] = c + 0;
p->rule._U = 12;
_closure_U(a, c + 0);
}
break;
case 389: /* BANDI */
_label(LEFT_CHILD(a));
_label(RIGHT_CHILD(a));
/* I: BANDI(I,I) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_I_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_I_NT] + 0;
if (c + 0 < p->cost[_I_NT]) {
p->cost[_I_NT] = c + 0;
p->rule._I = 14;
_closure_I(a, c + 0);
}
break;
case 390: /* BANDU */
_label(LEFT_CHILD(a));
_label(RIGHT_CHILD(a));
/* U: BANDU(U,U) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_U_NT] + ((struct _state *)(RIGHT_CHILD(a)->x.state))->cost[_U_NT] + 0;
if (c + 0 < p->cost[_U_NT]) {
p->cost[_U_NT] = c + 0;
p->rule._U = 13;
_closure_U(a, c + 0);
}
break;
case 405: /* BCOMI */
_label(LEFT_CHILD(a));
/* I: BCOMI(I) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_I_NT] + 0;
if (c + 0 < p->cost[_I_NT]) {
p->cost[_I_NT] = c + 0;
p->rule._I = 15;
_closure_I(a, c + 0);
}
break;
case 406: /* BCOMU */
_label(LEFT_CHILD(a));
/* U: BCOMU(U) */
c = ((struct _state *)(LEFT_CHILD(a)->x.state))->cost[_U_NT] + 0;
if (c + 0 < p->cost[_U_NT]) {
p->cost[_U_NT] = c + 0;
p->rule._U = 14;
_closure_U(a, c + 0);
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -