ruby -y lex4.rb

lex4.out

[mechanic@dwave-laptop learning_ruby]$ ruby lex4.rb 
10.times do |n|
  puts n
end
[[[1, 0], :on_int, "10"],
 [[1, 2], :on_period, "."],
 [[1, 3], :on_ident, "times"],
 [[1, 8], :on_sp, " "],
 [[1, 9], :on_kw, "do"],
 [[1, 11], :on_sp, " "],
 [[1, 12], :on_op, "|"],
 [[1, 13], :on_ident, "n"],
 [[1, 14], :on_op, "|"],
 [[1, 15], :on_ignored_nl, "\n"],
 [[2, 0], :on_sp, "  "],
 [[2, 2], :on_ident, "puts"],
 [[2, 6], :on_sp, " "],
 [[2, 7], :on_ident, "n"],
 [[2, 8], :on_nl, "\n"],
 [[3, 0], :on_kw, "end"],
 [[3, 3], :on_nl, "\n"]]
[mechanic@dwave-laptop learning_ruby]$ ruby -y lex4.rb 
Starting parse
Entering state 0
Reducing stack by rule 1 (line 903):
-> $$ = 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 tSTRING_BEG ()                                          
Reducing stack by rule 605 (line 5103):                                                      
   $1 = token tIDENTIFIER ()                                                                 
-> $$ = nterm operation ()                                                                   
Stack now 0 2                                                                                
Entering state 118                                                                           
Reducing stack by rule 59 (line 1410):                                                       
   $1 = nterm operation ()                                                                   
-> $$ = nterm fcall ()                                                                       
Stack now 0 2                                                                                
Entering state 76                                                                            
Next token is token tSTRING_BEG ()                                                           
Reducing stack by rule 262 (line 2506):                                                      
-> $$ = nterm @10 ()                                                                         
Stack now 0 2 76                                                                             
Entering state 230                                                                           
Next token is token tSTRING_BEG ()                                                           
Shifting token tSTRING_BEG ()                                                                
Entering state 210                                                                           
Reducing stack by rule 479 (line 4209):                                                      
-> $$ = nterm string_contents ()                                                             
Stack now 0 2 76 230 210
Entering state 413
Reading a token: Next token is token tSTRING_CONTENT ()
Shifting token tSTRING_CONTENT ()
Entering state 476
Reducing stack by rule 485 (line 4293):
   $1 = token tSTRING_CONTENT ()
-> $$ = nterm string_content ()
Stack now 0 2 76 230 210 413
Entering state 482
Reducing stack by rule 480 (line 4216):
   $1 = nterm string_contents ()
   $2 = nterm string_content ()
-> $$ = nterm string_contents ()
Stack now 0 2 76 230 210
Entering state 413
Reading a token: Next token is token tSTRING_END ()
Shifting token tSTRING_END ()
Entering state 481
Reducing stack by rule 458 (line 3915):
   $1 = token tSTRING_BEG ()
   $2 = nterm string_contents ()
   $3 = token tSTRING_END ()
-> $$ = nterm string1 ()
Stack now 0 2 76 230
Entering state 102
Reducing stack by rule 456 (line 3904):
   $1 = nterm string1 ()
-> $$ = nterm string ()
Stack now 0 2 76 230
Entering state 101
Reading a token: Next token is token '\n' ()
Reducing stack by rule 454 (line 3886):
   $1 = nterm string ()
-> $$ = nterm strings ()
Stack now 0 2 76 230
Entering state 100
Reducing stack by rule 277 (line 2628):
   $1 = nterm strings ()
-> $$ = nterm primary ()
Stack now 0 2 76 230
Entering state 85
Next token is token '\n' ()
Reducing stack by rule 243 (line 2382):
   $1 = nterm primary ()
-> $$ = nterm arg ()
Stack now 0 2 76 230
Entering state 214
Next token is token '\n' ()
Reducing stack by rule 244 (line 2388):
   $1 = nterm arg ()
-> $$ = nterm arg_value ()
Stack now 0 2 76 230
Entering state 215
Next token is token '\n' ()
Reducing stack by rule 267 (line 2538):
   $1 = nterm arg_value ()
-> $$ = nterm args ()
Stack now 0 2 76 230
Entering state 218
Next token is token '\n' ()
Reducing stack by rule 630 (line 5159):
-> $$ = nterm none ()
Stack now 0 2 76 230 218
Entering state 418
Reducing stack by rule 266 (line 2532):
   $1 = nterm none ()
-> $$ = nterm opt_block_arg ()
Stack now 0 2 76 230 218
Entering state 417
Reducing stack by rule 258 (line 2470):
   $1 = nterm args ()
   $2 = nterm opt_block_arg ()
-> $$ = nterm call_args ()
Stack now 0 2 76 230
Entering state 429
Reducing stack by rule 263 (line 2506):
   $1 = nterm @10 ()
   $2 = nterm call_args ()
-> $$ = nterm command_args ()
Stack now 0 2 76
Entering state 320
Next token is token '\n' ()
Reducing stack by rule 60 (line 1420):
   $1 = nterm fcall ()
   $2 = nterm command_args ()
-> $$ = nterm command ()
Stack now 0 2
Entering state 77
Next token is token '\n' ()
Reducing stack by rule 53 (line 1372):
   $1 = nterm command ()
-> $$ = nterm command_call ()
Stack now 0 2
Entering state 74
Reducing stack by rule 46 (line 1324):
   $1 = nterm command_call ()
-> $$ = nterm expr ()
Stack now 0 2
Entering state 73
Next token is token '\n' ()
Reducing stack by rule 43 (line 1300):
   $1 = nterm expr ()
-> $$ = nterm stmt ()
Stack now 0 2
Entering state 71
Next token is token '\n' ()
Reducing stack by rule 8 (line 976):
   $1 = nterm stmt ()
-> $$ = nterm top_stmt ()
Stack now 0 2
Entering state 70
Reducing stack by rule 5 (line 954):
   $1 = nterm top_stmt ()
-> $$ = nterm top_stmts ()
Stack now 0 2
Entering state 69
Next token is token '\n' ()
Shifting token '\n' ()
Entering state 306
Reducing stack by rule 627 (line 5151):
   $1 = token '\n' ()
-> $$ = nterm term ()
Stack now 0 2 69
Entering state 308
Reducing stack by rule 628 (line 5154):
   $1 = nterm term ()
-> $$ = nterm terms ()
Stack now 0 2 69
Entering state 309
Reading a token: Next token is token tIDENTIFIER ()
Shifting token tIDENTIFIER ()
Entering state 35
Reading a token: Next token is token tSTRING_BEG ()
Reducing stack by rule 605 (line 5103):
   $1 = token tIDENTIFIER ()
-> $$ = nterm operation ()
Stack now 0 2 69 309
Entering state 118
Reducing stack by rule 59 (line 1410):
   $1 = nterm operation ()
-> $$ = nterm fcall ()
Stack now 0 2 69 309
Entering state 76
Next token is token tSTRING_BEG ()
Reducing stack by rule 262 (line 2506):
-> $$ = nterm @10 ()
Stack now 0 2 69 309 76
Entering state 230
Next token is token tSTRING_BEG ()
Shifting token tSTRING_BEG ()
Entering state 210
Reducing stack by rule 479 (line 4209):
-> $$ = nterm string_contents ()
Stack now 0 2 69 309 76 230 210
Entering state 413
Reading a token: Next token is token tSTRING_CONTENT ()
Shifting token tSTRING_CONTENT ()
Entering state 476
Reducing stack by rule 485 (line 4293):
   $1 = token tSTRING_CONTENT ()
-> $$ = nterm string_content ()
Stack now 0 2 69 309 76 230 210 413
Entering state 482
Reducing stack by rule 480 (line 4216):
   $1 = nterm string_contents ()
   $2 = nterm string_content ()
-> $$ = nterm string_contents ()
Stack now 0 2 69 309 76 230 210
Entering state 413
Reading a token: Next token is token tSTRING_END ()
Shifting token tSTRING_END ()
Entering state 481
Reducing stack by rule 458 (line 3915):
   $1 = token tSTRING_BEG ()
   $2 = nterm string_contents ()
   $3 = token tSTRING_END ()
-> $$ = nterm string1 ()
Stack now 0 2 69 309 76 230
Entering state 102
Reducing stack by rule 456 (line 3904):
   $1 = nterm string1 ()
-> $$ = nterm string ()
Stack now 0 2 69 309 76 230
Entering state 101
Reading a token: Next token is token '\n' ()
Reducing stack by rule 454 (line 3886):
   $1 = nterm string ()
-> $$ = nterm strings ()
Stack now 0 2 69 309 76 230
Entering state 100
Reducing stack by rule 277 (line 2628):
   $1 = nterm strings ()
-> $$ = nterm primary ()
Stack now 0 2 69 309 76 230
Entering state 85
Next token is token '\n' ()
Reducing stack by rule 243 (line 2382):
   $1 = nterm primary ()
-> $$ = nterm arg ()
Stack now 0 2 69 309 76 230
Entering state 214
Next token is token '\n' ()
Reducing stack by rule 244 (line 2388):
   $1 = nterm arg ()
-> $$ = nterm arg_value ()
Stack now 0 2 69 309 76 230
Entering state 215
Next token is token '\n' ()
Reducing stack by rule 267 (line 2538):
   $1 = nterm arg_value ()
-> $$ = nterm args ()
Stack now 0 2 69 309 76 230
Entering state 218
Next token is token '\n' ()
Reducing stack by rule 630 (line 5159):
-> $$ = nterm none ()
Stack now 0 2 69 309 76 230 218
Entering state 418
Reducing stack by rule 266 (line 2532):
   $1 = nterm none ()
-> $$ = nterm opt_block_arg ()
Stack now 0 2 69 309 76 230 218
Entering state 417
Reducing stack by rule 258 (line 2470):
   $1 = nterm args ()
   $2 = nterm opt_block_arg ()
-> $$ = nterm call_args ()
Stack now 0 2 69 309 76 230
Entering state 429
Reducing stack by rule 263 (line 2506):
   $1 = nterm @10 ()
   $2 = nterm call_args ()
-> $$ = nterm command_args ()
Stack now 0 2 69 309 76
Entering state 320
Next token is token '\n' ()
Reducing stack by rule 60 (line 1420):
   $1 = nterm fcall ()
   $2 = nterm command_args ()
-> $$ = nterm command ()
Stack now 0 2 69 309
Entering state 77
Next token is token '\n' ()
Reducing stack by rule 53 (line 1372):
   $1 = nterm command ()
-> $$ = nterm command_call ()
Stack now 0 2 69 309
Entering state 74
Reducing stack by rule 46 (line 1324):
   $1 = nterm command_call ()
-> $$ = nterm expr ()
Stack now 0 2 69 309
Entering state 73
Next token is token '\n' ()
Reducing stack by rule 43 (line 1300):
   $1 = nterm expr ()
-> $$ = nterm stmt ()
Stack now 0 2 69 309
Entering state 71
Next token is token '\n' ()
Reducing stack by rule 8 (line 976):
   $1 = nterm stmt ()
-> $$ = nterm top_stmt ()
Stack now 0 2 69 309
Entering state 501
Reducing stack by rule 6 (line 962):
   $1 = nterm top_stmts ()
   $2 = nterm terms ()
   $3 = nterm top_stmt ()
-> $$ = nterm top_stmts ()
Stack now 0 2
Entering state 69
Next token is token '\n' ()
Shifting token '\n' ()
Entering state 306
Reducing stack by rule 627 (line 5151):
   $1 = token '\n' ()
-> $$ = nterm term ()
Stack now 0 2 69
Entering state 308
Reducing stack by rule 628 (line 5154):
   $1 = nterm term ()
-> $$ = nterm terms ()
Stack now 0 2 69
Entering state 309
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 509 (line 4417):
   $1 = token tIDENTIFIER ()
-> $$ = nterm user_variable ()
Stack now 0 2 69 309
Entering state 113
Next token is token '=' ()
Reducing stack by rule 100 (line 1764):
   $1 = nterm user_variable ()
-> $$ = nterm lhs ()
Stack now 0 2 69 309
Entering state 83
Next token is token '=' ()
Shifting token '=' ()
Entering state 329
Reading a token: Next token is token tSTRING_BEG ()
Shifting token tSTRING_BEG ()
Entering state 58
Reducing stack by rule 479 (line 4209):
-> $$ = nterm string_contents ()
Stack now 0 2 69 309 83 329 58
Entering state 290
Reading a token: Next token is token tSTRING_CONTENT ()
Shifting token tSTRING_CONTENT ()
Entering state 476
Reducing stack by rule 485 (line 4293):
   $1 = token tSTRING_CONTENT ()
-> $$ = nterm string_content ()
Stack now 0 2 69 309 83 329 58 290
Entering state 482
Reducing stack by rule 480 (line 4216):
   $1 = nterm string_contents ()
   $2 = nterm string_content ()
-> $$ = nterm string_contents ()
Stack now 0 2 69 309 83 329 58
Entering state 290
Reading a token: Next token is token tSTRING_END ()
Shifting token tSTRING_END ()
Entering state 481
Reducing stack by rule 458 (line 3915):
   $1 = token tSTRING_BEG ()
   $2 = nterm string_contents ()
   $3 = token tSTRING_END ()
-> $$ = nterm string1 ()
Stack now 0 2 69 309 83 329
Entering state 102
Reducing stack by rule 456 (line 3904):
   $1 = nterm string1 ()
-> $$ = nterm string ()
Stack now 0 2 69 309 83 329
Entering state 101
Reading a token: Next token is token '\n' ()
Reducing stack by rule 454 (line 3886):
   $1 = nterm string ()
-> $$ = nterm strings ()
Stack now 0 2 69 309 83 329
Entering state 100
Reducing stack by rule 277 (line 2628):
   $1 = nterm strings ()
-> $$ = nterm primary ()
Stack now 0 2 69 309 83 329
Entering state 85
Next token is token '\n' ()
Reducing stack by rule 243 (line 2382):
   $1 = nterm primary ()
-> $$ = nterm arg ()
Stack now 0 2 69 309 83 329
Entering state 527
Next token is token '\n' ()
Reducing stack by rule 197 (line 1990):
   $1 = nterm lhs ()
   $2 = token '=' ()
   $3 = nterm arg ()
-> $$ = nterm arg ()
Stack now 0 2 69 309
Entering state 84
Next token is token '\n' ()
Reducing stack by rule 51 (line 1357):
   $1 = nterm arg ()
-> $$ = nterm expr ()
Stack now 0 2 69 309
Entering state 73
Next token is token '\n' ()
Reducing stack by rule 43 (line 1300):
   $1 = nterm expr ()
-> $$ = nterm stmt ()
Stack now 0 2 69 309
Entering state 71
Next token is token '\n' ()
Reducing stack by rule 8 (line 976):
   $1 = nterm stmt ()
-> $$ = nterm top_stmt ()
Stack now 0 2 69 309
Entering state 501
Reducing stack by rule 6 (line 962):
   $1 = nterm top_stmts ()
   $2 = nterm terms ()
   $3 = nterm top_stmt ()
-> $$ = nterm top_stmts ()
Stack now 0 2
Entering state 69
Next token is token '\n' ()
Shifting token '\n' ()
Entering state 306
Reducing stack by rule 627 (line 5151):
   $1 = token '\n' ()
-> $$ = nterm term ()
Stack now 0 2 69
Entering state 308
Reducing stack by rule 628 (line 5154):
   $1 = nterm term ()
-> $$ = nterm terms ()
Stack now 0 2 69
Entering state 309
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 605 (line 5103):
   $1 = token tIDENTIFIER ()
-> $$ = nterm operation ()
Stack now 0 2 69 309
Entering state 118
Reducing stack by rule 59 (line 1410):
   $1 = nterm operation ()
-> $$ = nterm fcall ()
Stack now 0 2 69 309
Entering state 76
Next token is token tIDENTIFIER ()
Reducing stack by rule 262 (line 2506):
-> $$ = nterm @10 ()
Stack now 0 2 69 309 76
Entering state 230
Next token is token tIDENTIFIER ()
Shifting token tIDENTIFIER ()
Entering state 35
Reading a token: Next token is token '\n' ()
Reducing stack by rule 509 (line 4417):
   $1 = token tIDENTIFIER ()
-> $$ = nterm user_variable ()
Stack now 0 2 69 309 76 230
Entering state 220
Next token is token '\n' ()
Reducing stack by rule 521 (line 4433):
   $1 = nterm user_variable ()
-> $$ = nterm var_ref ()
Stack now 0 2 69 309 76 230
Entering state 115
Reducing stack by rule 284 (line 2635):
   $1 = nterm var_ref ()
-> $$ = nterm primary ()
Stack now 0 2 69 309 76 230
Entering state 85
Next token is token '\n' ()
Reducing stack by rule 243 (line 2382):
   $1 = nterm primary ()
-> $$ = nterm arg ()
Stack now 0 2 69 309 76 230
Entering state 214
Next token is token '\n' ()
Reducing stack by rule 244 (line 2388):
   $1 = nterm arg ()
-> $$ = nterm arg_value ()
Stack now 0 2 69 309 76 230
Entering state 215
Next token is token '\n' ()
Reducing stack by rule 267 (line 2538):
   $1 = nterm arg_value ()
-> $$ = nterm args ()
Stack now 0 2 69 309 76 230
Entering state 218
Next token is token '\n' ()
Reducing stack by rule 630 (line 5159):
-> $$ = nterm none ()
Stack now 0 2 69 309 76 230 218
Entering state 418
Reducing stack by rule 266 (line 2532):
   $1 = nterm none ()
-> $$ = nterm opt_block_arg ()
Stack now 0 2 69 309 76 230 218
Entering state 417
Reducing stack by rule 258 (line 2470):
   $1 = nterm args ()
   $2 = nterm opt_block_arg ()
-> $$ = nterm call_args ()
Stack now 0 2 69 309 76 230
Entering state 429
Reducing stack by rule 263 (line 2506):
   $1 = nterm @10 ()
   $2 = nterm call_args ()
-> $$ = nterm command_args ()
Stack now 0 2 69 309 76
Entering state 320
Next token is token '\n' ()
Reducing stack by rule 60 (line 1420):
   $1 = nterm fcall ()
   $2 = nterm command_args ()
-> $$ = nterm command ()
Stack now 0 2 69 309
Entering state 77
Next token is token '\n' ()
Reducing stack by rule 53 (line 1372):
   $1 = nterm command ()
-> $$ = nterm command_call ()
Stack now 0 2 69 309
Entering state 74
Reducing stack by rule 46 (line 1324):
   $1 = nterm command_call ()
-> $$ = nterm expr ()
Stack now 0 2 69 309
Entering state 73
Next token is token '\n' ()
Reducing stack by rule 43 (line 1300):
   $1 = nterm expr ()
-> $$ = nterm stmt ()
Stack now 0 2 69 309
Entering state 71
Next token is token '\n' ()
Reducing stack by rule 8 (line 976):
   $1 = nterm stmt ()
-> $$ = nterm top_stmt ()
Stack now 0 2 69 309
Entering state 501
Reducing stack by rule 6 (line 962):
   $1 = nterm top_stmts ()
   $2 = nterm terms ()
   $3 = nterm top_stmt ()
-> $$ = nterm top_stmts ()
Stack now 0 2
Entering state 69
Next token is token '\n' ()
Shifting token '\n' ()
Entering state 306
Reducing stack by rule 627 (line 5151):
   $1 = token '\n' ()
-> $$ = nterm term ()
Stack now 0 2 69
Entering state 308
Reducing stack by rule 628 (line 5154):
   $1 = nterm term ()
-> $$ = nterm terms ()
Stack now 0 2 69
Entering state 309
Reading a token: Next token is token tIDENTIFIER ()
Shifting token tIDENTIFIER ()
Entering state 35
Reading a token: Next token is token tCONSTANT ()
Reducing stack by rule 605 (line 5103):
   $1 = token tIDENTIFIER ()
-> $$ = nterm operation ()
Stack now 0 2 69 309
Entering state 118
Reducing stack by rule 59 (line 1410):
   $1 = nterm operation ()
-> $$ = nterm fcall ()
Stack now 0 2 69 309
Entering state 76
Next token is token tCONSTANT ()
Reducing stack by rule 262 (line 2506):
-> $$ = nterm @10 ()
Stack now 0 2 69 309 76
Entering state 230
Next token is token tCONSTANT ()
Shifting token tCONSTANT ()
Entering state 39
Reading a token: Next token is token '.' ()
Reducing stack by rule 512 (line 4420):
   $1 = token tCONSTANT ()
-> $$ = nterm user_variable ()
Stack now 0 2 69 309 76 230
Entering state 220
Next token is token '.' ()
Reducing stack by rule 521 (line 4433):
   $1 = nterm user_variable ()
-> $$ = nterm var_ref ()
Stack now 0 2 69 309 76 230
Entering state 115
Reducing stack by rule 284 (line 2635):
   $1 = nterm var_ref ()
-> $$ = nterm primary ()
Stack now 0 2 69 309 76 230
Entering state 85
Next token is token '.' ()
Reducing stack by rule 340 (line 3100):
   $1 = nterm primary ()
-> $$ = nterm primary_value ()
Stack now 0 2 69 309 76 230
Entering state 219
Next token is token '.' ()
Shifting token '.' ()
Entering state 421
Reading a token: Next token is token tIDENTIFIER ()
Shifting token tIDENTIFIER ()
Entering state 619
Reading a token: Next token is token '(' ()
Reducing stack by rule 608 (line 5108):
   $1 = token tIDENTIFIER ()
-> $$ = nterm operation2 ()
Stack now 0 2 69 309 76 230 219 421
Entering state 569
Next token is token '(' ()
Reducing stack by rule 423 (line 3656):
-> $$ = nterm @33 ()
Stack now 0 2 69 309 76 230 219 421 569
Entering state 716
Next token is token '(' ()
Shifting token '(' ()
Entering state 231
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 509 (line 4417):
   $1 = token tIDENTIFIER ()
-> $$ = nterm user_variable ()
Stack now 0 2 69 309 76 230 219 421 569 716 231
Entering state 220
Next token is token ')' ()
Reducing stack by rule 521 (line 4433):
   $1 = nterm user_variable ()
-> $$ = nterm var_ref ()
Stack now 0 2 69 309 76 230 219 421 569 716 231
Entering state 115
Reducing stack by rule 284 (line 2635):
   $1 = nterm var_ref ()
-> $$ = nterm primary ()
Stack now 0 2 69 309 76 230 219 421 569 716 231
Entering state 85
Next token is token ')' ()
Reducing stack by rule 243 (line 2382):
   $1 = nterm primary ()
-> $$ = nterm arg ()
Stack now 0 2 69 309 76 230 219 421 569 716 231
Entering state 214
Next token is token ')' ()
Reducing stack by rule 244 (line 2388):
   $1 = nterm arg ()
-> $$ = nterm arg_value ()
Stack now 0 2 69 309 76 230 219 421 569 716 231
Entering state 215
Next token is token ')' ()
Reducing stack by rule 267 (line 2538):
   $1 = nterm arg_value ()
-> $$ = nterm args ()
Stack now 0 2 69 309 76 230 219 421 569 716 231
Entering state 432
Next token is token ')' ()
Reducing stack by rule 630 (line 5159):
-> $$ = nterm none ()
Stack now 0 2 69 309 76 230 219 421 569 716 231 432
Entering state 418
Reducing stack by rule 266 (line 2532):
   $1 = nterm none ()
-> $$ = nterm opt_block_arg ()
Stack now 0 2 69 309 76 230 219 421 569 716 231 432
Entering state 417
Reducing stack by rule 258 (line 2470):
   $1 = nterm args ()
   $2 = nterm opt_block_arg ()
-> $$ = nterm call_args ()
Stack now 0 2 69 309 76 230 219 421 569 716 231
Entering state 431
Reducing stack by rule 253 (line 2438):
   $1 = nterm call_args ()
-> $$ = nterm opt_call_args ()
Stack now 0 2 69 309 76 230 219 421 569 716 231
Entering state 430
Next token is token ')' ()
Reducing stack by rule 619 (line 5135):
-> $$ = nterm opt_nl ()
Stack now 0 2 69 309 76 230 219 421 569 716 231 430
Entering state 427
Next token is token ')' ()
Shifting token ')' ()
Entering state 623
Reducing stack by rule 621 (line 5139):
   $1 = nterm opt_nl ()
   $2 = token ')' ()
-> $$ = nterm rparen ()
Stack now 0 2 69 309 76 230 219 421 569 716 231 430
Entering state 624
Reducing stack by rule 249 (line 2423):
   $1 = token '(' ()
   $2 = nterm opt_call_args ()
   $3 = nterm rparen ()
-> $$ = nterm paren_args ()
Stack now 0 2 69 309 76 230 219 421 569 716
Entering state 752
Reducing stack by rule 251 (line 2434):
   $1 = nterm paren_args ()
-> $$ = nterm opt_paren_args ()
Stack now 0 2 69 309 76 230 219 421 569 716
Entering state 840
Reducing stack by rule 424 (line 3655):
   $1 = nterm primary_value ()
   $2 = token '.' ()
   $3 = nterm operation2 ()
   $4 = nterm @33 ()
   $5 = nterm opt_paren_args ()
-> $$ = nterm method_call ()
Stack now 0 2 69 309 76 230
Entering state 98
Reading a token: Next token is token '\n' ()
Reducing stack by rule 308 (line 2807):
   $1 = nterm method_call ()
-> $$ = nterm primary ()
Stack now 0 2 69 309 76 230
Entering state 85
Next token is token '\n' ()
Reducing stack by rule 243 (line 2382):
   $1 = nterm primary ()
-> $$ = nterm arg ()
Stack now 0 2 69 309 76 230
Entering state 214
Next token is token '\n' ()
Reducing stack by rule 244 (line 2388):
   $1 = nterm arg ()
-> $$ = nterm arg_value ()
Stack now 0 2 69 309 76 230
Entering state 215
Next token is token '\n' ()
Reducing stack by rule 267 (line 2538):
   $1 = nterm arg_value ()
-> $$ = nterm args ()
Stack now 0 2 69 309 76 230
Entering state 218
Next token is token '\n' ()
Reducing stack by rule 630 (line 5159):
-> $$ = nterm none ()
Stack now 0 2 69 309 76 230 218
Entering state 418
Reducing stack by rule 266 (line 2532):
   $1 = nterm none ()
-> $$ = nterm opt_block_arg ()
Stack now 0 2 69 309 76 230 218
Entering state 417
Reducing stack by rule 258 (line 2470):
   $1 = nterm args ()
   $2 = nterm opt_block_arg ()
-> $$ = nterm call_args ()
Stack now 0 2 69 309 76 230
Entering state 429
Reducing stack by rule 263 (line 2506):
   $1 = nterm @10 ()
   $2 = nterm call_args ()
-> $$ = nterm command_args ()
Stack now 0 2 69 309 76
Entering state 320
Next token is token '\n' ()
Reducing stack by rule 60 (line 1420):
   $1 = nterm fcall ()
   $2 = nterm command_args ()
-> $$ = nterm command ()
Stack now 0 2 69 309
Entering state 77
Next token is token '\n' ()
Reducing stack by rule 53 (line 1372):
   $1 = nterm command ()
-> $$ = nterm command_call ()
Stack now 0 2 69 309
Entering state 74
Reducing stack by rule 46 (line 1324):
   $1 = nterm command_call ()
-> $$ = nterm expr ()
Stack now 0 2 69 309
Entering state 73
Next token is token '\n' ()
Reducing stack by rule 43 (line 1300):
   $1 = nterm expr ()
-> $$ = nterm stmt ()
Stack now 0 2 69 309
Entering state 71
Next token is token '\n' ()
Reducing stack by rule 8 (line 976):
   $1 = nterm stmt ()
-> $$ = nterm top_stmt ()
Stack now 0 2 69 309
Entering state 501
Reducing stack by rule 6 (line 962):
   $1 = nterm top_stmts ()
   $2 = nterm terms ()
   $3 = nterm top_stmt ()
-> $$ = nterm top_stmts ()
Stack now 0 2
Entering state 69
Next token is token '\n' ()
Shifting token '\n' ()
Entering state 306
Reducing stack by rule 627 (line 5151):
   $1 = token '\n' ()
-> $$ = nterm term ()
Stack now 0 2 69
Entering state 308
Reducing stack by rule 628 (line 5154):
   $1 = nterm term ()
-> $$ = nterm terms ()
Stack now 0 2 69
Entering state 309
Reading a token: Now at end of input.
Reducing stack by rule 618 (line 5132):
   $1 = nterm terms ()
-> $$ = nterm opt_terms ()
Stack now 0 2 69
Entering state 307
Reducing stack by rule 3 (line 934):
   $1 = nterm top_stmts ()
   $2 = nterm opt_terms ()
-> $$ = nterm top_compstmt ()
Stack now 0 2
Entering state 68
Reducing stack by rule 2 (line 903):
   $1 = nterm $@1 ()
   $2 = nterm top_compstmt ()
-> $$ = nterm program ()
Stack now 0
Entering state 1
Now at end of input.
Shifting token "end-of-input" ()
Entering state 3
Stack now 0 1 3
Cleanup: popping token "end-of-input" ()
Cleanup: popping nterm program ()