Tags
○ ruby -e ‘ft = 40 +2; p ft’ –dump yydebug
Starting parse
Entering state 0
Reducing stack by rule 1 (line 782):
-> $$ = nterm $@1 ()
Stack now 0
Entering state 2
Reading a token: Next token is token tIDENTIFIER ()
Shifting token tIDENTIFIER ()
Entering state 35
Reading a token: Next token is token ‘=’ ()
Reducing stack by rule 474 (line 4275):
$1 = token tIDENTIFIER ()
-> $$ = nterm user_variable ()
Stack now 0 2
Entering state 105
Next token is token ‘=’ ()
Reducing stack by rule 98 (line 1680):
$1 = nterm user_variable ()
-> $$ = nterm lhs ()
Stack now 0 2
Entering state 78
Next token is token ‘=’ ()
Shifting token ‘=’ ()
Entering state 307
Reading a token: Next token is token tINTEGER ()
Shifting token tINTEGER ()
Entering state 41
Reducing stack by rule 470 (line 4255):
$1 = token tINTEGER ()
-> $$ = nterm numeric ()
Stack now 0 2 78 307
Entering state 104
Reducing stack by rule 428 (line 3830):
$1 = nterm numeric ()
-> $$ = nterm literal ()
Stack now 0 2 78 307
Entering state 94
Reducing stack by rule 270 (line 2616):
$1 = nterm literal ()
-> $$ = nterm primary ()
Stack now 0 2 78 307
Entering state 80
Reading a token: Next token is token ‘+’ ()
Reducing stack by rule 239 (line 2375):
$1 = nterm primary ()
-> $$ = nterm arg ()
Stack now 0 2 78 307
Entering state 496
Next token is token ‘+’ ()
Shifting token ‘+’ ()
Entering state 329
Reading a token: Next token is token tINTEGER ()
Shifting token tINTEGER ()
Entering state 41
Reducing stack by rule 470 (line 4255):
$1 = token tINTEGER ()
-> $$ = nterm numeric ()
Stack now 0 2 78 307 496 329
Entering state 104
Reducing stack by rule 428 (line 3830):
$1 = nterm numeric ()
-> $$ = nterm literal ()
Stack now 0 2 78 307 496 329
Entering state 94
Reducing stack by rule 270 (line 2616):
$1 = nterm literal ()
-> $$ = nterm primary ()
Stack now 0 2 78 307 496 329
Entering state 80
Reading a token: Next token is token ‘;’ ()
Reducing stack by rule 239 (line 2375):
$1 = nterm primary ()
-> $$ = nterm arg ()
Stack now 0 2 78 307 496 329
Entering state 520
Next token is token ‘;’ ()
Reducing stack by rule 207 (line 2118):
$1 = nterm arg ()
$2 = token ‘+’ ()
$3 = nterm arg ()
-> $$ = nterm arg ()
Stack now 0 2 78 307
Entering state 496
Next token is token ‘;’ ()
Reducing stack by rule 194 (line 1901):
$1 = nterm lhs ()
$2 = token ‘=’ ()
$3 = nterm arg ()
-> $$ = nterm arg ()
Stack now 0 2
Entering state 79
Next token is token ‘;’ ()
Reducing stack by rule 49 (line 1282):
$1 = nterm arg ()
-> $$ = nterm expr ()
Stack now 0 2
Entering state 69
Next token is token ‘;’ ()
Reducing stack by rule 41 (line 1225):
$1 = nterm expr ()
-> $$ = nterm stmt ()
Stack now 0 2
Entering state 67
Next token is token ‘;’ ()
Reducing stack by rule 8 (line 855):
$1 = nterm stmt ()
-> $$ = nterm top_stmt ()
Stack now 0 2
Entering state 66
Reducing stack by rule 5 (line 833):
$1 = nterm top_stmt ()
-> $$ = nterm top_stmts ()
Stack now 0 2
Entering state 65
Next token is token ‘;’ ()
Shifting token ‘;’ ()
Entering state 288
Reducing stack by rule 568 (line 4863):
$1 = token ‘;’ ()
-> $$ = nterm term ()
Stack now 0 2 65
Entering state 291
Reducing stack by rule 570 (line 4867):
$1 = nterm term ()
-> $$ = nterm terms ()
Stack now 0 2 65
Entering state 292
Reading a token: Next token is token tIDENTIFIER ()
Shifting token tIDENTIFIER ()
Entering state 35
Reading a token: Next token is token tIDENTIFIER ()
Reducing stack by rule 547 (line 4816):
$1 = token tIDENTIFIER ()
-> $$ = nterm operation ()
Stack now 0 2 65 292
Entering state 110
Next token is token tIDENTIFIER ()
Reducing stack by rule 258 (line 2499):
-> $$ = nterm @7 ()
Stack now 0 2 65 292 110
Entering state 219
Next token is token tIDENTIFIER ()
Shifting token tIDENTIFIER ()
Entering state 35
Reading a token: Next token is token ‘\n’ ()
Reducing stack by rule 474 (line 4275):
$1 = token tIDENTIFIER ()
-> $$ = nterm user_variable ()
Stack now 0 2 65 292 110 219
Entering state 209
Next token is token ‘\n’ ()
Reducing stack by rule 486 (line 4291):
$1 = nterm user_variable ()
-> $$ = nterm var_ref ()
Stack now 0 2 65 292 110 219
Entering state 107
Reducing stack by rule 276 (line 2622):
$1 = nterm var_ref ()
-> $$ = nterm primary ()
Stack now 0 2 65 292 110 219
Entering state 80
Next token is token ‘\n’ ()
Reducing stack by rule 239 (line 2375):
$1 = nterm primary ()
-> $$ = nterm arg ()
Stack now 0 2 65 292 110 219
Entering state 203
Next token is token ‘\n’ ()
Reducing stack by rule 240 (line 2381):
$1 = nterm arg ()
-> $$ = nterm arg_value ()
Stack now 0 2 65 292 110 219
Entering state 204
Next token is token ‘\n’ ()
Reducing stack by rule 263 (line 2531):
$1 = nterm arg_value ()
-> $$ = nterm args ()
Stack now 0 2 65 292 110 219
Entering state 207
Next token is token ‘\n’ ()
Reducing stack by rule 572 (line 4872):
-> $$ = nterm none ()
Stack now 0 2 65 292 110 219 207
Entering state 398
Reducing stack by rule 262 (line 2525):
$1 = nterm none ()
-> $$ = nterm opt_block_arg ()
Stack now 0 2 65 292 110 219 207
Entering state 397
Reducing stack by rule 254 (line 2463):
$1 = nterm args ()
$2 = nterm opt_block_arg ()
-> $$ = nterm call_args ()
Stack now 0 2 65 292 110 219
Entering state 409
Reducing stack by rule 259 (line 2499):
$1 = nterm @7 ()
$2 = nterm call_args ()
-> $$ = nterm command_args ()
Stack now 0 2 65 292 110
Entering state 387
Next token is token ‘\n’ ()
Reducing stack by rule 58 (line 1344):
$1 = nterm operation ()
$2 = nterm command_args ()
-> $$ = nterm command ()
Stack now 0 2 65 292
Entering state 72
Next token is token ‘\n’ ()
Reducing stack by rule 51 (line 1297):
$1 = nterm command ()
-> $$ = nterm command_call ()
Stack now 0 2 65 292
Entering state 70
Reducing stack by rule 44 (line 1249):
$1 = nterm command_call ()
-> $$ = nterm expr ()
Stack now 0 2 65 292
Entering state 69
Next token is token ‘\n’ ()
Reducing stack by rule 41 (line 1225):
$1 = nterm expr ()
-> $$ = nterm stmt ()
Stack now 0 2 65 292
Entering state 67
Next token is token ‘\n’ ()
Reducing stack by rule 8 (line 855):
$1 = nterm stmt ()
-> $$ = nterm top_stmt ()
Stack now 0 2 65 292
Entering state 475
Reducing stack by rule 6 (line 841):
$1 = nterm top_stmts ()
$2 = nterm terms ()
$3 = nterm top_stmt ()
-> $$ = nterm top_stmts ()
Stack now 0 2
Entering state 65
Next token is token ‘\n’ ()
Shifting token ‘\n’ ()
Entering state 289
Reducing stack by rule 569 (line 4864):
$1 = token ‘\n’ ()
-> $$ = nterm term ()
Stack now 0 2 65
Entering state 291
Reducing stack by rule 570 (line 4867):
$1 = nterm term ()
-> $$ = nterm terms ()
Stack now 0 2 65
Entering state 292
Reading a token: Now at end of input.
Reducing stack by rule 560 (line 4845):
$1 = nterm terms ()
-> $$ = nterm opt_terms ()
Stack now 0 2 65
Entering state 290
Reducing stack by rule 3 (line 813):
$1 = nterm top_stmts ()
$2 = nterm opt_terms ()
-> $$ = nterm top_compstmt ()
Stack now 0 2
Entering state 64
Reducing stack by rule 2 (line 782):
$1 = nterm $@1 ()
$2 = nterm top_compstmt ()
-> $$ = nterm program ()
Stack now 0
Entering state 1
Now at end of input.
Shifting token $end ()
Entering state 3
Stack now 0 1 3
Cleanup: popping token $end ()
Cleanup: popping nterm program ()