brakeman 6.2.2 → 8.0.4

data/bundle/ruby/{3.1.0/gems/rexml-3.3.8 → 3.2.0/gems/rexml-3.4.4}/lib/rexml/xpath_parser.rb

@@ -76,19 +76,32 @@ module REXML
       @variables = vars
     end
 
-    def parse path, nodeset
+    def parse path, node
       path_stack = @parser.parse( path )
-      match( path_stack, nodeset )
+      if node.is_a?(Array)
+        Kernel.warn("REXML::XPath.each, REXML::XPath.first, REXML::XPath.match dropped support for nodeset...", uplevel: 1)
+        return [] if node.empty?
+        node = node.first
+      end
+
+      document = node.document
+      if document
+        document.__send__(:enable_cache) do
+          match( path_stack, node )
+        end
+      else
+        match( path_stack, node )
+      end
     end
 
-    def get_first path, nodeset
+    def get_first path, node
       path_stack = @parser.parse( path )
-      first( path_stack, nodeset )
+      first( path_stack, node )
     end
 
-    def predicate path, nodeset
+    def predicate path, node
       path_stack = @parser.parse( path )
-      match( path_stack, nodeset )
+      match( path_stack, node )
     end
 
     def []=( variable_name, value )
@@ -106,7 +119,7 @@ module REXML
       case path[0]
       when :document
         # do nothing
-        return first( path[1..-1], node )
+        first( path[1..-1], node )
       when :child
         for c in node.children
           r = first( path[1..-1], c )
@@ -116,9 +129,9 @@ module REXML
         name = path[2]
         if node.name == name
           return node if path.size == 3
-          return first( path[3..-1], node )
+          first( path[3..-1], node )
         else
-          return nil
+          nil
         end
       when :descendant_or_self
         r = first( path[1..-1], node )
@@ -128,23 +141,21 @@ module REXML
           return r if r
         end
       when :node
-        return first( path[1..-1], node )
+        first( path[1..-1], node )
       when :any
-        return first( path[1..-1], node )
+        first( path[1..-1], node )
+      else
+        nil
       end
-      return nil
     end
 
 
-    def match(path_stack, nodeset)
-      nodeset = nodeset.collect.with_index do |node, i|
-        position = i + 1
-        XPathNode.new(node, position: position)
-      end
+    def match(path_stack, node)
+      nodeset = [XPathNode.new(node, position: 1)]
       result = expr(path_stack, nodeset)
       case result
       when Array # nodeset
-        unnode(result)
+        unnode(result).uniq
       else
         [result]
       end
@@ -162,10 +173,10 @@ module REXML
     #  2. If no mapping was supplied, use the context node to look up the namespace
     def get_namespace( node, prefix )
       if @namespaces
-        return @namespaces[prefix] || ''
+        @namespaces[prefix] || ''
       else
         return node.namespace( prefix ) if node.node_type == :element
-        return ''
+        ''
       end
     end
 
@@ -492,14 +503,10 @@ module REXML
                 if strict?
                   raw_node.name == name and raw_node.namespace == ""
                 else
-                  # FIXME: This DOUBLES the time XPath searches take
-                  ns = get_namespace(raw_node, prefix)
-                  raw_node.name == name and raw_node.namespace == ns
+                  raw_node.name == name and raw_node.namespace == get_namespace(raw_node, prefix)
                 end
               else
-                # FIXME: This DOUBLES the time XPath searches take
-                ns = get_namespace(raw_node, prefix)
-                raw_node.name == name and raw_node.namespace == ns
+                raw_node.name == name and raw_node.namespace == get_namespace(raw_node, prefix)
               end
             when :attribute
               if prefix.nil?
@@ -507,9 +514,7 @@ module REXML
               elsif prefix.empty?
                 raw_node.name == name and raw_node.namespace == ""
               else
-                # FIXME: This DOUBLES the time XPath searches take
-                ns = get_namespace(raw_node.element, prefix)
-                raw_node.name == name and raw_node.namespace == ns
+                raw_node.name == name and raw_node.namespace == get_namespace(raw_node.element, prefix)
               end
             else
               false
@@ -671,7 +676,7 @@ module REXML
         if order == :forward
           index
         else
-          -index
+          index.map(&:-@)
         end
       end
       ordered.collect do |_index, node|
@@ -758,22 +763,19 @@ module REXML
     end
 
     def following_node_of( node )
-      if node.kind_of? Element and node.children.size > 0
-        return node.children[0]
-      end
-      return next_sibling_node(node)
+      return node.children[0] if node.kind_of?(Element) and node.children.size > 0
+
+      next_sibling_node(node)
     end
 
     def next_sibling_node(node)
       psn = node.next_sibling_node
       while psn.nil?
-        if node.parent.nil? or node.parent.class == Document
-          return nil
-        end
+        return nil if node.parent.nil? or node.parent.class == Document
         node = node.parent
         psn = node.next_sibling_node
       end
-      return psn
+      psn
     end
 
     def child(nodeset)
@@ -806,13 +808,13 @@ module REXML
     def norm b
       case b
       when true, false
-        return b
+        b
       when 'true', 'false'
-        return Functions::boolean( b )
+        Functions::boolean( b )
       when /^\d+(\.\d+)?$/, Numeric
-        return Functions::number( b )
+        Functions::number( b )
       else
-        return Functions::string( b )
+        Functions::string( b )
       end
     end
 

data/bundle/ruby/{3.1.0/gems/ruby2ruby-2.5.1 → 3.2.0/gems/ruby2ruby-2.5.2}/History.rdoc

@@ -1,3 +1,9 @@
+=== 2.5.2 / 2025-03-25
+
+* 1 bug fix:
+
+  * Added support for 3 slot op_asgn (eg `a &= 1`)
+
 === 2.5.1 / 2024-07-08
 
 * 1 bug fix:

data/bundle/ruby/{3.1.0/gems/ruby2ruby-2.5.1 → 3.2.0/gems/ruby2ruby-2.5.2}/lib/ruby2ruby.rb

@@ -31,7 +31,7 @@ end
 # Generate ruby code from a sexp.
 
 class Ruby2Ruby < SexpProcessor
-  VERSION = "2.5.1" # :nodoc:
+  VERSION = "2.5.2" # :nodoc:
 
   # cutoff for one-liners
   LINE_LENGTH = 78
@@ -916,11 +916,14 @@ class Ruby2Ruby < SexpProcessor
   end
 
   def process_op_asgn exp # :nodoc:
-    # [[:lvar, :x], [:call, nil, :z, [:lit, 1]], :y, :"||"]
-
     case exp.length
     when 4
-      raise "NOT YET: op_asgn 4"
+      _, lhs, op, rhs = exp
+
+      lhs = process lhs
+      rhs = process rhs
+
+      "#{lhs} #{op}= #{rhs}"
     when 5
       _, lhs, rhs, index, op = exp
 

data/bundle/ruby/{3.1.0/gems/ruby_parser-3.20.3 → 3.2.0/gems/ruby_parser-3.22.0}/History.rdoc

@@ -1,3 +1,70 @@
+=== 3.22.0 / 2025-12-20
+
+* 1 major enhancement:
+
+  * Announced the EOL of ruby_parser! YAY!
+
+* 6 minor enhancements:
+
+  * 3.3: working down the grammar structural differences.
+  * Added tentative 3.4 support.
+  * Renamed assignable to old_assignable and added newer cleaner assignable
+  * Restructured comparison rake tasks and normalization to deal with lrama changes.
+  * Updated compare versions and added 3.4.
+  * Updated grammars to fit most closely to ruby 3.2. Working it down the line.
+
+* 11 bug fixes:
+
+  * Always raise RubyParser::SyntaxError (wrap and raise).
+  * Bumped ruby version to 3.2+.
+  * Cleaned up user_variable productions to always return sexps.
+  * Corrections and enhancements for gauntlet.md instructions.
+  * Fixed rake compare's clean subtask to nuke the unpacked ruby dirs entirely.
+  * Fixed superclass of V34.
+  * Fixed up a couple errors created by using STRICT_SEXP=2. 3 will be neigh impossible.
+  * I am nothing if not stubborn: fixed errors caused by STRICT_SEXP=3.
+  * Minor fixes for 3.2+ grammars on "defined?" expressions.
+  * Removed a lot of ancient compatibility checks and patches. (eg encodings)
+  * This in turn cleaned up var_ref and a bunch of other productions.
+
+=== 3.21.1 / 2024-07-09
+
+* 1 bug fix:
+
+  * Fix errors created when string literals are frozen.
+
+=== 3.21.0 / 2024-01-15
+
+* 18 minor enhancements:
+
+  * (internal) Added simple RubyLexer#comment.
+  * (internal) Removed RubyLexer#comments and #ignore_body_comments.
+  * (internal) Removed RubyParser#comments.
+  * (internal) Renamed files from lib/ruby##_parser.* to lib/ruby_parser##.*
+  * (internal) Renamed lib/ruby3_parser.yy to lib/ruby_parser3.yy
+  * (internal) Renamed lib/ruby_parser.yy to lib/ruby_parser2.yy
+  * Added tentative 3.2 support. (torrocus)
+  * Made `rake compare` a multitask (28s -> 10s!!).
+  * Made `rake compare` depend on `generate` (from clean: 28s -> 18s).
+  * No longer package versioned .y files.
+  * Overhaul of parser/lexer comment processing.
+  * Parser productions for k_class/k_module/k_def carry their comment with them.
+  * Restructured build tasks to utilize Hoe's .yy support! 8.5s -> 1.2s!!!
+  * RubyParser new_(class|module|defn|defs) handle comment processing via sexp.
+  * RubyParser new_(class|module|defn|defs) handle normalizing production sexps.
+  * RubyParser#next_token clears out lexer's comment when applicable.
+  * Simplified parser productions for defn_head, defs_head. No more normalizing.
+  * Updated `rake compare` steps for lrama in ruby 3.3+.
+
+* 6 bug fixes:
+
+  * Cleaned out cruft from `rake compare` code.
+  * Fixed compare/normalize.rb for lrama differences.
+  * Made `parser` task depend on `isolate` task to pick up racc generator.
+  * Made racc a runtime dependency (was dev only) now that ruby 3.3 doesn't ship with the racc runtime. (wildmaples)
+  * Updated README.rdoc updating instructions to match current filenames.
+  * Updated compare versions and added 3.3.
+
 === 3.20.3 / 2023-07-11
 
 * 2 minor enhancements:

data/bundle/ruby/3.2.0/gems/ruby_parser-3.22.0/Manifest.txt

@@ -0,0 +1,39 @@
+.autotest
+History.rdoc
+Manifest.txt
+README.rdoc
+Rakefile
+bin/ruby_parse
+bin/ruby_parse_extract_error
+compare/normalize.rb
+debugging.md
+gauntlet.md
+lib/.document
+lib/rp_extensions.rb
+lib/rp_stringscanner.rb
+lib/ruby_lexer.rb
+lib/ruby_lexer.rex
+lib/ruby_lexer.rex.rb
+lib/ruby_lexer_strings.rb
+lib/ruby_parser.rb
+lib/ruby_parser2.yy
+lib/ruby_parser20.rb
+lib/ruby_parser21.rb
+lib/ruby_parser22.rb
+lib/ruby_parser23.rb
+lib/ruby_parser24.rb
+lib/ruby_parser25.rb
+lib/ruby_parser26.rb
+lib/ruby_parser27.rb
+lib/ruby_parser3.yy
+lib/ruby_parser30.rb
+lib/ruby_parser31.rb
+lib/ruby_parser32.rb
+lib/ruby_parser33.rb
+lib/ruby_parser34.rb
+lib/ruby_parser_extras.rb
+test/test_ruby_lexer.rb
+test/test_ruby_parser.rb
+test/test_ruby_parser_extras.rb
+tools/munge.rb
+tools/ripper.rb

data/bundle/ruby/{3.1.0/gems/ruby_parser-3.20.3 → 3.2.0/gems/ruby_parser-3.22.0}/README.rdoc

@@ -4,6 +4,18 @@ home :: https://github.com/seattlerb/ruby_parser
 bugs :: https://github.com/seattlerb/ruby_parser/issues
 rdoc :: http://docs.seattlerb.org/ruby_parser
 
+== NOTICE:
+
+With the advent of prism, and it's ruby_parser compatibility mode,
+this project is EOL. I've switched all my projects that use
+ruby_parser over to prism with only a minimum of fixes sent upstream.
+Use prism ~> 1.7 for best results.
+
+I'm doing one more release to get my standing changes out into the
+world and might follow up with another if anything adverse is
+reported... but other than that, I'm very happy to put this out to
+pasture.
+
 == DESCRIPTION:
 
 ruby_parser (RP) is a ruby parser written in pure ruby (utilizing
@@ -65,15 +77,15 @@ You can also use Ruby19Parser, Ruby18Parser, or RubyParser.for_current_ruby:
 
 To add a new version:
 
-* New parser should be generated from lib/ruby[3]_parser.yy.
-* Extend lib/ruby[3]_parser.yy with new class name.
+* New parser should be generated from lib/ruby_parser[23].yy.
+* Extend lib/ruby_parser[23].yy with new class name.
 * Add new version number to V2/V3 in Rakefile for rule creation.
 * Add new `ruby_parse "x.y.z"` line to Rakefile for rake compare (line ~300).
 * Require generated parser in lib/ruby_parser.rb.
 * Add new V## = ::Ruby##Parser; end to ruby_parser.rb (bottom of file).
 * Add empty TestRubyParserShared##Plus module and TestRubyParserV## to test/test_ruby_parser.rb.
 * Extend Manifest.txt with generated file names.
-* Add new version number to sexp_processor's pt_testcase.rb in all_versions
+* Add new version number to sexp_processor's pt_testcase.rb in all_versions.
 
 Until all of these are done, you won't have a clean test run.
 

data/bundle/ruby/{3.1.0/gems/ruby_parser-3.20.3 → 3.2.0/gems/ruby_parser-3.22.0}/compare/normalize.rb

@@ -91,6 +91,7 @@ def munge s
 
              "keyword_BEGIN",   "klBEGIN",
              "keyword_END",     "klEND",
+             "k_END",           "klEND",
              /keyword_(\w+)/,   proc { "k#{$1.upcase}" },
              /\bk_([a-z_]+)/,   proc { "k#{$1.upcase}" },
              /modifier_(\w+)/,  proc { "k#{$1.upcase}_MOD" },
@@ -153,13 +154,22 @@ def munge s
 
              '"do (for condition)"', "kDO_COND",
              '"do (for lambda)"',    "kDO_LAMBDA",
-             '"do (for block)"',     "kDO_BLOCK",
+             %("'do' for block"),    "kDO_BLOCK",    # 3.4
+             %("'do' for lambda"),   "kDO_LAMBDA",   # 3.4
+             %("'do' for condition"),"kDO_COND",     # 3.4
+             %q("#{"),               "tSTRING_DBEG", # 3.4
+             '"do (for block)"',     "kDO_BLOCK",    # 3.4
 
+             /\"'(\w+)' \(?modifier\)?\"/, proc { |x| "k#{$1.upcase}_MOD" }, # 3.4
              /\"(\w+) \(?modifier\)?\"/, proc { |x| "k#{$1.upcase}_MOD" },
-             /\"(\w+)\"/,                proc { |x| "k#{$1.upcase}" },
+             /\"((?!k)\w+)\"/,             proc { |x| "k#{$1.upcase}" },
 
              /\$?@(\d+)(\s+|$)/,    "", # newer bison
 
+             # 3.4(ish?) changes:
+             "option_tNL",              "opt_nl",
+             "option_terms",            "opt_terms",
+
              # TODO: remove for 3.0 work:
              "lex_ctxt ", "" # 3.0 production that's mostly noise right now
             ]
@@ -178,12 +188,16 @@ end
 ARGF.each_line do |line|
   next unless good or line =~ /^-* ?Grammar|\$accept : /
 
-  case line.strip
+  case line.strip # TODO: .delete %q["'()]
   when /^$/ then
   when /^(\d+) (\$?[@\w]+): (.*)/ then    # yacc
     rule = $2
     order << rule unless rules.has_key? rule
     rules[rule] << munge($3)
+  when /^(\d+) (\$?[@\w]+'(?: |\\n)'): (.*)/ then # munges both sides
+    rule = $2
+    order << rule unless rules.has_key? rule
+    rules[munge(rule)] << munge($3)
   when /^(\d+) \s+\| (.*)/ then        # yacc
     rules[rule] << munge($2)
   when /^(\d+) (@\d+): (.*)/ then      # yacc
@@ -202,6 +216,8 @@ ARGF.each_line do |line|
     break
   when /^Terminals/ then               # yacc
     break
+  when /^State \d/ then                # lrama
+    break
   when /^\cL/ then                     # byacc
     break
   else

data/bundle/ruby/{3.1.0/gems/ruby_parser-3.20.3 → 3.2.0/gems/ruby_parser-3.22.0}/gauntlet.md

@@ -38,11 +38,11 @@ using `unpack_gems.rb`.
 
 ```
 % cd RP/gauntlet
-% time caffeinate /Volumes/StuffA/gauntlet/bin/unpack_gems.rb -v [-a] ; say done
+% time caffeinate ./bin/unpack_gems.rb -v [-a] ; say done
 ... waaaait ...
 % DIR=gauntlet.$(today).(all|new).noindex
 % mv hashed.noindex $DIR
-% tar vc -T <(fd -tf . $DIR | sort) | zstd -5 -T0 --long > archives/$DIR.tar.zst ; say done
+% tar vc -T <(fd -tf . $DIR | sort) | zstdmt -12 --long > archives/$DIR.tar.zst ; say done
 % ./bin/sync.sh
 ```
 
@@ -71,7 +71,7 @@ compress).
 ### Stats
 
 ```
-9696 % find gauntlet.$(today).noindex -type f | lc
+9696 % fd -tf . gauntlet.$(today).noindex | wc -l
   561270
 3.5G gauntlet.2021-08-06.noindex
 239M gauntlet.2021-08-06.noindex.tar.zst
@@ -85,9 +85,12 @@ parse. It's about 3.5g but compresses very nicely down to 240m
 Assuming you're starting from scratch, unpack the archive once:
 
 ```
-% zstdcat gauntlet.$(today).noindex.tar.zst | tar x
+% tar xf gauntlet.$(today).noindex.tar.zst
 ```
 
+(BSD tar (and apparently newer gnu tars) can detect and uncompress
+most compression formats)
+
 Then, either run a single process (easier to read):
 
 ```
@@ -103,5 +106,32 @@ Or max out your machine using xargs (note the `-P 16` and choose accordingly):
 In another terminal I usually monitor the progress like so:
 
 ```
-% while true ; do clear; fd . -t d -t e gauntlet/*.noindex -X rmdir -p 2> /dev/null ; for D in gauntlet/*.noindex/? ; do echo -n "$D: "; fd .rb $D | wc -l ; done ; echo ; sleep 30 ; done
+% while true ; do clear; fd . -td -te gauntlet/*.noindex -X rmdir -p 2> /dev/null ; for D in gauntlet/*.noindex/? ; do echo -n "$D: "; fd .rb $D | wc -l ; done ; echo ; sleep 30 ; done
+```
+
+After this is run and done, there will be files left over that
+couldn't be parsed. There will also be a directory with a name like
+`gauntlet.slow.1` of files that timed out. What I generally do is wait
+for the first run to end and then start increasing the timeout and run
+again on the timeout dir:
+
+```
+$ ls -d gauntlet.slow.1/*.noindex/?/? | RP_TIMEOUT=30 time xargs -n 1 -P 16 ./gauntlet/bin/gauntlet.rb
+# or:
+$ RP_TIMEOUT=30 time ./gauntlet/bin/gauntlet.rb gauntlet.slow.*
+$ RP_TIMEOUT=60 time ./gauntlet/bin/gauntlet.rb gauntlet.slow.*
+$ fd -tf . gauntlet.slow.60/
+gauntlet.slow.60/gauntlet.2025-10-22.new.noindex/2/f/f/2ff00bbd2ee63b2145d247570c130823dce2b9fe.rb
+gauntlet.slow.60/gauntlet.2025-10-22.new.noindex/a/a/4/aa44d5a214217036425bf8fce5a7ab5b0e04fd92.rb
 ```
+
+for the most part, you wind up with absurdly large generated ruby files:
+
+```
+10022 $ wc -l gauntlet.slow.60/*/?/?/?/*.rb
+  412444 gauntlet.slow.60/gauntlet.2025-10-22.new.noindex/2/f/f/2ff00bbd2ee63b2145d247570c130823dce2b9fe.rb
+  295249 gauntlet.slow.60/gauntlet.2025-10-22.new.noindex/a/a/4/aa44d5a214217036425bf8fce5a7ab5b0e04fd92.rb
+  707693 total
+```
+
+and I don't care so much about these.

data/bundle/ruby/{3.1.0/gems/ruby_parser-3.20.3 → 3.2.0/gems/ruby_parser-3.22.0}/lib/ruby_lexer.rb

@@ -23,8 +23,6 @@ class RubyLexer
     "c\?"  => 127.chr,
   }
 
-  HAS_ENC = "".respond_to? :encoding
-
   BTOKENS = {
     ".."  => :tBDOT2,
     "..." => :tBDOT3,
@@ -113,7 +111,8 @@ class RubyLexer
   # Last token read via next_token.
   attr_accessor :token
 
-  attr_writer :comments
+  # Last comment lexed, or nil
+  attr_accessor :comment
 
   def initialize _ = nil
     @lex_state = nil # remove one warning under $DEBUG
@@ -134,16 +133,6 @@ class RubyLexer
     is_after_operator? ? EXPR_ARG : EXPR_BEG
   end
 
-  def ignore_body_comments
-    @comments.clear
-  end
-
-  def comments # TODO: remove this... maybe comment_string + attr_accessor
-    c = @comments.join
-    @comments.clear
-    c
-  end
-
   def debug n
     raise "debug #{n}"
   end
@@ -258,14 +247,15 @@ class RubyLexer
   end
 
   def process_begin text
-    @comments << matched
+    self.comment ||= +""
+    self.comment << matched
 
     unless scan(/.*?\n=end( |\t|\f)*[^\n]*(\n|\z)/m) then
-      @comments.clear
+      self.comment = nil
       rb_compile_error("embedded document meets end of file")
     end
 
-    @comments << matched
+    self.comment << matched
     self.lineno += matched.count("\n") # HACK?
 
     nil # TODO
@@ -447,7 +437,8 @@ class RubyLexer
 
       while scan(/\s*\#.*(\n+|\z)/) do
         self.lineno += matched.count "\n"
-        @comments << matched.gsub(/^ +#/, "#").gsub(/^ +$/, "")
+        self.comment ||= +""
+        self.comment << matched.gsub(/^ +#/, "#").gsub(/^ +$/, "")
       end
 
       return nil if end_of_stream?
@@ -768,7 +759,7 @@ class RubyLexer
     self.lineno        = 1
     self.brace_nest    = 0
     self.command_start = true
-    self.comments      = []
+    self.comment       = nil
     self.lex_state     = EXPR_NONE
     self.lex_strterm   = nil
     self.lpar_beg      = nil

data/bundle/ruby/{3.1.0/gems/ruby_parser-3.20.3 → 3.2.0/gems/ruby_parser-3.22.0}/lib/ruby_lexer.rex.rb

@@ -2,7 +2,7 @@
 # encoding: UTF-8
 #--
 # This file is automatically generated. Do not modify it.
-# Generated by: oedipus_lex version 2.6.1.
+# Generated by: oedipus_lex version 2.6.2.
 # Source: lib/ruby_lexer.rex
 #++
 
@@ -91,7 +91,6 @@ class RubyLexer
     old_pos - start_of_current_line_pos
   end
 
-
   ##
   # The current scanner class. Must be overridden in subclasses.
 

data/bundle/ruby/{3.1.0/gems/ruby_parser-3.20.3 → 3.2.0/gems/ruby_parser-3.22.0}/lib/ruby_parser.rb

@@ -38,7 +38,7 @@ class RubyParser
         e ||= exc
       end
     end
-    raise e
+    raise RubyParser::SyntaxError, e.message
   end
 
   alias :parse :process
@@ -69,23 +69,27 @@ end
 ##
 # Unfortunately a problem with racc is that it won't let me namespace
 # properly, so instead of RubyParser::V25, I still have to generate
-# the old Ruby25Parser and shove it in as V25.
-
-require "ruby20_parser"
-require "ruby21_parser"
-require "ruby22_parser"
-require "ruby23_parser"
-require "ruby24_parser"
-require "ruby25_parser"
-require "ruby26_parser"
-require "ruby27_parser"
-require "ruby30_parser"
-require "ruby31_parser"
-require "ruby32_parser"
+# the old RubyParser25 and shove it in as V25.
+
+require "ruby_parser20"
+require "ruby_parser21"
+require "ruby_parser22"
+require "ruby_parser23"
+require "ruby_parser24"
+require "ruby_parser25"
+require "ruby_parser26"
+require "ruby_parser27"
+require "ruby_parser30"
+require "ruby_parser31"
+require "ruby_parser32"
+require "ruby_parser33"
+require "ruby_parser34"
 
 class RubyParser # HACK
   VERSIONS.clear # also a HACK caused by racc namespace issues
 
+  class V34 < ::Ruby34Parser; end
+  class V33 < ::Ruby33Parser; end
   class V32 < ::Ruby32Parser; end
   class V31 < ::Ruby31Parser; end
   class V30 < ::Ruby30Parser; end