rubocop-ast 1.38.0 → 1.49.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 3a3205a51f90d1dc493ef4c1ec96a4f40ed796dfc58bfc3661db72e67e134abc
-  data.tar.gz: 6d55fec1f58d712845ecb936db794934ea264e64b0adeb2c097fae63a5e5cb3e
+  metadata.gz: 9e4a71ea1a0fa947b90afc9034eeb0c003b875f36ec8802a28228cba2325d094
+  data.tar.gz: 871addb4a4e3d427f5c549902f8c927ebe8796856fa5d8828db4e1235550b786
 SHA512:
-  metadata.gz: 9468ab39ad7cd4ca56f0781605f07136dc89dfcbafc51482d5045799b468bf389d3c61671f49c7242f3dfbcc99090f3bd4b0c178d08b6038818b0158e3078658
-  data.tar.gz: a5b2b0604abdd935bfba3213a908678b5697cee7345f5b9941bfdddbfc08ceb8e86cab35895490f2612fd71937baa2ff5b7d75bb2ee4dafb5efd656178dc00c1
+  metadata.gz: db53330f9e551fa8d09b60d743297c3c9cbf1ac3df66ced1ead0ecf252b8ddd8f02a0593effd9d0849314f9604b1d0560ff8f6f4b5fdea67fb306e86ba2c7aae
+  data.tar.gz: f635affad9b49b2179e8f176a714bb2f38fe49ade7254bfbf8dfcf2797c8939b33d8884a1ba28f77bf7343bb03a80be6f7ab62a79a4ee89b989a52d00434e136

data/README.md

@@ -2,8 +2,6 @@
 
 [![Gem Version](https://badge.fury.io/rb/rubocop-ast.svg)](https://badge.fury.io/rb/rubocop-ast)
 [![CI](https://github.com/rubocop/rubocop-ast/actions/workflows/rubocop.yml/badge.svg)](https://github.com/rubocop/rubocop-ast/actions/workflows/rubocop.yml)
-[![Test Coverage](https://api.codeclimate.com/v1/badges/a29666e6373bc41bc0a9/test_coverage)](https://codeclimate.com/github/rubocop/rubocop-ast/test_coverage)
-[![Maintainability](https://api.codeclimate.com/v1/badges/a29666e6373bc41bc0a9/maintainability)](https://codeclimate.com/github/rubocop/rubocop-ast/maintainability)
 
 Contains the classes needed by [RuboCop](https://github.com/rubocop/rubocop) to deal with Ruby's AST, in particular:
 

data/lib/rubocop/ast/builder.rb

@@ -2,20 +2,13 @@
 
 module RuboCop
   module AST
-    # `RuboCop::AST::Builder` is an AST builder that is utilized to let `Parser`
-    # generate ASTs with {RuboCop::AST::Node}.
-    #
-    # @example
-    #   buffer = Parser::Source::Buffer.new('(string)')
-    #   buffer.source = 'puts :foo'
-    #
-    #   builder = RuboCop::AST::Builder.new
-    #   require 'parser/ruby25'
-    #   parser = Parser::Ruby25.new(builder)
-    #   root_node = parser.parse(buffer)
-    class Builder < Parser::Builders::Default
-      self.emit_forward_arg = true if respond_to?(:emit_forward_arg=)
-      self.emit_match_pattern = true if respond_to?(:emit_match_pattern=)
+    # Common functionality between the parser and prism builder
+    # @api private
+    module BuilderExtensions
+      def self.included(base)
+        base.emit_forward_arg = true
+        base.emit_match_pattern = true
+      end
 
       # @api private
       NODE_MAP = {
@@ -39,11 +32,13 @@ module RuboCop
         gvasgn:              AsgnNode,
         block:               BlockNode,
         numblock:            BlockNode,
+        itblock:             BlockNode,
         break:               BreakNode,
         case_match:          CaseMatchNode,
         casgn:               CasgnNode,
         case:                CaseNode,
         class:               ClassNode,
+        complex:             ComplexNode,
         const:               ConstNode,
         def:                 DefNode,
         defined?:            DefinedNode,
@@ -107,7 +102,7 @@ module RuboCop
         node_klass(type).new(type, children, location: source_map)
       end
 
-      # TODO: Figure out what to do about literal encoding handling...
+      # Overwrite the base method to allow strings with invalid encoding
       # More details here https://github.com/whitequark/parser/issues/283
       def string_value(token)
         value(token)
@@ -119,5 +114,20 @@ module RuboCop
         NODE_MAP[type] || Node
       end
     end
+
+    # `RuboCop::AST::Builder` is an AST builder that is utilized to let `Parser`
+    # generate ASTs with {RuboCop::AST::Node}.
+    #
+    # @example
+    #   buffer = Parser::Source::Buffer.new('(string)')
+    #   buffer.source = 'puts :foo'
+    #
+    #   builder = RuboCop::AST::Builder.new
+    #   require 'parser/ruby25'
+    #   parser = Parser::Ruby25.new(builder)
+    #   root_node = parser.parse(buffer)
+    class Builder < Parser::Builders::Default
+      include BuilderExtensions
+    end
   end
 end

data/lib/rubocop/ast/builder_prism.rb

@@ -0,0 +1,11 @@
+# frozen_string_literal: true
+
+module RuboCop
+  module AST
+    # A parser builder, based on the one provided by prism,
+    # which is capable of emitting AST for more recent Rubies.
+    class BuilderPrism < Prism::Translation::Parser::Builder
+      include BuilderExtensions
+    end
+  end
+end

data/lib/rubocop/ast/node/block_node.rb

@@ -11,6 +11,8 @@ module RuboCop
     class BlockNode < Node
       include MethodIdentifierPredicates
 
+      IT_BLOCK_ARGUMENT = [ArgNode.new(:arg, [:it])].freeze
+      private_constant :IT_BLOCK_ARGUMENT
       VOID_CONTEXT_METHODS = %i[each tap].freeze
       private_constant :VOID_CONTEXT_METHODS
 
@@ -46,10 +48,10 @@ module RuboCop
       #
       # @return [Array<Node>]
       def arguments
-        if numblock_type?
-          [].freeze # Numbered parameters have no block arguments.
-        else
+        if block_type?
           node_parts[1]
+        else
+          [].freeze # Numblocks and itblocks have no explicit block arguments.
         end
       end
 
@@ -60,6 +62,8 @@ module RuboCop
       def argument_list
         if numblock_type?
           numbered_arguments
+        elsif itblock_type?
+          IT_BLOCK_ARGUMENT
         else
           arguments.argument_list
         end
@@ -153,10 +157,7 @@ module RuboCop
 
       private
 
-      # Numbered arguments of this `numblock`.
       def numbered_arguments
-        return [].freeze unless numblock_type?
-
         max_param = children[1]
         1.upto(max_param).map do |i|
           ArgNode.new(:arg, [:"_#{i}"])

data/lib/rubocop/ast/node/complex_node.rb

@@ -0,0 +1,13 @@
+# frozen_string_literal: true
+
+module RuboCop
+  module AST
+    # A node extension for `complex` nodes. This will be used in place of a plain
+    # node when the builder constructs the AST, making its methods available to
+    # all `complex` nodes within RuboCop.
+    class ComplexNode < Node
+      include BasicLiteralNode
+      include NumericNode
+    end
+  end
+end

data/lib/rubocop/ast/node/ensure_node.rb

@@ -6,11 +6,24 @@ module RuboCop
     # node when the builder constructs the AST, making its methods available
     # to all `ensure` nodes within RuboCop.
     class EnsureNode < Node
+      DEPRECATION_WARNING_LOCATION_CACHE = [] # rubocop:disable Style/MutableConstant
+      private_constant :DEPRECATION_WARNING_LOCATION_CACHE
+
       # Returns the body of the `ensure` clause.
       #
       # @return [Node, nil] The body of the `ensure`.
       # @deprecated Use `EnsureNode#branch`
       def body
+        first_caller = caller(1..1).first
+
+        unless DEPRECATION_WARNING_LOCATION_CACHE.include?(first_caller)
+          warn '`EnsureNode#body` is deprecated and will be changed in the next major version of ' \
+               'rubocop-ast. Use `EnsureNode#branch` instead to get the body of the `ensure` branch.'
+          warn "Called from:\n#{caller.join("\n")}\n\n"
+
+          DEPRECATION_WARNING_LOCATION_CACHE << first_caller
+        end
+
         branch
       end
 

data/lib/rubocop/ast/node/masgn_node.rb

@@ -20,7 +20,7 @@ module RuboCop
       # @return [Array<Symbol>] names of all the variables being assigned
       def names
         assignments.map do |assignment|
-          if assignment.send_type? || assignment.indexasgn_type?
+          if assignment.type?(:send, :indexasgn)
             assignment.method_name
           else
             assignment.name

data/lib/rubocop/ast/node/mixin/basic_literal_node.rb

@@ -3,7 +3,7 @@
 module RuboCop
   module AST
     # Common functionality for primitive literal nodes: `sym`, `str`,
-    # `int`, `float`, `rational`...
+    # `int`, `float`, `rational`, `complex`...
     module BasicLiteralNode
       # Returns the value of the literal.
       #

data/lib/rubocop/ast/node/mixin/hash_element_node.rb

@@ -99,7 +99,9 @@ module RuboCop
 
         def valid_argument_types?
           [first, second].all? do |argument|
+            # rubocop:disable InternalAffairs/NodeTypeMultiplePredicates
             argument.pair_type? || argument.kwsplat_type?
+            # rubocop:enable InternalAffairs/NodeTypeMultiplePredicates
           end
         end
 

data/lib/rubocop/ast/node/mixin/method_dispatch_node.rb

@@ -32,17 +32,17 @@ module RuboCop
       #
       # @return [Parser::Source::Range] the source range for the method name or keyword
       def selector
-        if loc.respond_to? :keyword
+        if loc?(:keyword)
           loc.keyword
         else
           loc.selector
         end
       end
 
-      # The `block` or `numblock` node associated with this method dispatch, if any.
+      # The `block`, `numblock`, or `itblock` node associated with this method dispatch, if any.
       #
-      # @return [BlockNode, nil] the `block` or `numblock` node associated with this method
-      #                          call or `nil`
+      # @return [BlockNode, nil] the `block`, `numblock`, or `itblock` node associated with this
+      #                          method call or `nil`
       def block_node
         parent if block_literal?
       end
@@ -200,8 +200,7 @@ module RuboCop
         arg = node.children[2]
 
         return unless node.send_type? && node.receiver.nil? && arg.is_a?(::AST::Node)
-
-        return arg if arg.def_type? || arg.defs_type?
+        return arg if arg.any_def_type?
 
         def_modifier(arg)
       end
@@ -271,7 +270,7 @@ module RuboCop
 
       # @!method adjacent_def_modifier?(node = self)
       def_node_matcher :adjacent_def_modifier?, <<~PATTERN
-        (send nil? _ ({def defs} ...))
+        (send nil? _ (any_def ...))
       PATTERN
 
       # @!method bare_access_modifier_declaration?(node = self)

data/lib/rubocop/ast/node/mixin/numeric_node.rb

@@ -2,7 +2,7 @@
 
 module RuboCop
   module AST
-    # Common functionality for primitive numeric nodes: `int`, `float`, `rational`...
+    # Common functionality for primitive numeric nodes: `int`, `float`, `rational`, `complex`...
     module NumericNode
       SIGN_REGEX = /\A[+-]/.freeze
       private_constant :SIGN_REGEX
@@ -15,7 +15,7 @@ module RuboCop
       #
       # @return [Boolean] whether this literal has a sign.
       def sign?
-        source.match(SIGN_REGEX)
+        source.match?(SIGN_REGEX)
       end
     end
   end

data/lib/rubocop/ast/node/mixin/parameterized_node.rb

@@ -57,7 +57,7 @@ module RuboCop
       # @return [Boolean] whether the last argument of the node is a block pass
       def block_argument?
         arguments? &&
-          (last_argument.block_pass_type? || last_argument.blockarg_type?)
+          last_argument.type?(:block_pass, :blockarg)
       end
 
       # A specialized `ParameterizedNode` for node that have a single child
@@ -65,6 +65,7 @@ module RuboCop
       # arguments
       module WrappedArguments
         include ParameterizedNode
+
         # @return [Array] The arguments of the node.
         def arguments
           first = children.first

data/lib/rubocop/ast/node.rb

@@ -87,6 +87,9 @@ module RuboCop
 
       # @api private
       GROUP_FOR_TYPE = {
+        def: :any_def,
+        defs: :any_def,
+
         arg: :argument,
         optarg: :argument,
         restarg: :argument,
@@ -105,6 +108,13 @@ module RuboCop
         rational: :numeric,
         complex: :numeric,
 
+        str: :any_str,
+        dstr: :any_str,
+        xstr: :any_str,
+
+        sym: :any_sym,
+        dsym: :any_sym,
+
         irange: :range,
         erange: :range,
 
@@ -112,7 +122,11 @@ module RuboCop
         csend: :call,
 
         block: :any_block,
-        numblock: :any_block
+        numblock: :any_block,
+        itblock: :any_block,
+
+        match_pattern: :any_match_pattern,
+        match_pattern_p: :any_match_pattern
       }.freeze
       private_constant :GROUP_FOR_TYPE
 
@@ -265,7 +279,7 @@ module RuboCop
       def right_siblings
         return [].freeze unless parent
 
-        parent.children[sibling_index + 1..].freeze
+        parent.children[(sibling_index + 1)..].freeze
       end
 
       # Common destructuring method. This can be used to normalize
@@ -512,6 +526,10 @@ module RuboCop
         parent&.send_type? && parent.arguments.include?(self)
       end
 
+      def any_def_type?
+        GROUP_FOR_TYPE[type] == :any_def
+      end
+
       def argument_type?
         GROUP_FOR_TYPE[type] == :argument
       end
@@ -532,6 +550,18 @@ module RuboCop
         GROUP_FOR_TYPE[type] == :any_block
       end
 
+      def any_match_pattern_type?
+        GROUP_FOR_TYPE[type] == :any_match_pattern
+      end
+
+      def any_str_type?
+        GROUP_FOR_TYPE[type] == :any_str
+      end
+
+      def any_sym_type?
+        GROUP_FOR_TYPE[type] == :any_sym
+      end
+
       def guard_clause?
         node = operator_keyword? ? rhs : self
 
@@ -685,7 +715,7 @@ module RuboCop
       def case_if_value_used?
         # (case <condition> <when...>)
         # (if <condition> <truebranch> <falsebranch>)
-        sibling_index.zero? ? true : parent.value_used?
+        sibling_index.zero? || parent.value_used?
       end
 
       def while_until_value_used?

data/lib/rubocop/ast/node_pattern/compiler/debug.rb

@@ -15,10 +15,12 @@ module RuboCop
               @visit = {}
             end
 
+            # rubocop:disable Naming/PredicateMethod
             def enter(node_id)
               @visit[node_id] = false
               true
             end
+            # rubocop:enable Naming/PredicateMethod
 
             def success(node_id)
               @visit[node_id] = true
@@ -109,14 +111,7 @@ module RuboCop
             private
 
             def ruby_ast(ruby)
-              buffer = ::Parser::Source::Buffer.new('(ruby)', source: ruby)
-              ruby_parser.parse(buffer)
-            end
-
-            def ruby_parser
-              require 'parser/current'
-              builder = ::RuboCop::AST::Builder.new
-              ::Parser::CurrentRuby.new(builder)
+              ProcessedSource.new(ruby, RUBY_VERSION.to_f, '(ruby)').ast
             end
           end
 

data/lib/rubocop/ast/node_pattern/compiler/sequence_subcompiler.rb

@@ -261,7 +261,7 @@ module RuboCop
             arities = children
                       .reverse
                       .map(&:arity_range)
-                      .map { |r| last = last.begin + r.begin..last.max + r.max }
+                      .map { |r| last = (last.begin + r.begin)..(last.max + r.max) }
                       .reverse!
             arities.push last_arity
           end

data/lib/rubocop/ast/node_pattern/compiler.rb

@@ -10,6 +10,7 @@ module RuboCop
       #   /docs/modules/ROOT/pages/node_pattern.adoc
       class Compiler
         extend SimpleForwardable
+
         attr_reader :captures, :named_parameters, :positional_parameters, :binding
 
         def initialize

data/lib/rubocop/ast/node_pattern/lexer.rex

@@ -21,7 +21,7 @@ macros
 rules
         /\s+/
         /:(#{SYMBOL_NAME})/o      { emit :tSYMBOL, &:to_sym }
-        /"(.+?)"/                 { emit :tSTRING }
+        /"(.*?)"/                 { emit :tSTRING }
         /[-+]?\d+\.\d+/           { emit :tNUMBER, &:to_f }
         /[-+]?\d+/                { emit :tNUMBER, &:to_i }
         /#{Regexp.union(

data/lib/rubocop/ast/node_pattern/lexer.rex.rb

@@ -122,7 +122,7 @@ class RuboCop::AST::NodePattern::LexerRex
             # do nothing
           when ss.skip(/:(#{SYMBOL_NAME})/o) then
             action { emit :tSYMBOL, &:to_sym }
-          when ss.skip(/"(.+?)"/) then
+          when ss.skip(/"(.*?)"/) then
             action { emit :tSTRING }
           when ss.skip(/[-+]?\d+\.\d+/) then
             action { emit :tNUMBER, &:to_f }

data/lib/rubocop/ast/node_pattern/node.rb

@@ -179,7 +179,7 @@ module RuboCop
         class AnyOrder < Node
           include ForbidInSeqHead
 
-          ARITIES = Hash.new { |h, k| h[k] = k - 1..Float::INFINITY }
+          ARITIES = Hash.new { |h, k| h[k] = (k - 1)..Float::INFINITY }
           private_constant :ARITIES
 
           def term_nodes

data/lib/rubocop/ast/node_pattern/parser.racc.rb

@@ -1,8 +1,8 @@
 # frozen_string_literal: true
 #
 # DO NOT MODIFY!!!!
-# This file is automatically generated by Racc 1.8.1
-# from Racc grammar file "parser.y".
+# This file is automatically generated by Racc 1.5.0
+# from Racc grammar file "".
 #
 
 require 'racc/parser.rb'
@@ -14,15 +14,15 @@ module RuboCop
 
 racc_action_table = [
     14,    15,    16,    21,    18,    17,    19,    10,    11,    12,
-    60,    22,    20,     4,    24,     5,    40,     6,     7,     8,
-    28,    23,    56,    50,    40,    61,    43,    66,    51,    51,
+    60,    22,    20,     4,    40,     5,    43,     6,     7,     8,
+    28,    23,    56,    50,    66,    61,    24,    51,    51,    40,
     58,    14,    15,    16,    21,    18,    17,    19,    10,    11,
     12,   nil,    22,    20,     4,   nil,     5,   nil,     6,     7,
      8,    28,    23,   nil,   nil,   -34,    14,    15,    16,    21,
     18,    17,    19,    10,    11,    12,   nil,    22,    20,     4,
    nil,     5,   nil,     6,     7,     8,     9,    23,    14,    15,
     16,    21,    18,    17,    19,    10,    11,    12,   nil,    22,
-    20,     4,   nil,     5,   nil,     6,     7,     8,    28,    23,
+    20,     4,   nil,     5,   nil,     6,     7,     8,     9,    23,
     14,    15,    16,    21,    18,    17,    19,    10,    11,    12,
    nil,    22,    20,     4,   nil,     5,   nil,     6,     7,     8,
      9,    23,    14,    15,    16,    21,    18,    17,    19,    10,
@@ -33,7 +33,7 @@ racc_action_table = [
     18,    17,    19,    10,    11,    12,   nil,    22,    20,     4,
    nil,     5,   nil,     6,     7,     8,     9,    23,    14,    15,
     16,    21,    18,    17,    19,    10,    11,    12,   nil,    22,
-    20,     4,   nil,     5,   nil,     6,     7,     8,     9,    23,
+    20,     4,   nil,     5,   nil,     6,     7,     8,    28,    23,
     14,    15,    16,    21,    18,    17,    19,    10,    11,    12,
    nil,    22,    20,     4,    44,     5,   nil,     6,     7,     8,
     28,    23,    14,    15,    16,    21,    18,    17,    19,    10,
@@ -47,31 +47,31 @@ racc_action_table = [
     20,     4,   nil,     5,   nil,     6,     7,     8,     9,    23,
     14,    15,    16,    21,    18,    17,    19,    10,    11,    12,
    nil,    22,    20,     4,   nil,     5,   nil,     6,     7,     8,
-     9,    23,    -1,    -1,    -1,    -2,    -2,    -2,    47,    48,
-    49 ]
+     9,    23,    47,    48,    49,    -1,    -1,    -1,    -2,    -2,
+    -2 ]
 
 racc_action_check = [
     42,    42,    42,    42,    42,    42,    42,    42,    42,    42,
-    54,    42,    42,    42,     1,    42,    10,    42,    42,    42,
-    42,    42,    42,    30,    11,    54,    24,    62,    30,    63,
+    54,    42,    42,    42,    11,    42,    24,    42,    42,    42,
+    42,    42,    42,    30,    62,    54,     1,    63,    30,    10,
     42,    59,    59,    59,    59,    59,    59,    59,    59,    59,
     59,   nil,    59,    59,    59,   nil,    59,   nil,    59,    59,
-    59,    59,    59,   nil,   nil,    59,     0,     0,     0,     0,
+    59,    59,    59,   nil,   nil,    59,     5,     5,     5,     5,
+     5,     5,     5,     5,     5,     5,   nil,     5,     5,     5,
+   nil,     5,   nil,     5,     5,     5,     5,     5,     6,     6,
+     6,     6,     6,     6,     6,     6,     6,     6,   nil,     6,
+     6,     6,   nil,     6,   nil,     6,     6,     6,     6,     6,
+     7,     7,     7,     7,     7,     7,     7,     7,     7,     7,
+   nil,     7,     7,     7,   nil,     7,   nil,     7,     7,     7,
+     7,     7,     8,     8,     8,     8,     8,     8,     8,     8,
+     8,     8,   nil,     8,     8,     8,   nil,     8,   nil,     8,
+     8,     8,     8,     8,     9,     9,     9,     9,     9,     9,
+     9,     9,     9,     9,   nil,     9,     9,     9,   nil,     9,
+   nil,     9,     9,     9,     9,     9,     0,     0,     0,     0,
      0,     0,     0,     0,     0,     0,   nil,     0,     0,     0,
    nil,     0,   nil,     0,     0,     0,     0,     0,     4,     4,
      4,     4,     4,     4,     4,     4,     4,     4,   nil,     4,
      4,     4,   nil,     4,   nil,     4,     4,     4,     4,     4,
-     5,     5,     5,     5,     5,     5,     5,     5,     5,     5,
-   nil,     5,     5,     5,   nil,     5,   nil,     5,     5,     5,
-     5,     5,     6,     6,     6,     6,     6,     6,     6,     6,
-     6,     6,   nil,     6,     6,     6,   nil,     6,   nil,     6,
-     6,     6,     6,     6,     7,     7,     7,     7,     7,     7,
-     7,     7,     7,     7,   nil,     7,     7,     7,   nil,     7,
-   nil,     7,     7,     7,     7,     7,     8,     8,     8,     8,
-     8,     8,     8,     8,     8,     8,   nil,     8,     8,     8,
-   nil,     8,   nil,     8,     8,     8,     8,     8,     9,     9,
-     9,     9,     9,     9,     9,     9,     9,     9,   nil,     9,
-     9,     9,   nil,     9,   nil,     9,     9,     9,     9,     9,
     27,    27,    27,    27,    27,    27,    27,    27,    27,    27,
    nil,    27,    27,    27,    27,    27,   nil,    27,    27,    27,
     27,    27,    28,    28,    28,    28,    28,    28,    28,    28,
@@ -85,17 +85,17 @@ racc_action_check = [
     50,    50,   nil,    50,   nil,    50,    50,    50,    50,    50,
     61,    61,    61,    61,    61,    61,    61,    61,    61,    61,
    nil,    61,    61,    61,   nil,    61,   nil,    61,    61,    61,
-    61,    61,    25,    25,    25,    26,    26,    26,    29,    29,
-    29 ]
+    61,    61,    29,    29,    29,    25,    25,    25,    26,    26,
+    26 ]
 
 racc_action_pointer = [
-    54,    14,   nil,   nil,    76,    98,   120,   142,   164,   186,
-     4,    12,   nil,   nil,   nil,   nil,   nil,   nil,   nil,   nil,
-   nil,   nil,   nil,   nil,    26,   315,   318,   208,   230,   321,
+   164,    26,   nil,   nil,   186,    54,    76,    98,   120,   142,
+    17,     2,   nil,   nil,   nil,   nil,   nil,   nil,   nil,   nil,
+   nil,   nil,   nil,   nil,    16,   318,   321,   208,   230,   315,
     -2,   nil,   nil,   252,   nil,   nil,   nil,   nil,   nil,   nil,
    274,   nil,    -2,   nil,   nil,   nil,   nil,   nil,   nil,   nil,
    296,   nil,   nil,   nil,    -6,   nil,   nil,   nil,   nil,    29,
-   nil,   318,     1,    -1,   nil,   nil,   nil ]
+   nil,   318,    -2,    -3,   nil,   nil,   nil ]
 
 racc_action_default = [
    -47,   -47,    -1,    -2,   -31,   -47,   -47,   -47,   -47,   -47,
@@ -107,26 +107,26 @@ racc_action_default = [
    -37,   -47,   -47,   -47,   -35,   -39,   -26 ]
 
 racc_goto_table = [
-     1,    33,    27,    25,    26,    34,    35,    36,    37,    38,
-    42,    32,    39,    41,    46,    63,    62,    64,    54,   nil,
-   nil,   nil,   nil,   nil,   nil,   nil,    25,    26,    38,   nil,
-   nil,   nil,   nil,    53,    45,   nil,   nil,   nil,   nil,   nil,
-    55,    25,    26,   nil,   nil,   nil,    59,   nil,   nil,    57,
+     1,    33,    64,    32,    25,    34,    35,    36,    37,    38,
+    54,    26,    39,    41,    27,    42,    46,    63,    62,   nil,
+   nil,   nil,   nil,   nil,   nil,   nil,    45,    25,    38,   nil,
+   nil,   nil,   nil,    53,    26,   nil,   nil,   nil,   nil,   nil,
+    55,    57,    25,   nil,   nil,   nil,    59,   nil,   nil,    26,
     34,   nil,   nil,   nil,   nil,   nil,   nil,   nil,   nil,    53,
    nil,    65 ]
 
 racc_goto_check = [
-     1,     5,     4,     2,     3,     1,     1,     1,     1,     1,
-     8,     9,     6,     6,    10,    11,    12,    13,    14,   nil,
-   nil,   nil,   nil,   nil,   nil,   nil,     2,     3,     1,   nil,
-   nil,   nil,   nil,     1,     9,   nil,   nil,   nil,   nil,   nil,
-     1,     2,     3,   nil,   nil,   nil,     5,   nil,   nil,     9,
+     1,     5,    13,     9,     2,     1,     1,     1,     1,     1,
+    14,     3,     6,     6,     4,     8,    10,    11,    12,   nil,
+   nil,   nil,   nil,   nil,   nil,   nil,     9,     2,     1,   nil,
+   nil,   nil,   nil,     1,     3,   nil,   nil,   nil,   nil,   nil,
+     1,     9,     2,   nil,   nil,   nil,     5,   nil,   nil,     3,
      1,   nil,   nil,   nil,   nil,   nil,   nil,   nil,   nil,     1,
    nil,     1 ]
 
 racc_goto_pointer = [
-   nil,     0,    -1,     0,    -2,    -4,     2,   nil,   -13,     7,
-   -15,   -44,   -43,   -42,   -22 ]
+   nil,     0,     0,     7,    10,    -4,     2,   nil,    -8,    -1,
+   -13,   -42,   -41,   -57,   -30 ]
 
 racc_goto_default = [
    nil,    29,     2,     3,   nil,   nil,   nil,    13,   nil,   nil,
@@ -239,7 +239,6 @@ Racc_arg = [
   racc_shift_n,
   racc_reduce_n,
   racc_use_result_var ]
-Ractor.make_shareable(Racc_arg) if defined?(Ractor)
 
 Racc_token_to_s_table = [
   "$end",
@@ -290,7 +289,6 @@ Racc_token_to_s_table = [
   "opt_rest",
   "rest",
   "arg_list" ]
-Ractor.make_shareable(Racc_token_to_s_table) if defined?(Ractor)
 
 Racc_debug_parser = false
 

data/lib/rubocop/ast/node_pattern.rb

@@ -50,6 +50,7 @@ module RuboCop
 
       extend SimpleForwardable
       include MethodDefiner
+
       Invalid = Class.new(StandardError)
 
       VAR = 'node'

data/lib/rubocop/ast/processed_source.rb

@@ -4,6 +4,27 @@ require 'digest/sha1'
 
 module RuboCop
   module AST
+    # A `Prism` interface's class that provides a fixed `Prism::ParseLexResult` instead of parsing.
+    #
+    # This class implements the `parse_lex` method to return a preparsed `Prism::ParseLexResult`
+    # rather than parsing the source code.  When the parse result is already available externally,
+    # such as in Ruby LSP, the Prism parsing process can be bypassed.
+    class PrismPreparsed
+      def initialize(prism_result)
+        unless prism_result.is_a?(Prism::ParseLexResult)
+          raise ArgumentError, <<~MESSAGE
+            Expected a `Prism::ParseLexResult` object, but received `#{prism_result.class}`.
+          MESSAGE
+        end
+
+        @prism_result = prism_result
+      end
+
+      def parse_lex(_source, **_prism_options)
+        @prism_result
+      end
+    end
+
     # ProcessedSource contains objects which are generated by Parser
     # and other information such as disabled lines for cops.
     # It also provides a convenient way to access source lines.
@@ -14,23 +35,21 @@ module RuboCop
       INVALID_LEVELS = %i[error fatal].freeze
       private_constant :INVALID_LEVELS
 
-      PARSER_ENGINES = %i[parser_whitequark parser_prism].freeze
+      PARSER_ENGINES = %i[default parser_whitequark parser_prism].freeze
       private_constant :PARSER_ENGINES
 
       attr_reader :path, :buffer, :ast, :comments, :tokens, :diagnostics,
                   :parser_error, :raw_source, :ruby_version, :parser_engine
 
-      def self.from_file(path, ruby_version, parser_engine: :parser_whitequark)
+      def self.from_file(path, ruby_version, parser_engine: :default)
         file = File.read(path, mode: 'rb')
         new(file, ruby_version, path, parser_engine: parser_engine)
       end
 
-      def initialize(source, ruby_version, path = nil, parser_engine: :parser_whitequark)
-        parser_engine = parser_engine.to_sym
-        unless PARSER_ENGINES.include?(parser_engine)
-          raise ArgumentError, 'The keyword argument `parser_engine` accepts `parser_whitequark` ' \
-                               "or `parser_prism`, but `#{parser_engine}` was passed."
-        end
+      def initialize(
+        source, ruby_version, path = nil, parser_engine: :default, prism_result: nil
+      )
+        parser_engine = normalize_parser_engine(parser_engine, ruby_version)
 
         # Defaults source encoding to UTF-8, regardless of the encoding it has
         # been read with, which could be non-utf8 depending on the default
@@ -44,7 +63,7 @@ module RuboCop
         @parser_engine = parser_engine
         @parser_error = nil
 
-        parse(source, ruby_version, parser_engine)
+        parse(source, ruby_version, parser_engine, prism_result)
       end
 
       def ast_with_comments
@@ -202,7 +221,7 @@ module RuboCop
         end
       end
 
-      def parse(source, ruby_version, parser_engine)
+      def parse(source, ruby_version, parser_engine, prism_result)
         buffer_name = @path || STRING_SOURCE_NAME
         @buffer = Parser::Source::Buffer.new(buffer_name, 1)
 
@@ -216,7 +235,9 @@ module RuboCop
           return
         end
 
-        @ast, @comments, @tokens = tokenize(create_parser(ruby_version, parser_engine))
+        parser = create_parser(ruby_version, parser_engine, prism_result)
+
+        @ast, @comments, @tokens = tokenize(parser)
       end
 
       def tokenize(parser)
@@ -235,7 +256,8 @@ module RuboCop
         [ast, comments, tokens]
       end
 
-      def parser_class(ruby_version, parser_engine) # rubocop:disable Metrics/AbcSize, Metrics/CyclomaticComplexity, Metrics/MethodLength
+      # rubocop:disable Lint/FloatComparison, Metrics/AbcSize, Metrics/CyclomaticComplexity, Metrics/MethodLength
+      def parser_class(ruby_version, parser_engine)
         case parser_engine
         when :parser_whitequark
           case ruby_version
@@ -282,54 +304,53 @@ module RuboCop
             require 'parser/ruby34'
             Parser::Ruby34
           else
-            raise ArgumentError, "RuboCop found unknown Ruby version: #{ruby_version.inspect}"
+            raise ArgumentError, 'RuboCop supports target Ruby versions 3.4 and below with ' \
+                                 "`parser`. Specified target Ruby version: #{ruby_version.inspect}"
           end
         when :parser_prism
-          require_prism
-
           case ruby_version
           when 3.3
-            require_prism_translation_parser(ruby_version)
             Prism::Translation::Parser33
           when 3.4
-            require_prism_translation_parser(ruby_version)
             Prism::Translation::Parser34
+          when 3.5, 4.0
+            Prism::Translation::Parser40
+          when 4.1
+            Prism::Translation::Parser41
           else
             raise ArgumentError, 'RuboCop supports target Ruby versions 3.3 and above with Prism. ' \
                                  "Specified target Ruby version: #{ruby_version.inspect}"
           end
         end
       end
+      # rubocop:enable Lint/FloatComparison, Metrics/AbcSize, Metrics/CyclomaticComplexity, Metrics/MethodLength
 
-      # Prism is a native extension, a `LoadError` will be raised if linked to an incompatible
-      # Ruby version. Only raise if it really was caused by Prism not being present.
-      def require_prism
-        require 'prism'
-      rescue LoadError => e
-        raise unless e.path == 'prism'
-
-        warn "Error: Unable to load Prism. Add `gem 'prism'` to your Gemfile."
-        exit!
+      def builder_class(parser_engine)
+        case parser_engine
+        when :parser_whitequark
+          RuboCop::AST::Builder
+        when :parser_prism
+          RuboCop::AST::BuilderPrism
+        end
       end
 
-      # While Prism is not yet a dependency, users may run with outdated versions that
-      # don't have all the parsers.
-      def require_prism_translation_parser(version)
-        require "prism/translation/parser#{version.to_s.delete('.')}"
-      rescue LoadError
-        warn <<~MESSAGE
-          Error: Unable to load Prism parser for Ruby #{version}.
-          * If you're using Bundler and don't yet have `gem 'prism'` as a dependency, add it now.
-          * If you're using Bundler and already have `gem 'prism'` as a dependency, update it to the most recent version.
-          * If you don't use Bundler, run `gem update prism`.
-        MESSAGE
-        exit!
-      end
+      # rubocop:disable Metrics/AbcSize, Metrics/MethodLength
+      def create_parser(ruby_version, parser_engine, prism_result)
+        builder = builder_class(parser_engine).new
+
+        parser_class = parser_class(ruby_version, parser_engine)
 
-      def create_parser(ruby_version, parser_engine)
-        builder = RuboCop::AST::Builder.new
+        parser_instance = if parser_engine == :parser_prism && prism_result
+                            # NOTE: Since it is intended for use with Ruby LSP, it targets only Prism.
+                            # If there is no reuse of a pre-parsed result, such as in Ruby LSP,
+                            # regular parsing with Prism occurs, and `else` branch will be executed.
+                            prism_reparsed = PrismPreparsed.new(prism_result)
+                            parser_class.new(builder, parser: prism_reparsed)
+                          else
+                            parser_class.new(builder)
+                          end
 
-        parser_class(ruby_version, parser_engine).new(builder).tap do |parser|
+        parser_instance.tap do |parser|
           # On JRuby there's a risk that we hang in tokenize() if we
           # don't set the all errors as fatal flag. The problem is caused by a bug
           # in Racc that is discussed in issue #93 of the whitequark/parser
@@ -341,6 +362,32 @@ module RuboCop
           end
         end
       end
+      # rubocop:enable Metrics/AbcSize, Metrics/MethodLength
+
+      def normalize_parser_engine(parser_engine, ruby_version)
+        parser_engine = parser_engine.to_sym
+        unless PARSER_ENGINES.include?(parser_engine)
+          raise ArgumentError, 'The keyword argument `parser_engine` accepts `default`, ' \
+                               "`parser_whitequark`, or `parser_prism`, but `#{parser_engine}` " \
+                               'was passed.'
+        end
+        if parser_engine == :default
+          default_parser_engine(ruby_version)
+        else
+          parser_engine
+        end
+      end
+
+      # The Parser gem does not support Ruby 3.5 or later.
+      # It is also not fully compatible with Ruby 3.4 but for
+      # now respects using parser for backwards compatibility.
+      def default_parser_engine(ruby_version)
+        if ruby_version >= 3.4
+          :parser_prism
+        else
+          :parser_whitequark
+        end
+      end
 
       def first_token_index(range_or_node)
         begin_pos = source_range(range_or_node).begin_pos

data/lib/rubocop/ast/traversal.rb

@@ -26,16 +26,18 @@ module RuboCop
         SEND = 'send(TYPE_TO_METHOD[child.type], child)'
         assign_code = 'child = node.children[%<index>i]'
         code = "#{assign_code}\n#{SEND}"
+        # How a particular child node should be visited. For example, if a child node
+        # can be nil it should be guarded behind a nil check. Or, if a child node is a literal
+        # (like a symbol) then the literal itself should not be visited.
         TEMPLATE = {
           skip: '',
           always: code,
           nil?: "#{code} if child"
         }.freeze
 
-        def def_callback(type, *signature,
-                         arity: signature.size..signature.size,
-                         arity_check: ENV.fetch('RUBOCOP_DEBUG', nil) && self.arity_check(arity),
-                         body: self.body(signature, arity_check))
+        def def_callback(type, *child_node_types,
+                         expected_children_count: child_node_types.size..child_node_types.size,
+                         body: self.body(child_node_types, expected_children_count))
           type, *aliases = type
           lineno = caller_locations(1, 1).first.lineno
           module_eval(<<~RUBY, __FILE__, lineno)
@@ -49,16 +51,23 @@ module RuboCop
           end
         end
 
-        def body(signature, prelude)
-          signature
-            .map.with_index do |arg, i|
-              TEMPLATE[arg].gsub('%<index>i', i.to_s)
+        def body(child_node_types, expected_children_count)
+          visit_children_code =
+            child_node_types
+            .map.with_index do |child_type, i|
+              TEMPLATE.fetch(child_type).gsub('%<index>i', i.to_s)
             end
-            .unshift(prelude)
             .join("\n")
+
+          <<~BODY
+            #{children_count_check_code(expected_children_count)}
+            #{visit_children_code}
+          BODY
         end
 
-        def arity_check(range)
+        def children_count_check_code(range)
+          return '' unless ENV.fetch('RUBOCOP_DEBUG', false)
+
           <<~RUBY
             n = node.children.size
             raise DebugError, [
@@ -70,20 +79,21 @@ module RuboCop
       end
       private_constant :CallbackCompiler
       extend CallbackCompiler
+
       send_code = CallbackCompiler::SEND
 
-      ### arity == 0
+      ### children count == 0
       no_children = %i[true false nil self cbase zsuper redo retry
                        forward_args forwarded_args match_nil_pattern
                        forward_arg forwarded_restarg forwarded_kwrestarg
                        lambda empty_else kwnilarg
                        __FILE__ __LINE__ __ENCODING__]
 
-      ### arity == 0..1
+      ### children count == 0..1
       opt_symbol_child = %i[restarg kwrestarg]
       opt_node_child = %i[splat kwsplat match_rest]
 
-      ### arity == 1
+      ### children count == 1
       literal_child = %i[int float complex
                          rational str sym lvar
                          ivar cvar gvar nth_ref back_ref
@@ -100,16 +110,16 @@ module RuboCop
       NO_CHILD_NODES = (no_children + opt_symbol_child + literal_child).to_set.freeze
       private_constant :NO_CHILD_NODES # Used by Commissioner
 
-      ### arity > 1
+      ### children count > 1
       symbol_then_opt_node = %i[lvasgn ivasgn cvasgn gvasgn]
       symbol_then_node_or_nil = %i[optarg kwoptarg]
       node_then_opt_node = %i[while until module sclass]
 
-      ### variable arity
+      ### variable children count
       many_node_children = %i[dstr dsym xstr regexp array hash pair
                               mlhs masgn or_asgn and_asgn rasgn mrasgn
                               undef alias args super yield or and
-                              while_post until_post iflipflop eflipflop
+                              while_post until_post
                               match_with_lvasgn begin kwbegin return
                               in_match match_alt break next
                               match_as array_pattern array_pattern_with_tail
@@ -117,22 +127,22 @@ module RuboCop
                               index indexasgn procarg0 kwargs]
       many_opt_node_children = %i[case rescue resbody ensure for when
                                   case_match in_pattern irange erange
-                                  match_pattern match_pattern_p]
+                                  match_pattern match_pattern_p iflipflop eflipflop]
 
       ### Callbacks for above
       def_callback no_children
-      def_callback opt_symbol_child, :skip, arity: 0..1
-      def_callback opt_node_child, :nil?, arity: 0..1
+      def_callback opt_symbol_child, :skip, expected_children_count: 0..1
+      def_callback opt_node_child, :nil?, expected_children_count: 0..1
 
       def_callback literal_child, :skip
       def_callback node_child, :always
       def_callback node_or_nil_child, :nil?
 
-      def_callback symbol_then_opt_node, :skip, :nil?, arity: 1..2
+      def_callback symbol_then_opt_node, :skip, :nil?, expected_children_count: 1..2
       def_callback symbol_then_node_or_nil, :skip, :nil?
       def_callback node_then_opt_node, :always, :nil?
 
-      def_callback many_symbol_children, :skip, arity_check: nil
+      def_callback many_symbol_children, :skip, expected_children_count: (0..)
       def_callback many_node_children, body: <<~RUBY
         node.children.each { |child| #{send_code} }
       RUBY
@@ -143,13 +153,14 @@ module RuboCop
 
       ### Other particular cases
       def_callback :const, :nil?, :skip
-      def_callback :casgn, :nil?, :skip, :nil?, arity: 2..3
+      def_callback :casgn, :nil?, :skip, :nil?, expected_children_count: 2..3
       def_callback :class, :always, :nil?, :nil?
       def_callback :def, :skip, :always, :nil?
       def_callback :op_asgn, :always, :skip, :always
       def_callback :if, :always, :nil?, :nil?
       def_callback :block, :always, :always, :nil?
       def_callback :numblock, :always, :skip, :nil?
+      def_callback :itblock, :always, :skip, :nil?
       def_callback :defs, :always, :skip, :always, :nil?
 
       def_callback %i[send csend], body: <<~RUBY
@@ -167,7 +178,7 @@ module RuboCop
 
       to_define = ::Parser::Meta::NODE_TYPES.to_a
       to_define -= defined
-      to_define -= %i[numargs ident] # transient
+      to_define -= %i[numargs itarg ident] # transient
       to_define -= %i[blockarg_expr restarg_expr] # obsolete
       to_define -= %i[objc_kwarg objc_restarg objc_varargs] # mac_ruby
       def_callback to_define, body: <<~RUBY

data/lib/rubocop/ast/utilities/simple_forwardable.rb

@@ -5,11 +5,22 @@ module RuboCop
   module SimpleForwardable
     def def_delegators(accessor, *methods)
       methods.each do |method|
-        class_eval(<<~RUBY, __FILE__, __LINE__ + 1)
-          def #{method}(...)           # def example(...)
-            #{accessor}.#{method}(...) #   foo.example(...)
-          end                          # end
-        RUBY
+        if method.end_with?('=') && method.to_s != '[]='
+          # Defining a delegator for `foo=` can't use `foo=(...)` because it is a
+          # syntax error. Fall back to doing a slower `public_send` instead.
+          # TODO: Use foo(method, ...) when Ruby 3.1 is required.
+          class_eval(<<~RUBY, __FILE__, __LINE__ + 1)
+            def #{method}(*args, **kwargs, &blk)                         # def example=(*args, **kwargs, &blk)
+              #{accessor}.public_send(:#{method}, *args, **kwargs, &blk) #   foo.public_send(:example=, *args, **kwargs, &blk)
+            end                                                          # end
+          RUBY
+        else
+          class_eval(<<~RUBY, __FILE__, __LINE__ + 1)
+            def #{method}(...)           # def example(...)
+              #{accessor}.#{method}(...) #   foo.example(...)
+            end                          # end
+          RUBY
+        end
       end
     end
   end

data/lib/rubocop/ast/version.rb

@@ -3,7 +3,7 @@
 module RuboCop
   module AST
     module Version
-      STRING = '1.38.0'
+      STRING = '1.49.0'
     end
   end
 end

data/lib/rubocop/ast.rb

@@ -1,6 +1,7 @@
 # frozen_string_literal: true
 
 require 'parser'
+require 'prism'
 require 'forwardable'
 require 'set'
 
@@ -47,6 +48,7 @@ require_relative 'ast/node/case_match_node'
 require_relative 'ast/node/case_node'
 require_relative 'ast/node/casgn_node'
 require_relative 'ast/node/class_node'
+require_relative 'ast/node/complex_node'
 require_relative 'ast/node/const_node'
 require_relative 'ast/node/def_node'
 require_relative 'ast/node/defined_node'
@@ -92,6 +94,7 @@ require_relative 'ast/node/when_node'
 require_relative 'ast/node/while_node'
 require_relative 'ast/node/yield_node'
 require_relative 'ast/builder'
+require_relative 'ast/builder_prism'
 require_relative 'ast/processed_source'
 require_relative 'ast/rubocop_compatibility'
 require_relative 'ast/token'

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: rubocop-ast
 version: !ruby/object:Gem::Version
-  version: 1.38.0
+  version: 1.49.0
 platform: ruby
 authors:
 - Bozhidar Batsov
@@ -10,7 +10,7 @@ authors:
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2025-01-27 00:00:00.000000000 Z
+date: 2025-12-28 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: parser
@@ -18,14 +18,28 @@ dependencies:
     requirements:
     - - ">="
       - !ruby/object:Gem::Version
-        version: 3.3.1.0
+        version: 3.3.7.2
   type: :runtime
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - ">="
       - !ruby/object:Gem::Version
-        version: 3.3.1.0
+        version: 3.3.7.2
+- !ruby/object:Gem::Dependency
+  name: prism
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.7'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.7'
 description: "    RuboCop's Node and NodePattern classes.\n"
 email: rubocop@googlegroups.com
 executables: []
@@ -39,6 +53,7 @@ files:
 - lib/rubocop-ast.rb
 - lib/rubocop/ast.rb
 - lib/rubocop/ast/builder.rb
+- lib/rubocop/ast/builder_prism.rb
 - lib/rubocop/ast/ext/range.rb
 - lib/rubocop/ast/node.rb
 - lib/rubocop/ast/node/alias_node.rb
@@ -54,6 +69,7 @@ files:
 - lib/rubocop/ast/node/case_node.rb
 - lib/rubocop/ast/node/casgn_node.rb
 - lib/rubocop/ast/node/class_node.rb
+- lib/rubocop/ast/node/complex_node.rb
 - lib/rubocop/ast/node/const_node.rb
 - lib/rubocop/ast/node/csend_node.rb
 - lib/rubocop/ast/node/def_node.rb
@@ -162,7 +178,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.5.11
+rubygems_version: 3.5.22
 signing_key:
 specification_version: 4
 summary: RuboCop tools to deal with Ruby code AST.