sportdb-parser 0.7.0 → 0.7.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: f227e5b41ea4ddd20904f5a582756eca266ce645d4a0c0c520b0297b996fbd80
-  data.tar.gz: 0e61ae4e7c8057825d41cf3e17baddd14f6413d19457ef390ff89d222b186e2d
+  metadata.gz: 17e2ccd1472c3f56b5c1f4f4374e66de6b5297c67a5a0fa86206489ac560a00e
+  data.tar.gz: 1c6de22e1c9dda2cc2a0b75654737882b7ce4c7e9f191b61889887c844fc35b9
 SHA512:
-  metadata.gz: e52ba0276a0e9d656b051dc23ad9237d76fa0b6f699627cfcc0d7b55ac87b990ac267065139e73d5bf4abc446a6d87dc0362c7f65d0c9134610f47f71a524d3e
-  data.tar.gz: 57b9b5a2218054ce8a7f698def21e931c90bc1737bfc364fa8e21c948f4bdc6090eff86c633f24f41687c25a30dce15483dfda63a7f175ddd019a8b908a6cac4
+  metadata.gz: ac121460004ce5f4287668ea8753feee5729124a265474bfcf065775ffd099a5f867109fc16b2d8d46b6ee7a327bdc8b4c14539f22d1ef43ee285f457097eae0
+  data.tar.gz: 340afd868ceceeaa31532ea89251d5bfa2874f649933a18124bb4a5ba28e837c3a59284144d376f17c125ca93c12436cc473c7fda94a3b72866960fdc2c9cba8

data/CHANGELOG.md

@@ -1,4 +1,4 @@
-### 0.7.0
+### 0.7.1
 ### 0.0.1 / 2024-07-12
 
 * Everything is new. First release.

data/Manifest.txt

@@ -8,6 +8,7 @@ lib/sportdb/parser/lexer.rb
 lib/sportdb/parser/lexer_buffer.rb
 lib/sportdb/parser/lexer_tty.rb
 lib/sportdb/parser/parser.rb
+lib/sportdb/parser/parser_runtime.rb
 lib/sportdb/parser/racc_parser.rb
 lib/sportdb/parser/racc_tree.rb
 lib/sportdb/parser/token-date.rb

data/Rakefile

@@ -22,7 +22,6 @@ Hoe.spec 'sportdb-parser' do
 
   self.extra_deps = [
        ['cocos', '>= 0.4.1'],
-       ['racc'],   ## maybe inline runtime later if possible - why? why not?
   ]
 
   self.spec_extras = {

data/lib/sportdb/parser/parser.rb

@@ -4,7 +4,9 @@
 # from Racc grammar file "parser.y".
 #
 
-require 'racc/parser.rb'
+## require 'racc/parser.rb'
+
+
 class RaccMatchParser < Racc::Parser
 ##### State transition tables begin ###
 
@@ -810,7 +812,7 @@ Racc_debug_parser = false
 
 module_eval(<<'.,.,', 'parser.y', 18)
   def _reduce_1(val, _values, result)
-    
+
     result
   end
 .,.,
@@ -857,7 +859,7 @@ module_eval(<<'.,.,', 'parser.y', 18)
 
 module_eval(<<'.,.,', 'parser.y', 57)
   def _reduce_22(val, _values, result)
-                   trace( "REDUCE BLANK" ) 
+                   trace( "REDUCE BLANK" )
                @tree << BlankLine.new
 
     result
@@ -880,7 +882,7 @@ module_eval(<<'.,.,', 'parser.y', 67)
   def _reduce_29(val, _values, result)
      puts "!! skipping invalid content (trying to recover from parse error):"
                 pp val[0]
-                ##  note - do NOT report recover errors for now 
+                ##  note - do NOT report recover errors for now
                 ##  @errors << "parser error (recover) - skipping #{val[0].pretty_inspect}"
 
     result
@@ -973,7 +975,7 @@ module_eval(<<'.,.,', 'parser.y', 108)
 module_eval(<<'.,.,', 'parser.y', 113)
   def _reduce_43(val, _values, result)
      result = val
-                                               ## e.g. val is ["Austria"] 
+                                               ## e.g. val is ["Austria"]
 
     result
   end
@@ -1079,7 +1081,7 @@ module_eval(<<'.,.,', 'parser.y', 176)
 
 module_eval(<<'.,.,', 'parser.y', 189)
   def _reduce_61(val, _values, result)
-                         @tree <<  DateHeader.new( **val[0] )  
+                         @tree <<  DateHeader.new( **val[0] )
 
     result
   end
@@ -1087,8 +1089,8 @@ module_eval(<<'.,.,', 'parser.y', 189)
 
 module_eval(<<'.,.,', 'parser.y', 195)
   def _reduce_62(val, _values, result)
-                         kwargs =  val[0][1]  
-                     @tree <<  DateHeaderLegs.new( **kwargs )                      
+                         kwargs =  val[0][1]
+                     @tree <<  DateHeaderLegs.new( **kwargs )
 
     result
   end
@@ -1105,9 +1107,9 @@ module_eval(<<'.,.,', 'parser.y', 195)
 module_eval(<<'.,.,', 'parser.y', 215)
   def _reduce_67(val, _values, result)
                          ## note - header flag (header: true)
-                     ##    used downstream for scope / e.g. DateHeader merge/inheritance or such                     
+                     ##    used downstream for scope / e.g. DateHeader merge/inheritance or such
                       kwargs = { header: true }.merge( val[0], val[2] )
-                      @tree << MatchLine.new( **kwargs )  
+                      @tree << MatchLine.new( **kwargs )
 
     result
   end
@@ -1147,7 +1149,7 @@ module_eval(<<'.,.,', 'parser.y', 243)
 
 module_eval(<<'.,.,', 'parser.y', 256)
   def _reduce_73(val, _values, result)
-                          result = {}.merge( val[0], val[1], val[2] ) 
+                          result = {}.merge( val[0], val[1], val[2] )
 
     result
   end
@@ -1155,7 +1157,7 @@ module_eval(<<'.,.,', 'parser.y', 256)
 
 module_eval(<<'.,.,', 'parser.y', 260)
   def _reduce_74(val, _values, result)
-                          result = {}.merge( val[0], val[1] ) 
+                          result = {}.merge( val[0], val[1] )
 
     result
   end
@@ -1189,7 +1191,7 @@ module_eval(<<'.,.,', 'parser.y', 280)
 module_eval(<<'.,.,', 'parser.y', 292)
   def _reduce_79(val, _values, result)
                           kwargs = { score: val[1][1] }.merge( val[0] )
-                      @tree << MatchLineLegs.new( **kwargs )             
+                      @tree << MatchLineLegs.new( **kwargs )
 
     result
   end
@@ -1248,7 +1250,7 @@ module_eval(<<'.,.,', 'parser.y', 322)
 module_eval(<<'.,.,', 'parser.y', 328)
   def _reduce_86(val, _values, result)
                              kwargs = {}.merge( val[0], val[1] )
-                         @tree << MatchLineBye.new( **kwargs ) 
+                         @tree << MatchLineBye.new( **kwargs )
 
     result
   end
@@ -1269,7 +1271,7 @@ module_eval(<<'.,.,', 'parser.y', 344)
                       @tree << MatchLine.new( **kwargs )
 
                       kwargs = val[2]
-                      @tree << GoalLine.new( **kwargs ) 
+                      @tree << GoalLine.new( **kwargs )
 
     result
   end
@@ -1278,7 +1280,7 @@ module_eval(<<'.,.,', 'parser.y', 344)
 module_eval(<<'.,.,', 'parser.y', 355)
   def _reduce_89(val, _values, result)
                                  kwargs = {}.merge( val[0] )
-                             @tree << MatchLine.new( **kwargs )                           
+                             @tree << MatchLine.new( **kwargs )
 
     result
   end
@@ -1311,7 +1313,7 @@ module_eval(<<'.,.,', 'parser.y', 377)
   def _reduce_93(val, _values, result)
                           puts "status_line:"
                       pp val[0]
-                      result = val[0][1]   
+                      result = val[0][1]
 
     result
   end
@@ -1323,22 +1325,22 @@ module_eval(<<'.,.,', 'parser.y', 390)
                            ## pp val[0]
                            ## pp val[2]
 
-                           ## assume ht/ft  
+                           ## assume ht/ft
                            ## or let's use [[0,1],[1,2]] - why? why not?
                            score_team1 = val[0][1][:score]
                            score_team2 = val[2][1][:score]
 
-  
+
                            score =  [[score_team1[0], score_team2[0]],
-                                     [score_team1[1], score_team2[1]]] 
+                                     [score_team1[1], score_team2[1]]]
 
-                           result = { team1: val[0][1][:team], 
+                           result = { team1: val[0][1][:team],
                                       team2: val[2][1][:team],
                                       score: score
                                     }
 
                            ## puts "  result:"
-                           ## pp result   
+                           ## pp result
 
     result
   end
@@ -1351,15 +1353,15 @@ module_eval(<<'.,.,', 'parser.y', 413)
                            ## or let's use [[0,1],[1,2]] - why? why not?
                            score_team1 = val[0][1][:score]
                            score_team2 = val[2][1][:score]
-  
+
                            score =  { '_': [score_team1[0], score_team2[0]],
-                                      pen: [score_team1[1], score_team2[1]] 
-                                    } 
+                                      pen: [score_team1[1], score_team2[1]]
+                                    }
 
-                           result = { team1: val[0][1][:team], 
+                           result = { team1: val[0][1][:team],
                                       team2: val[2][1][:team],
                                       score: score
-                                    }   
+                                    }
 
     result
   end
@@ -1369,10 +1371,10 @@ module_eval(<<'.,.,', 'parser.y', 430)
   def _reduce_96(val, _values, result)
                                score_team1 = val[0][1][:score]
                            score_team2 = val[2][1][:score]
-  
-                           score =  [score_team1, score_team2] 
 
-                           result = { team1: val[0][1][:team], 
+                           score =  [score_team1, score_team2]
+
+                           result = { team1: val[0][1][:team],
                                       team2: val[2][1][:team],
                                       score: score
                                     }
@@ -1383,7 +1385,7 @@ module_eval(<<'.,.,', 'parser.y', 430)
 
 module_eval(<<'.,.,', 'parser.y', 442)
   def _reduce_97(val, _values, result)
-                               result = { team1: val[0], 
+                               result = { team1: val[0],
                                       team2: val[3],
                                       score: [val[1], val[4]]
                                     }
@@ -1394,15 +1396,15 @@ module_eval(<<'.,.,', 'parser.y', 442)
 
 module_eval(<<'.,.,', 'parser.y', 456)
   def _reduce_98(val, _values, result)
-                               ## assume ht/ft  
+                               ## assume ht/ft
                            ## or let's use [[0,1],[1,2]] - why? why not?
                            score_team1 = val[0][1][:score]
                            score_team2 = val[1][1][:score]
 
                            score =  [[score_team1[0], score_team2[0]],
-                                     [score_team1[1], score_team2[1]]] 
+                                     [score_team1[1], score_team2[1]]]
 
-                           result = { team1: val[0][1][:team], 
+                           result = { team1: val[0][1][:team],
                                       team2: val[1][1][:team],
                                       score: score
                                     }
@@ -1418,15 +1420,15 @@ module_eval(<<'.,.,', 'parser.y', 471)
                            ## or let's use [[0,1],[1,2]] - why? why not?
                            score_team1 = val[0][1][:score]
                            score_team2 = val[1][1][:score]
-  
+
                            score =  { '_': [score_team1[0], score_team2[0]],
-                                      pen: [score_team1[1], score_team2[1]] 
-                                    } 
+                                      pen: [score_team1[1], score_team2[1]]
+                                    }
 
-                           result = { team1: val[0][1][:team], 
+                           result = { team1: val[0][1][:team],
                                       team2: val[1][1][:team],
                                       score: score
-                                    }   
+                                    }
 
     result
   end
@@ -1436,10 +1438,10 @@ module_eval(<<'.,.,', 'parser.y', 488)
   def _reduce_100(val, _values, result)
                                score_team1 = val[0][1][:score]
                            score_team2 = val[1][1][:score]
-  
-                           score =  [score_team1, score_team2] 
 
-                           result = { team1: val[0][1][:team], 
+                           score =  [score_team1, score_team2]
+
+                           result = { team1: val[0][1][:team],
                                       team2: val[1][1][:team],
                                       score: score
                                     }
@@ -1450,7 +1452,7 @@ module_eval(<<'.,.,', 'parser.y', 488)
 
 module_eval(<<'.,.,', 'parser.y', 500)
   def _reduce_101(val, _values, result)
-                               result = { team1: val[0], 
+                               result = { team1: val[0],
                                       team2: val[2],
                                       score: [val[1], val[3]]
                                     }
@@ -1507,7 +1509,7 @@ module_eval(<<'.,.,', 'parser.y', 528)
 
 module_eval(<<'.,.,', 'parser.y', 549)
   def _reduce_111(val, _values, result)
-                          result = {}.merge( val[0][1] ) 
+                          result = {}.merge( val[0][1] )
 
     result
   end
@@ -1515,7 +1517,7 @@ module_eval(<<'.,.,', 'parser.y', 549)
 
 module_eval(<<'.,.,', 'parser.y', 553)
   def _reduce_112(val, _values, result)
-                         result = {}.merge( val[0][1], val[1], val[2] ) 
+                         result = {}.merge( val[0][1], val[1], val[2] )
 
     result
   end
@@ -1523,7 +1525,7 @@ module_eval(<<'.,.,', 'parser.y', 553)
 
 module_eval(<<'.,.,', 'parser.y', 557)
   def _reduce_113(val, _values, result)
-                       result = {}.merge( val[0], val[1], val[2] ) 
+                       result = {}.merge( val[0], val[1], val[2] )
 
     result
   end
@@ -1625,7 +1627,7 @@ module_eval(<<'.,.,', 'parser.y', 626)
   def _reduce_133(val, _values, result)
                                    trace( "RECUDE match_fixture" )
                                result = { team1: val[0],
-                                          team2: val[2] }   
+                                          team2: val[2] }
 
     result
   end
@@ -1639,7 +1641,7 @@ module_eval(<<'.,.,', 'parser.y', 635)
 
                                result = { team1: val[0],
                                           team2: val[2],
-                                          status_inline: 'canceled' }   
+                                          status_inline: 'canceled' }
 
     result
   end
@@ -1649,7 +1651,7 @@ module_eval(<<'.,.,', 'parser.y', 645)
   def _reduce_135(val, _values, result)
                                    result = { team1: val[0],
                                           team2: val[2],
-                                          status_inline: 'canceled' }   
+                                          status_inline: 'canceled' }
 
     result
   end
@@ -1659,7 +1661,7 @@ module_eval(<<'.,.,', 'parser.y', 652)
   def _reduce_136(val, _values, result)
                                    result = { team1: val[0],
                                           team2: val[2],
-                                          status_inline: 'postponed' }   
+                                          status_inline: 'postponed' }
 
     result
   end
@@ -1672,11 +1674,11 @@ module_eval(<<'.,.,', 'parser.y', 652)
 module_eval(<<'.,.,', 'parser.y', 668)
   def _reduce_139(val, _values, result)
                                trace( "REDUCE => match_result : TEAM SCORE TEAM" )
- 
+
                           ## note - use/keep generic score (as array!! NOT hash!!!)
                            result = { team1: val[0], team2: val[2],
                                       score: val[1][1][:score]  ## note - as array e.g. [1,1] !!
-                                    }   
+                                    }
                            ## pp result
 
     result
@@ -1688,7 +1690,7 @@ module_eval(<<'.,.,', 'parser.y', 678)
                                result = { team1: val[0], team2: val[2],
                                       score: val[1][1],
                                       status_inline: 'awarded'
-                                    }                          
+                                    }
 
     result
   end
@@ -1696,9 +1698,9 @@ module_eval(<<'.,.,', 'parser.y', 678)
 
 module_eval(<<'.,.,', 'parser.y', 685)
   def _reduce_141(val, _values, result)
-                               result = { team1: val[0], team2: val[2], 
-                                      status_inline: 'awarded' 
-                                    }                          
+                               result = { team1: val[0], team2: val[2],
+                                      status_inline: 'awarded'
+                                    }
 
     result
   end
@@ -1709,7 +1711,7 @@ module_eval(<<'.,.,', 'parser.y', 691)
                                result = { team1: val[0], team2: val[2],
                                       score: val[1][1],
                                       status_inline: 'abandoned'
-                                    }                          
+                                    }
 
     result
   end
@@ -1717,9 +1719,9 @@ module_eval(<<'.,.,', 'parser.y', 691)
 
 module_eval(<<'.,.,', 'parser.y', 698)
   def _reduce_143(val, _values, result)
-                               result = { team1: val[0], team2: val[2], 
-                                      status_inline: 'abandoned' 
-                                    }                          
+                               result = { team1: val[0], team2: val[2],
+                                      status_inline: 'abandoned'
+                                    }
 
     result
   end
@@ -1727,9 +1729,9 @@ module_eval(<<'.,.,', 'parser.y', 698)
 
 module_eval(<<'.,.,', 'parser.y', 704)
   def _reduce_144(val, _values, result)
-                               result = { team1: val[0], team2: val[2], 
-                                      status_inline: 'annulled' 
-                                    }                          
+                               result = { team1: val[0], team2: val[2],
+                                      status_inline: 'annulled'
+                                    }
 
     result
   end
@@ -1737,9 +1739,9 @@ module_eval(<<'.,.,', 'parser.y', 704)
 
 module_eval(<<'.,.,', 'parser.y', 710)
   def _reduce_145(val, _values, result)
-                               result = { team1: val[0], team2: val[2], 
-                                      status_inline: 'suspended' 
-                                    }                          
+                               result = { team1: val[0], team2: val[2],
+                                      status_inline: 'suspended'
+                                    }
 
     result
   end
@@ -1749,26 +1751,26 @@ module_eval(<<'.,.,', 'parser.y', 717)
   def _reduce_146(val, _values, result)
                                 trace( "REDUCE => match_result : TEAM SCORE TEAM SCORE_FULLER_MORE" )
                             score = nil
-                            score =  if val[3][1][:score] && 
-                                        val[3][1][:score]=='et'   ## check aet flag present? 
+                            score =  if val[3][1][:score] &&
+                                        val[3][1][:score]=='et'   ## check aet flag present?
                                          val[3][1].delete( :score )  ## note - remove/delete  flag
                                            { et: val[1][1][:score] }
-                                     elsif val[3][1][:score] && 
+                                     elsif val[3][1][:score] &&
                                            val[3][1][:score]=='ht' ## check ht flag present?
                                          val[3][1].delete( :score ) ## note - remove/delete flag
-                                           { ht: val[1][1][:score] }      
-                                     elsif val[3][1][:score] && 
+                                           { ht: val[1][1][:score] }
+                                     elsif val[3][1][:score] &&
                                            val[3][1][:score]=='ft'  ## check ft flag present?
                                          val[3][1].delete( :score )  ## note - remove/delete flag
                                            { ft: val[1][1][:score] }
                                      else   ## assume full-time (ft)
                                             { ft: val[1][1][:score] }
-                                     end 
+                                     end
 
                            result = {  team1: val[0],
                                       team2: val[2],
                                       score: score.merge( val[3][1] )
-                                    }                                    
+                                    }
 
     result
   end
@@ -1779,7 +1781,7 @@ module_eval(<<'.,.,', 'parser.y', 742)
                                result = { team1: val[0],
                                       team2: val[2],
                                       score: val[1][1]
-                                    }                          
+                                    }
 
     result
   end
@@ -1789,8 +1791,8 @@ module_eval(<<'.,.,', 'parser.y', 749)
   def _reduce_148(val, _values, result)
                               trace( "REDUCE  => match_result : match_fixture SCORE" )
                           ## note - use/keep generic score (as array!! NOT hash!!!)
-                          result = { score: val[1][1][:score]  ## note - as array e.g. [1,1] !! 
-                                   }.merge( val[0] )  
+                          result = { score: val[1][1][:score]  ## note - as array e.g. [1,1] !!
+                                   }.merge( val[0] )
                           ## pp result
 
     result
@@ -1800,7 +1802,7 @@ module_eval(<<'.,.,', 'parser.y', 749)
 module_eval(<<'.,.,', 'parser.y', 757)
   def _reduce_149(val, _values, result)
                               trace( "REDUCE  => match_result : match_fixture score" )
-                          result = { score: val[1][1] }.merge( val[0] )  
+                          result = { score: val[1][1] }.merge( val[0] )
                           ## pp result
 
     result
@@ -1811,8 +1813,8 @@ module_eval(<<'.,.,', 'parser.y', 766)
   def _reduce_150(val, _values, result)
                               trace( "REDUCE  => match_result_base : match_fixture_base SCORE" )
                           ## note - use/keep generic score (as array!! NOT hash!!!)
-                          result = { score: val[1][1][:score]  ## note - as array e.g. [1,1] !! 
-                                   }.merge( val[0] )  
+                          result = { score: val[1][1][:score]  ## note - as array e.g. [1,1] !!
+                                   }.merge( val[0] )
                           ## pp result
 
     result
@@ -1822,7 +1824,7 @@ module_eval(<<'.,.,', 'parser.y', 766)
 module_eval(<<'.,.,', 'parser.y', 774)
   def _reduce_151(val, _values, result)
                               trace( "REDUCE  => match_result_base : match_fixture_base score" )
-                          result = { score: val[1][1] }.merge( val[0] )  
+                          result = { score: val[1][1] }.merge( val[0] )
                           ## pp result
 
     result
@@ -1841,7 +1843,7 @@ module_eval(<<'.,.,', 'parser.y', 813)
 module_eval(<<'.,.,', 'parser.y', 818)
   def _reduce_153(val, _values, result)
       result = { goals1: val[0],
-                                                              goals2: [] } 
+                                                              goals2: [] }
 
     result
   end
@@ -1850,7 +1852,7 @@ module_eval(<<'.,.,', 'parser.y', 818)
 module_eval(<<'.,.,', 'parser.y', 821)
   def _reduce_154(val, _values, result)
       result = { goals1: [],
-                                                              goals2: val[1] } 
+                                                              goals2: val[1] }
 
     result
   end
@@ -1875,7 +1877,7 @@ module_eval(<<'.,.,', 'parser.y', 824)
 
 module_eval(<<'.,.,', 'parser.y', 835)
   def _reduce_160(val, _values, result)
-    
+
     result
   end
 .,.,
@@ -1903,7 +1905,7 @@ module_eval(<<'.,.,', 'parser.y', 841)
 module_eval(<<'.,.,', 'parser.y', 849)
   def _reduce_166(val, _values, result)
                            result = Goal.new( player:  val[0],
-                                          minutes: val[1] )   
+                                          minutes: val[1] )
 
     result
   end
@@ -1912,7 +1914,7 @@ module_eval(<<'.,.,', 'parser.y', 849)
 module_eval(<<'.,.,', 'parser.y', 854)
   def _reduce_167(val, _values, result)
                             ### todo/check:
-                        ##    auto convert/expand 
+                        ##    auto convert/expand
                         ##    count to minutes - why? why not?
                         ##  todo/fix - pass in empty minutes ary [] - why? why not?
                         result = Goal.new( player: val[0],
@@ -1933,7 +1935,7 @@ module_eval(<<'.,.,', 'parser.y', 863)
 
 module_eval(<<'.,.,', 'parser.y', 870)
   def _reduce_169(val, _values, result)
-    
+
     result
   end
 .,.,
@@ -1957,7 +1959,7 @@ module_eval(<<'.,.,', 'parser.y', 874)
 module_eval(<<'.,.,', 'parser.y', 878)
   def _reduce_173(val, _values, result)
                                  kwargs = {}.merge( val[0][1] )
-                             result = GoalMinute.new( **kwargs )  
+                             result = GoalMinute.new( **kwargs )
 
     result
   end
@@ -2020,7 +2022,7 @@ module_eval(<<'.,.,', 'parser.y', 922)
 module_eval(<<'.,.,', 'parser.y', 932)
   def _reduce_180(val, _values, result)
                                result = GoalAlt.new( player:  val[0],
-                                                 score:   val[1][1][:score] )                         
+                                                 score:   val[1][1][:score] )
 
     result
   end
@@ -2029,7 +2031,7 @@ module_eval(<<'.,.,', 'parser.y', 932)
 module_eval(<<'.,.,', 'parser.y', 937)
   def _reduce_181(val, _values, result)
                                goal_minute = GoalMinute.new( **val[1][1] )
- 
+
                            result = GoalAlt.new( player:    val[0],
                                                  minute:    goal_minute.to_minute,
                                                  goal_type: goal_minute.to_goal_type,
@@ -2123,7 +2125,7 @@ module_eval(<<'.,.,', 'parser.y', 1015)
 
 module_eval(<<'.,.,', 'parser.y', 1021)
   def _reduce_191(val, _values, result)
-                                   @tree << RefereeLine.new( referees: val[1] ) 
+                                   @tree << RefereeLine.new( referees: val[1] )
 
     result
   end
@@ -2169,7 +2171,7 @@ module_eval(<<'.,.,', 'parser.y', 1038)
 
 module_eval(<<'.,.,', 'parser.y', 1043)
   def _reduce_198(val, _values, result)
-                                   @tree << PenaltiesLine.new( penalties: val[1] )                                                            
+                                   @tree << PenaltiesLine.new( penalties: val[1] )
 
     result
   end
@@ -2218,7 +2220,7 @@ module_eval(<<'.,.,', 'parser.y', 1062)
 
 module_eval(<<'.,.,', 'parser.y', 1068)
   def _reduce_207(val, _values, result)
-                                     result = Penalty.new( name: val[0] )                                
+                                     result = Penalty.new( name: val[0] )
 
     result
   end
@@ -2227,7 +2229,7 @@ module_eval(<<'.,.,', 'parser.y', 1068)
 module_eval(<<'.,.,', 'parser.y', 1072)
   def _reduce_208(val, _values, result)
                                      result = Penalty.new( name: val[0],
-                                                       note: val[1] )                                
+                                                       note: val[1] )
 
     result
   end
@@ -2235,7 +2237,7 @@ module_eval(<<'.,.,', 'parser.y', 1072)
 
 module_eval(<<'.,.,', 'parser.y', 1079)
   def _reduce_209(val, _values, result)
-                                   @tree << CardsLine.new( type: 'Y', bookings: val[1] )                               
+                                   @tree << CardsLine.new( type: 'Y', bookings: val[1] )
 
     result
   end
@@ -2243,7 +2245,7 @@ module_eval(<<'.,.,', 'parser.y', 1079)
 
 module_eval(<<'.,.,', 'parser.y', 1083)
   def _reduce_210(val, _values, result)
-                                   @tree << CardsLine.new( type: 'R', bookings: val[1] )                    
+                                   @tree << CardsLine.new( type: 'R', bookings: val[1] )
 
     result
   end
@@ -2286,8 +2288,8 @@ module_eval(<<'.,.,', 'parser.y', 1101)
 module_eval(<<'.,.,', 'parser.y', 1109)
   def _reduce_218(val, _values, result)
                               kwargs = { team:    val[0],
-                                     lineup:  val[1]  }.merge( val[2] ) 
-                          @tree << LineupLine.new( **kwargs ) 
+                                     lineup:  val[1]  }.merge( val[2] )
+                          @tree << LineupLine.new( **kwargs )
 
     result
   end
@@ -2408,7 +2410,7 @@ module_eval(<<'.,.,', 'parser.y', 1177)
   def _reduce_235(val, _values, result)
                                   kwargs = {}.merge( val[1] ).merge( val[3] )
                               sub    = Sub.new( sub:    Lineup.new( **kwargs ),
-                                                minute: Minute.new(val[2][1]) 
+                                                minute: Minute.new(val[2][1])
                                               )
                               result = { sub: sub }
 
@@ -2428,7 +2430,7 @@ module_eval(<<'.,.,', 'parser.y', 1185)
 module_eval(<<'.,.,', 'parser.y', 1192)
   def _reduce_237(val, _values, result)
                                   sub = Sub.new( sub:    val[2],
-                                             minute: Minute.new(val[1][1]) 
+                                             minute: Minute.new(val[1][1])
                                             )
                               result = { sub: sub }
 

data/lib/sportdb/parser/parser_runtime.rb

@@ -0,0 +1,379 @@
+
+# frozen_string_literal: true
+#--
+# Copyright (c) 1999-2006 Minero Aoki
+#
+# This program is free software.
+# You can distribute/modify this program under the same terms of ruby.
+#
+# As a special exception, when this code is copied by Racc
+# into a Racc output file, you may use that output file
+# without restriction.
+#++
+
+
+module Racc
+  class ParseError < StandardError; end
+end
+unless defined?(::ParseError)
+  ParseError = Racc::ParseError # :nodoc:
+end
+
+
+
+module Racc
+  VERSION   = '1.8.1'
+  Version = VERSION
+
+
+  class Parser
+    def _racc_setup
+      @yydebug = false unless self.class::Racc_debug_parser
+      @yydebug = false unless defined?(@yydebug)
+      if @yydebug
+        @racc_debug_out = $stderr unless defined?(@racc_debug_out)
+        @racc_debug_out ||= $stderr
+      end
+      arg = self.class::Racc_arg
+      arg[13] = true if arg.size < 14
+      arg
+    end
+
+    def _racc_init_sysvars
+      @racc_state  = [0]
+      @racc_tstack = []
+      @racc_vstack = []
+
+      @racc_t = nil
+      @racc_val = nil
+
+      @racc_read_next = true
+
+      @racc_user_yyerror = false
+      @racc_error_status = 0
+    end
+
+    # The entry point of the parser. This method is used with #next_token.
+    # If Racc wants to get token (and its value), calls next_token.
+    #
+    # Example:
+    #     def parse
+    #       @q = [[1,1],
+    #             [2,2],
+    #             [3,3],
+    #             [false, '$']]
+    #       do_parse
+    #     end
+    #
+    #     def next_token
+    #       @q.shift
+    #     end
+    def do_parse
+        _racc_do_parse_rb(_racc_setup(), false)
+    end
+
+    # The method to fetch next token.
+    # If you use #do_parse method, you must implement #next_token.
+    #
+    # The format of return value is [TOKEN_SYMBOL, VALUE].
+    # +token-symbol+ is represented by Ruby's symbol by default, e.g. :IDENT
+    # for 'IDENT'.  ";" (String) for ';'.
+    #
+    # The final symbol (End of file) must be false.
+    def next_token
+      raise NotImplementedError, "#{self.class}\#next_token is not defined"
+    end
+
+    def _racc_do_parse_rb(arg, in_debug)
+      action_table, action_check, action_default, action_pointer,
+      _,            _,            _,              _,
+      _,            _,            token_table,    * = arg
+
+      _racc_init_sysvars
+      tok = act = i = nil
+
+      catch(:racc_end_parse) {
+        while true
+          if i = action_pointer[@racc_state[-1]]
+            if @racc_read_next
+              if @racc_t != 0   # not EOF
+                tok, @racc_val = next_token()
+                unless tok      # EOF
+                  @racc_t = 0
+                else
+                  @racc_t = (token_table[tok] or 1)   # error token
+                end
+                racc_read_token(@racc_t, tok, @racc_val) if @yydebug
+                @racc_read_next = false
+              end
+            end
+            i += @racc_t
+            unless i >= 0 and
+                   act = action_table[i] and
+                   action_check[i] == @racc_state[-1]
+              act = action_default[@racc_state[-1]]
+            end
+          else
+            act = action_default[@racc_state[-1]]
+          end
+          while act = _racc_evalact(act, arg)
+            ;
+          end
+        end
+      }
+    end
+
+
+
+    ###
+    ### common
+    ###
+
+    def _racc_evalact(act, arg)
+      action_table, action_check, _, action_pointer,
+      _,            _,            _, _,
+      _,            _,            _, shift_n,
+      reduce_n,     * = arg
+      nerr = 0   # tmp
+
+      if act > 0 and act < shift_n
+        #
+        # shift
+        #
+        if @racc_error_status > 0
+          @racc_error_status -= 1 unless @racc_t <= 1 # error token or EOF
+        end
+        @racc_vstack.push @racc_val
+        @racc_state.push act
+        @racc_read_next = true
+        if @yydebug
+          @racc_tstack.push @racc_t
+          racc_shift @racc_t, @racc_tstack, @racc_vstack
+        end
+
+      elsif act < 0 and act > -reduce_n
+        #
+        # reduce
+        #
+        code = catch(:racc_jump) {
+          @racc_state.push _racc_do_reduce(arg, act)
+          false
+        }
+        if code
+          case code
+          when 1 # yyerror
+            @racc_user_yyerror = true   # user_yyerror
+            return -reduce_n
+          when 2 # yyaccept
+            return shift_n
+          else
+            raise '[Racc Bug] unknown jump code'
+          end
+        end
+
+      elsif act == shift_n
+        #
+        # accept
+        #
+        racc_accept if @yydebug
+        throw :racc_end_parse, @racc_vstack[0]
+
+      elsif act == -reduce_n
+        #
+        # error
+        #
+        case @racc_error_status
+        when 0
+          unless arg[21]    # user_yyerror
+            nerr += 1
+            on_error @racc_t, @racc_val, @racc_vstack
+          end
+        when 3
+          if @racc_t == 0   # is $
+            # We're at EOF, and another error occurred immediately after
+            # attempting auto-recovery
+            throw :racc_end_parse, nil
+          end
+          @racc_read_next = true
+        end
+        @racc_user_yyerror = false
+        @racc_error_status = 3
+        while true
+          if i = action_pointer[@racc_state[-1]]
+            i += 1   # error token
+            if  i >= 0 and
+                (act = action_table[i]) and
+                action_check[i] == @racc_state[-1]
+              break
+            end
+          end
+          throw :racc_end_parse, nil if @racc_state.size <= 1
+          @racc_state.pop
+          @racc_vstack.pop
+          if @yydebug
+            @racc_tstack.pop
+            racc_e_pop @racc_state, @racc_tstack, @racc_vstack
+          end
+        end
+        return act
+
+      else
+        raise "[Racc Bug] unknown action #{act.inspect}"
+      end
+
+      racc_next_state(@racc_state[-1], @racc_state) if @yydebug
+
+      nil
+    end
+
+    def _racc_do_reduce(arg, act)
+      _,          _,            _,            _,
+      goto_table, goto_check,   goto_default, goto_pointer,
+      nt_base,    reduce_table, _,            _,
+      _,          use_result,   * = arg
+
+      state = @racc_state
+      vstack = @racc_vstack
+      tstack = @racc_tstack
+
+      i = act * -3
+      len       = reduce_table[i]
+      reduce_to = reduce_table[i+1]
+      method_id = reduce_table[i+2]
+      void_array = []
+
+      tmp_t = tstack[-len, len] if @yydebug
+      tmp_v = vstack[-len, len]
+      tstack[-len, len] = void_array if @yydebug
+      vstack[-len, len] = void_array
+      state[-len, len]  = void_array
+
+      # tstack must be updated AFTER method call
+      if use_result
+        vstack.push __send__(method_id, tmp_v, vstack, tmp_v[0])
+      else
+        vstack.push __send__(method_id, tmp_v, vstack)
+      end
+      tstack.push reduce_to
+
+      racc_reduce(tmp_t, reduce_to, tstack, vstack) if @yydebug
+
+      k1 = reduce_to - nt_base
+      if i = goto_pointer[k1]
+        i += state[-1]
+        if i >= 0 and (curstate = goto_table[i]) and goto_check[i] == k1
+          return curstate
+        end
+      end
+      goto_default[k1]
+    end
+
+    # This method is called when a parse error is found.
+    #
+    # ERROR_TOKEN_ID is an internal ID of token which caused error.
+    # You can get string representation of this ID by calling
+    # #token_to_str.
+    #
+    # ERROR_VALUE is a value of error token.
+    #
+    # value_stack is a stack of symbol values.
+    # DO NOT MODIFY this object.
+    #
+    # This method raises ParseError by default.
+    #
+    # If this method returns, parsers enter "error recovering mode".
+    def on_error(t, val, vstack)
+      raise ParseError, sprintf("parse error on value %s (%s)",
+                                val.inspect, token_to_str(t) || '?')
+    end
+
+    # Enter error recovering mode.
+    # This method does not call #on_error.
+    def yyerror
+      throw :racc_jump, 1
+    end
+
+    # Exit parser.
+    # Return value is +Symbol_Value_Stack[0]+.
+    def yyaccept
+      throw :racc_jump, 2
+    end
+
+    # Leave error recovering mode.
+    def yyerrok
+      @racc_error_status = 0
+    end
+
+    # For debugging output
+    def racc_read_token(t, tok, val)
+      @racc_debug_out.print 'read    '
+      @racc_debug_out.print tok.inspect, '(', racc_token2str(t), ') '
+      @racc_debug_out.puts val.inspect
+      @racc_debug_out.puts
+    end
+
+    def racc_shift(tok, tstack, vstack)
+      @racc_debug_out.puts "shift   #{racc_token2str tok}"
+      racc_print_stacks tstack, vstack
+      @racc_debug_out.puts
+    end
+
+    def racc_reduce(toks, sim, tstack, vstack)
+      out = @racc_debug_out
+      out.print 'reduce '
+      if toks.empty?
+        out.print ' <none>'
+      else
+        toks.each {|t| out.print ' ', racc_token2str(t) }
+      end
+      out.puts " --> #{racc_token2str(sim)}"
+      racc_print_stacks tstack, vstack
+      @racc_debug_out.puts
+    end
+
+    def racc_accept
+      @racc_debug_out.puts 'accept'
+      @racc_debug_out.puts
+    end
+
+    def racc_e_pop(state, tstack, vstack)
+      @racc_debug_out.puts 'error recovering mode: pop token'
+      racc_print_states state
+      racc_print_stacks tstack, vstack
+      @racc_debug_out.puts
+    end
+
+    def racc_next_state(curstate, state)
+      @racc_debug_out.puts  "goto    #{curstate}"
+      racc_print_states state
+      @racc_debug_out.puts
+    end
+
+    def racc_print_stacks(t, v)
+      out = @racc_debug_out
+      out.print '        ['
+      t.each_index do |i|
+        out.print ' (', racc_token2str(t[i]), ' ', v[i].inspect, ')'
+      end
+      out.puts ' ]'
+    end
+
+    def racc_print_states(s)
+      out = @racc_debug_out
+      out.print '        ['
+      s.each {|st| out.print ' ', st }
+      out.puts ' ]'
+    end
+
+    def racc_token2str(tok)
+      self.class::Racc_token_to_s_table[tok] or
+          raise "[Racc Bug] can't convert token #{tok} to string"
+    end
+
+    # Convert internal ID of token symbol to the string.
+    def token_to_str(t)
+      self.class::Racc_token_to_s_table[t]
+    end
+
+  end
+end

data/lib/sportdb/parser/version.rb

@@ -4,7 +4,7 @@ module SportDb
     module Parser
   MAJOR = 0    ## todo: namespace inside version or something - why? why not??
   MINOR = 7
-  PATCH = 0
+  PATCH = 1
   VERSION = [MAJOR,MINOR,PATCH].join('.')
 
   def self.version

data/lib/sportdb/parser.rb

@@ -49,6 +49,10 @@ require_relative 'parser/lexer'
 require_relative 'parser/lexer_tty'      ## teletype (tty) mode
 
 
+## note - use "embeded" racc parser runtime
+##    MUST uncomment  require 'racc/parser'  in generated parser!!!
+require_relative 'parser/parser_runtime'
+
 require_relative 'parser/parser'   ## auto-generated by racc (from parser.y)
 require_relative 'parser/racc_parser'
 require_relative 'parser/racc_tree'
@@ -76,7 +80,7 @@ class Parser
 #  "default" lexer & parser  (wraps RaccMatchParser)
 
   def tokenize_with_errors( lines, debug: false )
-     lexer = Lexer.new( lines )  
+     lexer = Lexer.new( lines )
      tokens, errors = lexer.tokenize_with_errors
      [tokens, errors]
   end
@@ -107,4 +111,3 @@ end  # module SportDb
 
 
 puts SportDb::Module::Parser.banner    # say hello
-

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: sportdb-parser
 version: !ruby/object:Gem::Version
-  version: 0.7.0
+  version: 0.7.1
 platform: ruby
 authors:
 - Gerald Bauer
@@ -24,20 +24,6 @@ dependencies:
     - - ">="
       - !ruby/object:Gem::Version
         version: 0.4.1
-- !ruby/object:Gem::Dependency
-  name: racc
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: '0'
-  type: :runtime
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: '0'
 - !ruby/object:Gem::Dependency
   name: rdoc
   requirement: !ruby/object:Gem::Requirement
@@ -91,6 +77,7 @@ files:
 - lib/sportdb/parser/lexer_buffer.rb
 - lib/sportdb/parser/lexer_tty.rb
 - lib/sportdb/parser/parser.rb
+- lib/sportdb/parser/parser_runtime.rb
 - lib/sportdb/parser/racc_parser.rb
 - lib/sportdb/parser/racc_tree.rb
 - lib/sportdb/parser/token-date.rb