visualize_packwerk 0.0.1

data/sorbet/rbi/gems/parser@3.1.2.0.rbi

@@ -0,0 +1,4261 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `parser` gem.
+# Please instead update this file by running `bin/tapioca gem parser`.
+
+# @api public
+module Parser; end
+
+# @api public
+module Parser::AST; end
+
+# {Parser::AST::Node} contains information about a single AST node and its
+# child nodes. It extends the basic [AST::Node](http://rdoc.info/gems/ast/AST/Node)
+# class provided by gem [ast](http://rdoc.info/gems/ast).
+#
+# @api public
+class Parser::AST::Node < ::AST::Node
+  # Assigns various properties to this AST node. Currently only the
+  # location can be set.
+  #
+  # @api public
+  # @option properties
+  # @param properties [Hash]
+  def assign_properties(properties); end
+
+  # Source map for this Node.
+  #
+  # @api public
+  # @return [Parser::Source::Map]
+  def loc; end
+
+  # Source map for this Node.
+  #
+  # @api public
+  # @return [Parser::Source::Map]
+  def location; end
+end
+
+# @api public
+class Parser::AST::Processor < ::AST::Processor
+  # @api public
+  def on_alias(node); end
+
+  # @api public
+  def on_and(node); end
+
+  # @api public
+  def on_and_asgn(node); end
+
+  # @api public
+  # @private
+  def on_arg(node); end
+
+  # @api public
+  def on_arg_expr(node); end
+
+  # @api public
+  def on_args(node); end
+
+  # @api public
+  def on_argument(node); end
+
+  # @api public
+  def on_array(node); end
+
+  # @api public
+  def on_array_pattern(node); end
+
+  # @api public
+  def on_array_pattern_with_tail(node); end
+
+  # @api public
+  # @private
+  def on_back_ref(node); end
+
+  # @api public
+  def on_begin(node); end
+
+  # @api public
+  def on_block(node); end
+
+  # @api public
+  def on_block_pass(node); end
+
+  # @api public
+  # @private
+  def on_blockarg(node); end
+
+  # @api public
+  def on_blockarg_expr(node); end
+
+  # @api public
+  def on_break(node); end
+
+  # @api public
+  def on_case(node); end
+
+  # @api public
+  def on_case_match(node); end
+
+  # @api public
+  def on_casgn(node); end
+
+  # @api public
+  def on_class(node); end
+
+  # @api public
+  def on_const(node); end
+
+  # @api public
+  def on_const_pattern(node); end
+
+  # @api public
+  def on_csend(node); end
+
+  # @api public
+  # @private
+  def on_cvar(node); end
+
+  # @api public
+  # @private
+  def on_cvasgn(node); end
+
+  # @api public
+  def on_def(node); end
+
+  # @api public
+  def on_defined?(node); end
+
+  # @api public
+  def on_defs(node); end
+
+  # @api public
+  def on_dstr(node); end
+
+  # @api public
+  def on_dsym(node); end
+
+  # @api public
+  def on_eflipflop(node); end
+
+  # @api public
+  def on_empty_else(node); end
+
+  # @api public
+  def on_ensure(node); end
+
+  # @api public
+  def on_erange(node); end
+
+  # @api public
+  def on_find_pattern(node); end
+
+  # @api public
+  def on_for(node); end
+
+  # @api public
+  # @private
+  def on_forward_arg(node); end
+
+  # @api public
+  # @private
+  def on_gvar(node); end
+
+  # @api public
+  # @private
+  def on_gvasgn(node); end
+
+  # @api public
+  def on_hash(node); end
+
+  # @api public
+  def on_hash_pattern(node); end
+
+  # @api public
+  def on_if(node); end
+
+  # @api public
+  def on_if_guard(node); end
+
+  # @api public
+  def on_iflipflop(node); end
+
+  # @api public
+  def on_in_match(node); end
+
+  # @api public
+  def on_in_pattern(node); end
+
+  # @api public
+  def on_index(node); end
+
+  # @api public
+  def on_indexasgn(node); end
+
+  # @api public
+  def on_irange(node); end
+
+  # @api public
+  # @private
+  def on_ivar(node); end
+
+  # @api public
+  # @private
+  def on_ivasgn(node); end
+
+  # @api public
+  # @private
+  def on_kwarg(node); end
+
+  # @api public
+  def on_kwargs(node); end
+
+  # @api public
+  def on_kwbegin(node); end
+
+  # @api public
+  # @private
+  def on_kwoptarg(node); end
+
+  # @api public
+  # @private
+  def on_kwrestarg(node); end
+
+  # @api public
+  def on_kwsplat(node); end
+
+  # @api public
+  def on_lambda(node); end
+
+  # @api public
+  # @private
+  def on_lvar(node); end
+
+  # @api public
+  # @private
+  def on_lvasgn(node); end
+
+  # @api public
+  def on_masgn(node); end
+
+  # @api public
+  def on_match_alt(node); end
+
+  # @api public
+  def on_match_as(node); end
+
+  # @api public
+  def on_match_current_line(node); end
+
+  # @api public
+  def on_match_pattern(node); end
+
+  # @api public
+  def on_match_pattern_p(node); end
+
+  # @api public
+  def on_match_rest(node); end
+
+  # @api public
+  # @private
+  def on_match_var(node); end
+
+  # @api public
+  def on_match_with_lvasgn(node); end
+
+  # @api public
+  def on_mlhs(node); end
+
+  # @api public
+  def on_module(node); end
+
+  # @api public
+  def on_next(node); end
+
+  # @api public
+  def on_not(node); end
+
+  # @api public
+  # @private
+  def on_nth_ref(node); end
+
+  # @api public
+  def on_numblock(node); end
+
+  # @api public
+  def on_op_asgn(node); end
+
+  # @api public
+  # @private
+  def on_optarg(node); end
+
+  # @api public
+  def on_or(node); end
+
+  # @api public
+  def on_or_asgn(node); end
+
+  # @api public
+  def on_pair(node); end
+
+  # @api public
+  def on_pin(node); end
+
+  # @api public
+  def on_postexe(node); end
+
+  # @api public
+  def on_preexe(node); end
+
+  # @api public
+  def on_procarg0(node); end
+
+  # @api public
+  def on_redo(node); end
+
+  # @api public
+  def on_regexp(node); end
+
+  # @api public
+  def on_resbody(node); end
+
+  # @api public
+  def on_rescue(node); end
+
+  # @api public
+  # @private
+  def on_restarg(node); end
+
+  # @api public
+  def on_restarg_expr(node); end
+
+  # @api public
+  def on_retry(node); end
+
+  # @api public
+  def on_return(node); end
+
+  # @api public
+  def on_sclass(node); end
+
+  # @api public
+  def on_send(node); end
+
+  # @api public
+  # @private
+  def on_shadowarg(node); end
+
+  # @api public
+  def on_splat(node); end
+
+  # @api public
+  def on_super(node); end
+
+  # @api public
+  def on_undef(node); end
+
+  # @api public
+  def on_unless_guard(node); end
+
+  # @api public
+  def on_until(node); end
+
+  # @api public
+  def on_until_post(node); end
+
+  # @api public
+  def on_var(node); end
+
+  # @api public
+  def on_vasgn(node); end
+
+  # @api public
+  def on_when(node); end
+
+  # @api public
+  def on_while(node); end
+
+  # @api public
+  def on_while_post(node); end
+
+  # @api public
+  def on_xstr(node); end
+
+  # @api public
+  def on_yield(node); end
+
+  # @api public
+  # @private
+  def process_argument_node(node); end
+
+  # @api public
+  def process_regular_node(node); end
+
+  # @api public
+  # @private
+  def process_var_asgn_node(node); end
+
+  # @api public
+  # @private
+  def process_variable_node(node); end
+end
+
+# Base class for version-specific parsers.
+#
+# @api public
+class Parser::Base < ::Racc::Parser
+  # @api public
+  # @param builder [Parser::Builders::Default] The AST builder to use.
+  # @return [Base] a new instance of Base
+  def initialize(builder = T.unsafe(nil)); end
+
+  # @api public
+  def builder; end
+
+  # @api public
+  def context; end
+
+  # @api public
+  def current_arg_stack; end
+
+  # @api public
+  # @return [Parser::Diagnostic::Engine]
+  def diagnostics; end
+
+  # @api public
+  def lexer; end
+
+  # @api public
+  def max_numparam_stack; end
+
+  # Parses a source buffer and returns the AST, or `nil` in case of a non fatal error.
+  #
+  # @api public
+  # @param source_buffer [Parser::Source::Buffer] The source buffer to parse.
+  # @return [Parser::AST::Node, nil]
+  def parse(source_buffer); end
+
+  # Parses a source buffer and returns the AST and the source code comments.
+  #
+  # @api public
+  # @return [Array]
+  # @see #parse
+  # @see Parser::Source::Comment#associate
+  def parse_with_comments(source_buffer); end
+
+  # @api public
+  def pattern_hash_keys; end
+
+  # @api public
+  def pattern_variables; end
+
+  # Resets the state of the parser.
+  #
+  # @api public
+  def reset; end
+
+  # @api public
+  def source_buffer; end
+
+  # @api public
+  # @return [Parser::StaticEnvironment]
+  def static_env; end
+
+  # Parses a source buffer and returns the AST, the source code comments,
+  # and the tokens emitted by the lexer. In case of a fatal error, a {SyntaxError}
+  # is raised, unless `recover` is true. In case of an error
+  # (non-fatal or recovered), `nil` is returned instead of the AST, and
+  # comments as well as tokens are only returned up to the location of
+  # the error.
+  #
+  # Currently, token stream format returned by #tokenize is not documented,
+  # but is considered part of a public API and only changed according
+  # to Semantic Versioning.
+  #
+  # However, note that the exact token composition of various constructs
+  # might vary. For example, a string `"foo"` is represented equally well
+  # by `:tSTRING_BEG " :tSTRING_CONTENT foo :tSTRING_END "` and
+  # `:tSTRING "foo"`; such details must not be relied upon.
+  #
+  # @api public
+  # @param source_buffer [Parser::Source::Buffer]
+  # @param recover [Boolean] If true, recover from syntax errors. False by default.
+  # @return [Array]
+  def tokenize(source_buffer, recover = T.unsafe(nil)); end
+
+  private
+
+  # @api public
+  def check_kwarg_name(name_t); end
+
+  # @api public
+  def diagnostic(level, reason, arguments, location_t, highlights_ts = T.unsafe(nil)); end
+
+  # @api public
+  def next_token; end
+
+  # @api public
+  def on_error(error_token_id, error_value, value_stack); end
+
+  class << self
+    # @api public
+    # @return [Parser::Base] parser with the default options set.
+    def default_parser; end
+
+    # Parses a string of Ruby code and returns the AST. If the source
+    # cannot be parsed, {SyntaxError} is raised and a diagnostic is
+    # printed to `stderr`.
+    #
+    # @api public
+    # @example
+    #   Parser::Base.parse('puts "hello"')
+    # @param string [String] The block of code to parse.
+    # @param file [String] The name of the file the code originated from.
+    # @param line [Numeric] The initial line number.
+    # @return [Parser::AST::Node]
+    def parse(string, file = T.unsafe(nil), line = T.unsafe(nil)); end
+
+    # Parses Ruby source code by reading it from a file. If the source
+    # cannot be parsed, {SyntaxError} is raised and a diagnostic is
+    # printed to `stderr`.
+    #
+    # @api public
+    # @param filename [String] Path to the file to parse.
+    # @return [Parser::AST::Node]
+    # @see #parse
+    def parse_file(filename); end
+
+    # Parses Ruby source code by reading it from a file and returns the AST and
+    # comments. If the source cannot be parsed, {SyntaxError} is raised and a
+    # diagnostic is printed to `stderr`.
+    #
+    # @api public
+    # @param filename [String] Path to the file to parse.
+    # @return [Array]
+    # @see #parse
+    def parse_file_with_comments(filename); end
+
+    # Parses a string of Ruby code and returns the AST and comments. If the
+    # source cannot be parsed, {SyntaxError} is raised and a diagnostic is
+    # printed to `stderr`.
+    #
+    # @api public
+    # @example
+    #   Parser::Base.parse_with_comments('puts "hello"')
+    # @param string [String] The block of code to parse.
+    # @param file [String] The name of the file the code originated from.
+    # @param line [Numeric] The initial line number.
+    # @return [Array]
+    def parse_with_comments(string, file = T.unsafe(nil), line = T.unsafe(nil)); end
+
+    private
+
+    # @api public
+    def setup_source_buffer(file, line, string, encoding); end
+  end
+end
+
+# @api public
+module Parser::Builders; end
+
+# Default AST builder. Uses {AST::Node}s.
+#
+# @api public
+class Parser::Builders::Default
+  # Initializes attributes:
+  #
+  #   * `emit_file_line_as_literals`: `true`
+  #
+  # @api public
+  # @return [Default] a new instance of Default
+  def initialize; end
+
+  # @api public
+  def __ENCODING__(__ENCODING__t); end
+
+  # @api public
+  def __FILE__(__FILE__t); end
+
+  # @api public
+  def __LINE__(__LINE__t); end
+
+  # @api public
+  def accessible(node); end
+
+  # @api public
+  def alias(alias_t, to, from); end
+
+  # @api public
+  def arg(name_t); end
+
+  # Ruby 1.8 block arguments
+  #
+  # @api public
+  def arg_expr(expr); end
+
+  # Formal arguments
+  #
+  # @api public
+  def args(begin_t, args, end_t, check_args = T.unsafe(nil)); end
+
+  # Arrays
+  #
+  # @api public
+  def array(begin_t, elements, end_t); end
+
+  # @api public
+  def array_pattern(lbrack_t, elements, rbrack_t); end
+
+  # @api public
+  def assign(lhs, eql_t, rhs); end
+
+  # Assignment
+  #
+  # @api public
+  def assignable(node); end
+
+  # @api public
+  def associate(begin_t, pairs, end_t); end
+
+  # @api public
+  def attr_asgn(receiver, dot_t, selector_t); end
+
+  # @api public
+  def back_ref(token); end
+
+  # @api public
+  def begin(begin_t, body, end_t); end
+
+  # @api public
+  def begin_body(compound_stmt, rescue_bodies = T.unsafe(nil), else_t = T.unsafe(nil), else_ = T.unsafe(nil), ensure_t = T.unsafe(nil), ensure_ = T.unsafe(nil)); end
+
+  # @api public
+  def begin_keyword(begin_t, body, end_t); end
+
+  # @api public
+  def binary_op(receiver, operator_t, arg); end
+
+  # @api public
+  def block(method_call, begin_t, args, body, end_t); end
+
+  # @api public
+  def block_pass(amper_t, arg); end
+
+  # @api public
+  def blockarg(amper_t, name_t); end
+
+  # @api public
+  def blockarg_expr(amper_t, expr); end
+
+  # @api public
+  def call_lambda(lambda_t); end
+
+  # @api public
+  def call_method(receiver, dot_t, selector_t, lparen_t = T.unsafe(nil), args = T.unsafe(nil), rparen_t = T.unsafe(nil)); end
+
+  # Method calls
+  #
+  # @api public
+  def call_type_for_dot(dot_t); end
+
+  # @api public
+  def case(case_t, expr, when_bodies, else_t, else_body, end_t); end
+
+  # PATTERN MATCHING
+  #
+  # @api public
+  def case_match(case_t, expr, in_bodies, else_t, else_body, end_t); end
+
+  # @api public
+  def character(char_t); end
+
+  # @api public
+  def complex(complex_t); end
+
+  # Expression grouping
+  #
+  # @api public
+  def compstmt(statements); end
+
+  # Conditionals
+  #
+  # @api public
+  def condition(cond_t, cond, then_t, if_true, else_t, if_false, end_t); end
+
+  # @api public
+  def condition_mod(if_true, if_false, cond_t, cond); end
+
+  # @api public
+  def const(name_t); end
+
+  # @api public
+  def const_fetch(scope, t_colon2, name_t); end
+
+  # @api public
+  def const_global(t_colon3, name_t); end
+
+  # @api public
+  def const_op_assignable(node); end
+
+  # @api public
+  def const_pattern(const, ldelim_t, pattern, rdelim_t); end
+
+  # @api public
+  def cvar(token); end
+
+  # Indented (interpolated, noninterpolated, executable) strings
+  #
+  # @api public
+  def dedent_string(node, dedent_level); end
+
+  # Class and module definition
+  #
+  # @api public
+  def def_class(class_t, name, lt_t, superclass, body, end_t); end
+
+  # @api public
+  def def_endless_method(def_t, name_t, args, assignment_t, body); end
+
+  # @api public
+  def def_endless_singleton(def_t, definee, dot_t, name_t, args, assignment_t, body); end
+
+  # Method (un)definition
+  #
+  # @api public
+  def def_method(def_t, name_t, args, body, end_t); end
+
+  # @api public
+  def def_module(module_t, name, body, end_t); end
+
+  # @api public
+  def def_sclass(class_t, lshft_t, expr, body, end_t); end
+
+  # @api public
+  def def_singleton(def_t, definee, dot_t, name_t, args, body, end_t); end
+
+  # If set to true (the default), `__FILE__` and `__LINE__` are transformed to
+  # literal nodes. For example, `s(:str, "lib/foo.rb")` and `s(:int, 10)`.
+  #
+  # If set to false, `__FILE__` and `__LINE__` are emitted as-is,
+  # i.e. as `s(:__FILE__)` and `s(:__LINE__)` nodes.
+  #
+  # Source maps are identical in both cases.
+  #
+  # @api public
+  # @return [Boolean]
+  def emit_file_line_as_literals; end
+
+  # If set to true (the default), `__FILE__` and `__LINE__` are transformed to
+  # literal nodes. For example, `s(:str, "lib/foo.rb")` and `s(:int, 10)`.
+  #
+  # If set to false, `__FILE__` and `__LINE__` are emitted as-is,
+  # i.e. as `s(:__FILE__)` and `s(:__LINE__)` nodes.
+  #
+  # Source maps are identical in both cases.
+  #
+  # @api public
+  # @return [Boolean]
+  def emit_file_line_as_literals=(_arg0); end
+
+  # @api public
+  def false(false_t); end
+
+  # @api public
+  def find_pattern(lbrack_t, elements, rbrack_t); end
+
+  # @api public
+  def float(float_t); end
+
+  # @api public
+  def for(for_t, iterator, in_t, iteratee, do_t, body, end_t); end
+
+  # @api public
+  def forward_arg(dots_t); end
+
+  # @api public
+  def forward_only_args(begin_t, dots_t, end_t); end
+
+  # @api public
+  def forwarded_args(dots_t); end
+
+  # @api public
+  def gvar(token); end
+
+  # @api public
+  def hash_pattern(lbrace_t, kwargs, rbrace_t); end
+
+  # @api public
+  def ident(token); end
+
+  # @api public
+  def if_guard(if_t, if_body); end
+
+  # @api public
+  def in_match(lhs, in_t, rhs); end
+
+  # @api public
+  def in_pattern(in_t, pattern, guard, then_t, body); end
+
+  # @api public
+  def index(receiver, lbrack_t, indexes, rbrack_t); end
+
+  # @api public
+  def index_asgn(receiver, lbrack_t, indexes, rbrack_t); end
+
+  # Numerics
+  #
+  # @api public
+  def integer(integer_t); end
+
+  # @api public
+  def ivar(token); end
+
+  # Keywords
+  #
+  # @api public
+  def keyword_cmd(type, keyword_t, lparen_t = T.unsafe(nil), args = T.unsafe(nil), rparen_t = T.unsafe(nil)); end
+
+  # @api public
+  def kwarg(name_t); end
+
+  # @api public
+  def kwnilarg(dstar_t, nil_t); end
+
+  # @api public
+  def kwoptarg(name_t, value); end
+
+  # @api public
+  def kwrestarg(dstar_t, name_t = T.unsafe(nil)); end
+
+  # @api public
+  def kwsplat(dstar_t, arg); end
+
+  # Logical operations: and, or
+  #
+  # @api public
+  def logical_op(type, lhs, op_t, rhs); end
+
+  # Loops
+  #
+  # @api public
+  def loop(type, keyword_t, cond, do_t, body, end_t); end
+
+  # @api public
+  def loop_mod(type, body, keyword_t, cond); end
+
+  # @api public
+  def match_alt(left, pipe_t, right); end
+
+  # @api public
+  def match_as(value, assoc_t, as); end
+
+  # @api public
+  def match_hash_var(name_t); end
+
+  # @api public
+  def match_hash_var_from_str(begin_t, strings, end_t); end
+
+  # @api public
+  def match_label(label_type, label); end
+
+  # @api public
+  def match_nil_pattern(dstar_t, nil_t); end
+
+  # @api public
+  def match_op(receiver, match_t, arg); end
+
+  # @api public
+  def match_pair(label_type, label, value); end
+
+  # @api public
+  def match_pattern(lhs, match_t, rhs); end
+
+  # @api public
+  def match_pattern_p(lhs, match_t, rhs); end
+
+  # @api public
+  def match_rest(star_t, name_t = T.unsafe(nil)); end
+
+  # @api public
+  def match_var(name_t); end
+
+  # @api public
+  def match_with_trailing_comma(match, comma_t); end
+
+  # @api public
+  def multi_assign(lhs, eql_t, rhs); end
+
+  # @api public
+  def multi_lhs(begin_t, items, end_t); end
+
+  # Singletons
+  #
+  # @api public
+  def nil(nil_t); end
+
+  # @api public
+  def not_op(not_t, begin_t = T.unsafe(nil), receiver = T.unsafe(nil), end_t = T.unsafe(nil)); end
+
+  # @api public
+  def nth_ref(token); end
+
+  # @api public
+  def numargs(max_numparam); end
+
+  # MacRuby Objective-C arguments
+  #
+  # @api public
+  def objc_kwarg(kwname_t, assoc_t, name_t); end
+
+  # @api public
+  def objc_restarg(star_t, name = T.unsafe(nil)); end
+
+  # @api public
+  def objc_varargs(pair, rest_of_varargs); end
+
+  # @api public
+  def op_assign(lhs, op_t, rhs); end
+
+  # @api public
+  def optarg(name_t, eql_t, value); end
+
+  # Hashes
+  #
+  # @api public
+  def pair(key, assoc_t, value); end
+
+  # @api public
+  def pair_keyword(key_t, value); end
+
+  # @api public
+  def pair_label(key_t); end
+
+  # @api public
+  def pair_list_18(list); end
+
+  # @api public
+  def pair_quoted(begin_t, parts, end_t, value); end
+
+  # @api private
+  def parser; end
+
+  # @api private
+  def parser=(_arg0); end
+
+  # @api public
+  def pin(pin_t, var); end
+
+  # @api public
+  def postexe(postexe_t, lbrace_t, compstmt, rbrace_t); end
+
+  # BEGIN, END
+  #
+  # @api public
+  def preexe(preexe_t, lbrace_t, compstmt, rbrace_t); end
+
+  # @api public
+  def procarg0(arg); end
+
+  # @api public
+  def range_exclusive(lhs, dot3_t, rhs); end
+
+  # Ranges
+  #
+  # @api public
+  def range_inclusive(lhs, dot2_t, rhs); end
+
+  # @api public
+  def rational(rational_t); end
+
+  # @api public
+  def regexp_compose(begin_t, parts, end_t, options); end
+
+  # Regular expressions
+  #
+  # @api public
+  def regexp_options(regopt_t); end
+
+  # Exception handling
+  #
+  # @api public
+  def rescue_body(rescue_t, exc_list, assoc_t, exc_var, then_t, compound_stmt); end
+
+  # @api public
+  def restarg(star_t, name_t = T.unsafe(nil)); end
+
+  # @api public
+  def restarg_expr(star_t, expr = T.unsafe(nil)); end
+
+  # Access
+  #
+  # @api public
+  def self(token); end
+
+  # @api public
+  def shadowarg(name_t); end
+
+  # @api public
+  def splat(star_t, arg = T.unsafe(nil)); end
+
+  # Strings
+  #
+  # @api public
+  def string(string_t); end
+
+  # @api public
+  def string_compose(begin_t, parts, end_t); end
+
+  # @api public
+  def string_internal(string_t); end
+
+  # Symbols
+  #
+  # @api public
+  def symbol(symbol_t); end
+
+  # @api public
+  def symbol_compose(begin_t, parts, end_t); end
+
+  # @api public
+  def symbol_internal(symbol_t); end
+
+  # @api public
+  def symbols_compose(begin_t, parts, end_t); end
+
+  # @api public
+  def ternary(cond, question_t, if_true, colon_t, if_false); end
+
+  # @api public
+  def true(true_t); end
+
+  # @api public
+  def unary_num(unary_t, numeric); end
+
+  # @api public
+  def unary_op(op_t, receiver); end
+
+  # @api public
+  def undef_method(undef_t, names); end
+
+  # @api public
+  def unless_guard(unless_t, unless_body); end
+
+  # Case matching
+  #
+  # @api public
+  def when(when_t, patterns, then_t, body); end
+
+  # @api public
+  def word(parts); end
+
+  # @api public
+  def words_compose(begin_t, parts, end_t); end
+
+  # Executable strings
+  #
+  # @api public
+  def xstring_compose(begin_t, parts, end_t); end
+
+  private
+
+  # @api public
+  # @return [Boolean]
+  def arg_name_collides?(this_name, that_name); end
+
+  # @api public
+  def arg_prefix_map(op_t, name_t = T.unsafe(nil)); end
+
+  # @api public
+  def binary_op_map(left_e, op_t, right_e); end
+
+  # @api public
+  def block_map(receiver_l, begin_t, end_t); end
+
+  # @api public
+  def check_assignment_to_numparam(name, loc); end
+
+  # VERIFICATION
+  #
+  # @api public
+  def check_condition(cond); end
+
+  # @api public
+  def check_duplicate_arg(this_arg, map = T.unsafe(nil)); end
+
+  # @api public
+  def check_duplicate_args(args, map = T.unsafe(nil)); end
+
+  # @api public
+  def check_duplicate_pattern_key(name, loc); end
+
+  # @api public
+  def check_duplicate_pattern_variable(name, loc); end
+
+  # @api public
+  def check_lvar_name(name, loc); end
+
+  # @api public
+  def check_reserved_for_numparam(name, loc); end
+
+  # @api public
+  # @return [Boolean]
+  def collapse_string_parts?(parts); end
+
+  # @api public
+  def collection_map(begin_t, parts, end_t); end
+
+  # @api public
+  def condition_map(keyword_t, cond_e, begin_t, body_e, else_t, else_e, end_t); end
+
+  # @api public
+  def constant_map(scope, colon2_t, name_t); end
+
+  # @api public
+  def definition_map(keyword_t, operator_t, name_t, end_t); end
+
+  # @api public
+  def delimited_string_map(string_t); end
+
+  # @api public
+  def diagnostic(type, reason, arguments, location, highlights = T.unsafe(nil)); end
+
+  # @api public
+  def eh_keyword_map(compstmt_e, keyword_t, body_es, else_t, else_e); end
+
+  # @api public
+  def endless_definition_map(keyword_t, operator_t, name_t, assignment_t, body_e); end
+
+  # @api public
+  def expr_map(loc); end
+
+  # @api public
+  def for_map(keyword_t, in_t, begin_t, end_t); end
+
+  # @api public
+  def guard_map(keyword_t, guard_body_e); end
+
+  # @api public
+  def index_map(receiver_e, lbrack_t, rbrack_t); end
+
+  # @api public
+  def join_exprs(left_expr, right_expr); end
+
+  # @api public
+  def keyword_map(keyword_t, begin_t, args, end_t); end
+
+  # @api public
+  def keyword_mod_map(pre_e, keyword_t, post_e); end
+
+  # @api public
+  def kwarg_map(name_t, value_e = T.unsafe(nil)); end
+
+  # @api public
+  # @return [Boolean]
+  def kwargs?(node); end
+
+  # @api public
+  def loc(token); end
+
+  # @api public
+  def module_definition_map(keyword_t, name_e, operator_t, end_t); end
+
+  # SOURCE MAPS
+  #
+  # @api public
+  def n(type, children, source_map); end
+
+  # @api public
+  def n0(type, source_map); end
+
+  # @api public
+  def numeric(kind, token); end
+
+  # @api public
+  def pair_keyword_map(key_t, value_e); end
+
+  # @api public
+  def pair_quoted_map(begin_t, end_t, value_e); end
+
+  # @api public
+  def prefix_string_map(symbol); end
+
+  # @api public
+  def range_map(start_e, op_t, end_e); end
+
+  # @api public
+  def regexp_map(begin_t, end_t, options_e); end
+
+  # @api public
+  def rescue_body_map(keyword_t, exc_list_e, assoc_t, exc_var_e, then_t, compstmt_e); end
+
+  # @api public
+  def rewrite_hash_args_to_kwargs(args); end
+
+  # @api public
+  def send_binary_op_map(lhs_e, selector_t, rhs_e); end
+
+  # @api public
+  def send_index_map(receiver_e, lbrack_t, rbrack_t); end
+
+  # @api public
+  def send_map(receiver_e, dot_t, selector_t, begin_t = T.unsafe(nil), args = T.unsafe(nil), end_t = T.unsafe(nil)); end
+
+  # @api public
+  def send_unary_op_map(selector_t, arg_e); end
+
+  # @api public
+  def static_regexp(parts, options); end
+
+  # @api public
+  def static_regexp_node(node); end
+
+  # Extract a static string from e.g. a regular expression,
+  # honoring the fact that MRI expands interpolations like #{""}
+  # at parse time.
+  #
+  # @api public
+  def static_string(nodes); end
+
+  # @api public
+  def string_map(begin_t, parts, end_t); end
+
+  # @api public
+  def string_value(token); end
+
+  # @api public
+  def ternary_map(begin_e, question_t, mid_e, colon_t, end_e); end
+
+  # @api public
+  def token_map(token); end
+
+  # @api public
+  def unary_op_map(op_t, arg_e = T.unsafe(nil)); end
+
+  # @api public
+  def unquoted_map(token); end
+
+  # @api public
+  def validate_definee(definee); end
+
+  # @api public
+  def validate_no_forward_arg_after_restarg(args); end
+
+  # @api public
+  def value(token); end
+
+  # @api public
+  def var_send_map(variable_e); end
+
+  # @api public
+  def variable_map(name_t); end
+
+  class << self
+    # AST compatibility attribute; causes a single non-mlhs
+    # block argument to be wrapped in s(:procarg0).
+    #
+    # If set to false (the default), block arguments `|a|` are emitted as
+    # `s(:args, s(:procarg0, :a))`
+    #
+    # If set to true, block arguments `|a|` are emitted as
+    # `s(:args, s(:procarg0, s(:arg, :a))`
+    #
+    # @api public
+    # @return [Boolean]
+    def emit_arg_inside_procarg0; end
+
+    # AST compatibility attribute; causes a single non-mlhs
+    # block argument to be wrapped in s(:procarg0).
+    #
+    # If set to false (the default), block arguments `|a|` are emitted as
+    # `s(:args, s(:procarg0, :a))`
+    #
+    # If set to true, block arguments `|a|` are emitted as
+    # `s(:args, s(:procarg0, s(:arg, :a))`
+    #
+    # @api public
+    # @return [Boolean]
+    def emit_arg_inside_procarg0=(_arg0); end
+
+    # AST compatibility attribute; locations of `__ENCODING__` are not the same
+    # as locations of `Encoding::UTF_8` causing problems during rewriting,
+    # all new code should set this attribute to true.
+    #
+    # If set to false (the default), `__ENCODING__` is emitted as
+    # ` s(:const, s(:const, nil, :Encoding), :UTF_8)`.
+    #
+    # If set to true, `__ENCODING__` is emitted as
+    # `s(:__ENCODING__)`.
+    #
+    # @api public
+    # @return [Boolean]
+    def emit_encoding; end
+
+    # AST compatibility attribute; locations of `__ENCODING__` are not the same
+    # as locations of `Encoding::UTF_8` causing problems during rewriting,
+    # all new code should set this attribute to true.
+    #
+    # If set to false (the default), `__ENCODING__` is emitted as
+    # ` s(:const, s(:const, nil, :Encoding), :UTF_8)`.
+    #
+    # If set to true, `__ENCODING__` is emitted as
+    # `s(:__ENCODING__)`.
+    #
+    # @api public
+    # @return [Boolean]
+    def emit_encoding=(_arg0); end
+
+    # AST compatibility attribute; arguments forwarding initially
+    # didn't have support for leading arguments
+    # (i.e. `def m(a, ...); end` was a syntax error). However, Ruby 3.0
+    # added support for any number of arguments in front of the `...`.
+    #
+    # If set to false (the default):
+    #   1. `def m(...) end` is emitted as
+    #      s(:def, :m, s(:forward_args), nil)
+    #   2. `def m(a, b, ...) end` is emitted as
+    #      s(:def, :m,
+    #        s(:args, s(:arg, :a), s(:arg, :b), s(:forward_arg)))
+    #
+    # If set to true it uses a single format:
+    #   1. `def m(...) end` is emitted as
+    #      s(:def, :m, s(:args, s(:forward_arg)))
+    #   2. `def m(a, b, ...) end` is emitted as
+    #      s(:def, :m, s(:args, s(:arg, :a), s(:arg, :b), s(:forward_arg)))
+    #
+    # It does't matter that much on 2.7 (because there can't be any leading arguments),
+    # but on 3.0 it should be better enabled to use a single AST format.
+    #
+    # @api public
+    # @return [Boolean]
+    def emit_forward_arg; end
+
+    # AST compatibility attribute; arguments forwarding initially
+    # didn't have support for leading arguments
+    # (i.e. `def m(a, ...); end` was a syntax error). However, Ruby 3.0
+    # added support for any number of arguments in front of the `...`.
+    #
+    # If set to false (the default):
+    #   1. `def m(...) end` is emitted as
+    #      s(:def, :m, s(:forward_args), nil)
+    #   2. `def m(a, b, ...) end` is emitted as
+    #      s(:def, :m,
+    #        s(:args, s(:arg, :a), s(:arg, :b), s(:forward_arg)))
+    #
+    # If set to true it uses a single format:
+    #   1. `def m(...) end` is emitted as
+    #      s(:def, :m, s(:args, s(:forward_arg)))
+    #   2. `def m(a, b, ...) end` is emitted as
+    #      s(:def, :m, s(:args, s(:arg, :a), s(:arg, :b), s(:forward_arg)))
+    #
+    # It does't matter that much on 2.7 (because there can't be any leading arguments),
+    # but on 3.0 it should be better enabled to use a single AST format.
+    #
+    # @api public
+    # @return [Boolean]
+    def emit_forward_arg=(_arg0); end
+
+    # AST compatibility attribute; indexed assignment, `x[] = 1`, is not
+    # semantically equivalent to calling the method directly, `x.[]=(1)`.
+    # Specifically, in the former case, the expression's value is always 1,
+    # and in the latter case, the expression's value is the return value
+    # of the `[]=` method.
+    #
+    # If set to false (the default), `self[1]` is emitted as
+    # `s(:send, s(:self), :[], s(:int, 1))`, and `self[1] = 2` is
+    # emitted as `s(:send, s(:self), :[]=, s(:int, 1), s(:int, 2))`.
+    #
+    # If set to true, `self[1]` is emitted as
+    # `s(:index, s(:self), s(:int, 1))`, and `self[1] = 2` is
+    # emitted as `s(:indexasgn, s(:self), s(:int, 1), s(:int, 2))`.
+    #
+    # @api public
+    # @return [Boolean]
+    def emit_index; end
+
+    # AST compatibility attribute; indexed assignment, `x[] = 1`, is not
+    # semantically equivalent to calling the method directly, `x.[]=(1)`.
+    # Specifically, in the former case, the expression's value is always 1,
+    # and in the latter case, the expression's value is the return value
+    # of the `[]=` method.
+    #
+    # If set to false (the default), `self[1]` is emitted as
+    # `s(:send, s(:self), :[], s(:int, 1))`, and `self[1] = 2` is
+    # emitted as `s(:send, s(:self), :[]=, s(:int, 1), s(:int, 2))`.
+    #
+    # If set to true, `self[1]` is emitted as
+    # `s(:index, s(:self), s(:int, 1))`, and `self[1] = 2` is
+    # emitted as `s(:indexasgn, s(:self), s(:int, 1), s(:int, 2))`.
+    #
+    # @api public
+    # @return [Boolean]
+    def emit_index=(_arg0); end
+
+    # AST compatibility attribute; Starting from Ruby 2.7 keyword arguments
+    # of method calls that are passed explicitly as a hash (i.e. with curly braces)
+    # are treated as positional arguments and Ruby 2.7 emits a warning on such method
+    # call. Ruby 3.0 given an ArgumentError.
+    #
+    # If set to false (the default) the last hash argument is emitted as `hash`:
+    #
+    # ```
+    # (send nil :foo
+    #   (hash
+    #     (pair
+    #       (sym :bar)
+    #       (int 42))))
+    # ```
+    #
+    # If set to true it is emitted as `kwargs`:
+    #
+    # ```
+    # (send nil :foo
+    #   (kwargs
+    #     (pair
+    #       (sym :bar)
+    #       (int 42))))
+    # ```
+    #
+    # Note that `kwargs` node is just a replacement for `hash` argument,
+    # so if there's are multiple arguments (or a `kwsplat`) all of them
+    # are wrapped into `kwargs` instead of `hash`:
+    #
+    # ```
+    # (send nil :foo
+    #   (kwargs
+    #     (pair
+    #       (sym :a)
+    #       (int 42))
+    #     (kwsplat
+    #       (send nil :b))
+    #     (pair
+    #       (sym :c)
+    #       (int 10))))
+    # ```
+    #
+    # @api public
+    def emit_kwargs; end
+
+    # AST compatibility attribute; Starting from Ruby 2.7 keyword arguments
+    # of method calls that are passed explicitly as a hash (i.e. with curly braces)
+    # are treated as positional arguments and Ruby 2.7 emits a warning on such method
+    # call. Ruby 3.0 given an ArgumentError.
+    #
+    # If set to false (the default) the last hash argument is emitted as `hash`:
+    #
+    # ```
+    # (send nil :foo
+    #   (hash
+    #     (pair
+    #       (sym :bar)
+    #       (int 42))))
+    # ```
+    #
+    # If set to true it is emitted as `kwargs`:
+    #
+    # ```
+    # (send nil :foo
+    #   (kwargs
+    #     (pair
+    #       (sym :bar)
+    #       (int 42))))
+    # ```
+    #
+    # Note that `kwargs` node is just a replacement for `hash` argument,
+    # so if there's are multiple arguments (or a `kwsplat`) all of them
+    # are wrapped into `kwargs` instead of `hash`:
+    #
+    # ```
+    # (send nil :foo
+    #   (kwargs
+    #     (pair
+    #       (sym :a)
+    #       (int 42))
+    #     (kwsplat
+    #       (send nil :b))
+    #     (pair
+    #       (sym :c)
+    #       (int 10))))
+    # ```
+    #
+    # @api public
+    def emit_kwargs=(_arg0); end
+
+    # AST compatibility attribute; since `-> {}` is not semantically
+    # equivalent to `lambda {}`, all new code should set this attribute
+    # to true.
+    #
+    # If set to false (the default), `-> {}` is emitted as
+    # `s(:block, s(:send, nil, :lambda), s(:args), nil)`.
+    #
+    # If set to true, `-> {}` is emitted as
+    # `s(:block, s(:lambda), s(:args), nil)`.
+    #
+    # @api public
+    # @return [Boolean]
+    def emit_lambda; end
+
+    # AST compatibility attribute; since `-> {}` is not semantically
+    # equivalent to `lambda {}`, all new code should set this attribute
+    # to true.
+    #
+    # If set to false (the default), `-> {}` is emitted as
+    # `s(:block, s(:send, nil, :lambda), s(:args), nil)`.
+    #
+    # If set to true, `-> {}` is emitted as
+    # `s(:block, s(:lambda), s(:args), nil)`.
+    #
+    # @api public
+    # @return [Boolean]
+    def emit_lambda=(_arg0); end
+
+    # AST compatibility attribute; Starting from 3.0 Ruby returns
+    # true/false from single-line pattern matching with `in` keyword.
+    #
+    # Before 3.0 there was an exception if given value doesn't match pattern.
+    #
+    # NOTE: This attribute affects only Ruby 2.7 grammar.
+    # 3.0 grammar always emits `match_pattern`/`match_pattern_p`
+    #
+    # If compatibility attribute set to false `foo in bar` is emitted as `in_match`:
+    #
+    # ```
+    # (in-match
+    #   (send nil :foo)
+    #   (match-var :bar))
+    # ```
+    #
+    # If set to true it's emitted as `match_pattern_p`:
+    # ```
+    # (match-pattern-p
+    #   (send nil :foo)
+    #   (match-var :bar))
+    # ```
+    #
+    # @api public
+    def emit_match_pattern; end
+
+    # AST compatibility attribute; Starting from 3.0 Ruby returns
+    # true/false from single-line pattern matching with `in` keyword.
+    #
+    # Before 3.0 there was an exception if given value doesn't match pattern.
+    #
+    # NOTE: This attribute affects only Ruby 2.7 grammar.
+    # 3.0 grammar always emits `match_pattern`/`match_pattern_p`
+    #
+    # If compatibility attribute set to false `foo in bar` is emitted as `in_match`:
+    #
+    # ```
+    # (in-match
+    #   (send nil :foo)
+    #   (match-var :bar))
+    # ```
+    #
+    # If set to true it's emitted as `match_pattern_p`:
+    # ```
+    # (match-pattern-p
+    #   (send nil :foo)
+    #   (match-var :bar))
+    # ```
+    #
+    # @api public
+    def emit_match_pattern=(_arg0); end
+
+    # AST compatibility attribute; block arguments of `m { |a| }` are
+    # not semantically equivalent to block arguments of `m { |a,| }` or `m { |a, b| }`,
+    # all new code should set this attribute to true.
+    #
+    # If set to false (the default), arguments of `m { |a| }` are emitted as
+    # `s(:args, s(:arg, :a))`.
+    #
+    # If set to true, arguments of `m { |a| }` are emitted as
+    # `s(:args, s(:procarg0, :a)).
+    #
+    # @api public
+    # @return [Boolean]
+    def emit_procarg0; end
+
+    # AST compatibility attribute; block arguments of `m { |a| }` are
+    # not semantically equivalent to block arguments of `m { |a,| }` or `m { |a, b| }`,
+    # all new code should set this attribute to true.
+    #
+    # If set to false (the default), arguments of `m { |a| }` are emitted as
+    # `s(:args, s(:arg, :a))`.
+    #
+    # If set to true, arguments of `m { |a| }` are emitted as
+    # `s(:args, s(:procarg0, :a)).
+    #
+    # @api public
+    # @return [Boolean]
+    def emit_procarg0=(_arg0); end
+
+    # @api private
+    def modernize; end
+  end
+end
+
+# {Parser::ClobberingError} is raised when {Parser::Source::Rewriter}
+# detects a clobbering rewrite action. This class inherits {RuntimeError}
+# rather than {StandardError} for backward compatibility.
+#
+# @api public
+class Parser::ClobberingError < ::RuntimeError; end
+
+# Context of parsing that is represented by a stack of scopes.
+#
+# Supported states:
+# + :class - in the class body (class A; end)
+# + :module - in the module body (module M; end)
+# + :sclass - in the singleton class body (class << obj; end)
+# + :def - in the method body (def m; end)
+# + :defs - in the singleton method body (def self.m; end)
+# + :def_open_args - in the arglist of the method definition
+#                    keep in mind that it's set **only** after reducing the first argument,
+#                    if you need to handle the first argument check `lex_state == expr_fname`
+# + :block - in the block body (tap {})
+# + :lambda - in the lambda body (-> {})
+#
+# @api public
+class Parser::Context
+  # @api public
+  # @return [Context] a new instance of Context
+  def initialize; end
+
+  def in_argdef; end
+  def in_argdef=(_arg0); end
+  def in_block; end
+  def in_block=(_arg0); end
+  def in_class; end
+  def in_class=(_arg0); end
+  def in_def; end
+  def in_def=(_arg0); end
+  def in_defined; end
+  def in_defined=(_arg0); end
+
+  # @api public
+  # @return [Boolean]
+  def in_dynamic_block?; end
+
+  def in_kwarg; end
+  def in_kwarg=(_arg0); end
+  def in_lambda; end
+  def in_lambda=(_arg0); end
+
+  # @api public
+  def reset; end
+end
+
+# @api public
+Parser::Context::FLAGS = T.let(T.unsafe(nil), Array)
+
+# Stack that holds names of current arguments,
+# i.e. while parsing
+#   def m1(a = (def m2(b = def m3(c = 1); end); end)); end
+#                                   ^
+# stack is [:a, :b, :c]
+#
+# Emulates `p->cur_arg` in MRI's parse.y
+#
+# @api private
+class Parser::CurrentArgStack
+  # @api private
+  # @return [CurrentArgStack] a new instance of CurrentArgStack
+  def initialize; end
+
+  # @api private
+  # @return [Boolean]
+  def empty?; end
+
+  # @api private
+  def pop; end
+
+  # @api private
+  def push(value); end
+
+  # @api private
+  def reset; end
+
+  # @api private
+  def set(value); end
+
+  # @api private
+  def stack; end
+
+  # @api private
+  def top; end
+end
+
+# @api private
+module Parser::Deprecation
+  # @api private
+  def warn_of_deprecation; end
+
+  # @api private
+  def warned_of_deprecation=(_arg0); end
+end
+
+# @api public
+class Parser::Diagnostic
+  # @api public
+  # @param level [Symbol]
+  # @param reason [Symbol]
+  # @param arguments [Hash]
+  # @param location [Parser::Source::Range]
+  # @param highlights [Array<Parser::Source::Range>]
+  # @return [Diagnostic] a new instance of Diagnostic
+  def initialize(level, reason, arguments, location, highlights = T.unsafe(nil)); end
+
+  # @api public
+  # @return [Symbol] extended arguments that describe the error
+  # @see Parser::MESSAGES
+  def arguments; end
+
+  # Supplementary error-related source ranges.
+  #
+  # @api public
+  # @return [Array<Parser::Source::Range>]
+  def highlights; end
+
+  # @api public
+  # @return [Symbol] diagnostic level
+  # @see LEVELS
+  def level; end
+
+  # Main error-related source range.
+  #
+  # @api public
+  # @return [Parser::Source::Range]
+  def location; end
+
+  # @api public
+  # @return [String] the rendered message.
+  def message; end
+
+  # @api public
+  # @return [Symbol] reason for error
+  # @see Parser::MESSAGES
+  def reason; end
+
+  # Renders the diagnostic message as a clang-like diagnostic.
+  #
+  # @api public
+  # @example
+  #   diagnostic.render # =>
+  #   # [
+  #   #   "(fragment:0):1:5: error: unexpected token $end",
+  #   #   "foo +",
+  #   #   "    ^"
+  #   # ]
+  # @return [Array<String>]
+  def render; end
+
+  private
+
+  # If necessary, shrink a `Range` so as to include only the first line.
+  #
+  # @api public
+  # @return [Parser::Source::Range]
+  def first_line_only(range); end
+
+  # If necessary, shrink a `Range` so as to include only the last line.
+  #
+  # @api public
+  # @return [Parser::Source::Range]
+  def last_line_only(range); end
+
+  # Renders one source line in clang diagnostic style, with highlights.
+  #
+  # @api public
+  # @return [Array<String>]
+  def render_line(range, ellipsis = T.unsafe(nil), range_end = T.unsafe(nil)); end
+end
+
+class Parser::Diagnostic::Engine
+  def initialize(consumer = T.unsafe(nil)); end
+
+  def all_errors_are_fatal; end
+  def all_errors_are_fatal=(_arg0); end
+  def consumer; end
+  def consumer=(_arg0); end
+  def ignore_warnings; end
+  def ignore_warnings=(_arg0); end
+  def process(diagnostic); end
+
+  protected
+
+  def ignore?(diagnostic); end
+  def raise?(diagnostic); end
+end
+
+# Collection of the available diagnostic levels.
+#
+# @api public
+# @return [Array]
+Parser::Diagnostic::LEVELS = T.let(T.unsafe(nil), Array)
+
+# line 3 "lib/parser/lexer.rl"
+#
+# === BEFORE YOU START ===
+#
+# Read the Ruby Hacking Guide chapter 11, available in English at
+# http://whitequark.org/blog/2013/04/01/ruby-hacking-guide-ch-11-finite-state-lexer/
+#
+# Remember two things about Ragel scanners:
+#
+#   1) Longest match wins.
+#
+#   2) If two matches have the same length, the first
+#      in source code wins.
+#
+# General rules of making Ragel and Bison happy:
+#
+#  * `p` (position) and `@te` contain the index of the character
+#    they're pointing to ("current"), plus one. `@ts` contains the index
+#    of the corresponding character. The code for extracting matched token is:
+#
+#       @source_buffer.slice(@ts...@te)
+#
+#  * If your input is `foooooooobar` and the rule is:
+#
+#       'f' 'o'+
+#
+#    the result will be:
+#
+#       foooooooobar
+#       ^ ts=0   ^ p=te=9
+#
+#  * A Ragel lexer action should not emit more than one token, unless
+#    you know what you are doing.
+#
+#  * All Ragel commands (fnext, fgoto, ...) end with a semicolon.
+#
+#  * If an action emits the token and transitions to another state, use
+#    these Ragel commands:
+#
+#       emit($whatever)
+#       fnext $next_state; fbreak;
+#
+#    If you perform `fgoto` in an action which does not emit a token nor
+#    rewinds the stream pointer, the parser's side-effectful,
+#    context-sensitive lookahead actions will break in a hard to detect
+#    and debug way.
+#
+#  * If an action does not emit a token:
+#
+#       fgoto $next_state;
+#
+#  * If an action features lookbehind, i.e. matches characters with the
+#    intent of passing them to another action:
+#
+#       p = @ts - 1
+#       fgoto $next_state;
+#
+#    or, if the lookbehind consists of a single character:
+#
+#       fhold; fgoto $next_state;
+#
+#  * Ragel merges actions. So, if you have `e_lparen = '(' %act` and
+#    `c_lparen = '('` and a lexer action `e_lparen | c_lparen`, the result
+#    _will_ invoke the action `act`.
+#
+#    e_something stands for "something with **e**mbedded action".
+#
+#  * EOF is explicit and is matched by `c_eof`. If you want to introspect
+#    the state of the lexer, add this rule to the state:
+#
+#       c_eof => do_eof;
+#
+#  * If you proceed past EOF, the lexer will complain:
+#
+#       NoMethodError: undefined method `ord' for nil:NilClass
+#
+# @api public
+class Parser::Lexer
+  # @api public
+  # @return [Lexer] a new instance of Lexer
+  def initialize(version); end
+
+  # Return next token: [type, value].
+  #
+  # @api public
+  def advance; end
+
+  # @api public
+  def cmdarg; end
+
+  # @api public
+  def cmdarg=(_arg0); end
+
+  # @api public
+  def cmdarg_stack; end
+
+  # @api public
+  def command_start; end
+
+  # @api public
+  def command_start=(_arg0); end
+
+  # @api public
+  def comments; end
+
+  # @api public
+  def comments=(_arg0); end
+
+  # @api public
+  def cond; end
+
+  # @api public
+  def cond=(_arg0); end
+
+  # @api public
+  def cond_stack; end
+
+  # @api public
+  def context; end
+
+  # @api public
+  def context=(_arg0); end
+
+  # @api public
+  def dedent_level; end
+
+  # @api public
+  def diagnostics; end
+
+  # @api public
+  def diagnostics=(_arg0); end
+
+  # @api public
+  def encoding; end
+
+  # @api public
+  def force_utf32; end
+
+  # @api public
+  def force_utf32=(_arg0); end
+
+  # @api public
+  def lambda_stack; end
+
+  # @api public
+  def paren_nest; end
+
+  # @api public
+  def pop_cmdarg; end
+
+  # @api public
+  def pop_cond; end
+
+  # @api public
+  def push_cmdarg; end
+
+  # @api public
+  def push_cond; end
+
+  # @api public
+  def reset(reset_state = T.unsafe(nil)); end
+
+  # @api public
+  def source_buffer; end
+
+  # @api public
+  def source_buffer=(source_buffer); end
+
+  # @api public
+  def state; end
+
+  # @api public
+  def state=(state); end
+
+  # @api public
+  def static_env; end
+
+  # @api public
+  def static_env=(_arg0); end
+
+  # @api public
+  def tokens; end
+
+  # @api public
+  def tokens=(_arg0); end
+
+  protected
+
+  # @api public
+  def arg_or_cmdarg(cmd_state); end
+
+  # @api public
+  def diagnostic(type, reason, arguments = T.unsafe(nil), location = T.unsafe(nil), highlights = T.unsafe(nil)); end
+
+  # @api public
+  def emit(type, value = T.unsafe(nil), s = T.unsafe(nil), e = T.unsafe(nil)); end
+
+  # @api public
+  def emit_comment(s = T.unsafe(nil), e = T.unsafe(nil)); end
+
+  # @api public
+  def emit_do(do_block = T.unsafe(nil)); end
+
+  # @api public
+  def emit_table(table, s = T.unsafe(nil), e = T.unsafe(nil)); end
+
+  # @api public
+  def encode_escape(ord); end
+
+  # @api public
+  # @return [Boolean]
+  def eof_codepoint?(point); end
+
+  # @api public
+  def literal; end
+
+  # @api public
+  def next_state_for_literal(literal); end
+
+  # @api public
+  def pop_literal; end
+
+  # === LITERAL STACK ===
+  #
+  # @api public
+  def push_literal(*args); end
+
+  # @api public
+  def range(s = T.unsafe(nil), e = T.unsafe(nil)); end
+
+  # @api public
+  def stack_pop; end
+
+  # @api public
+  def tok(s = T.unsafe(nil), e = T.unsafe(nil)); end
+
+  # @api public
+  # @return [Boolean]
+  def version?(*versions); end
+
+  class << self
+    # @api public
+    def lex_en_expr_arg; end
+
+    # @api public
+    def lex_en_expr_arg=(_arg0); end
+
+    # @api public
+    def lex_en_expr_beg; end
+
+    # @api public
+    def lex_en_expr_beg=(_arg0); end
+
+    # @api public
+    def lex_en_expr_cmdarg; end
+
+    # @api public
+    def lex_en_expr_cmdarg=(_arg0); end
+
+    # @api public
+    def lex_en_expr_dot; end
+
+    # @api public
+    def lex_en_expr_dot=(_arg0); end
+
+    # @api public
+    def lex_en_expr_end; end
+
+    # @api public
+    def lex_en_expr_end=(_arg0); end
+
+    # @api public
+    def lex_en_expr_endarg; end
+
+    # @api public
+    def lex_en_expr_endarg=(_arg0); end
+
+    # @api public
+    def lex_en_expr_endfn; end
+
+    # @api public
+    def lex_en_expr_endfn=(_arg0); end
+
+    # @api public
+    def lex_en_expr_fname; end
+
+    # @api public
+    def lex_en_expr_fname=(_arg0); end
+
+    # @api public
+    def lex_en_expr_labelarg; end
+
+    # @api public
+    def lex_en_expr_labelarg=(_arg0); end
+
+    # @api public
+    def lex_en_expr_mid; end
+
+    # @api public
+    def lex_en_expr_mid=(_arg0); end
+
+    # @api public
+    def lex_en_expr_value; end
+
+    # @api public
+    def lex_en_expr_value=(_arg0); end
+
+    # @api public
+    def lex_en_expr_variable; end
+
+    # @api public
+    def lex_en_expr_variable=(_arg0); end
+
+    # @api public
+    def lex_en_interp_backslash_delimited; end
+
+    # @api public
+    def lex_en_interp_backslash_delimited=(_arg0); end
+
+    # @api public
+    def lex_en_interp_backslash_delimited_words; end
+
+    # @api public
+    def lex_en_interp_backslash_delimited_words=(_arg0); end
+
+    # @api public
+    def lex_en_interp_string; end
+
+    # @api public
+    def lex_en_interp_string=(_arg0); end
+
+    # @api public
+    def lex_en_interp_words; end
+
+    # @api public
+    def lex_en_interp_words=(_arg0); end
+
+    # @api public
+    def lex_en_leading_dot; end
+
+    # @api public
+    def lex_en_leading_dot=(_arg0); end
+
+    # @api public
+    def lex_en_line_begin; end
+
+    # @api public
+    def lex_en_line_begin=(_arg0); end
+
+    # @api public
+    def lex_en_line_comment; end
+
+    # @api public
+    def lex_en_line_comment=(_arg0); end
+
+    # @api public
+    def lex_en_plain_backslash_delimited; end
+
+    # @api public
+    def lex_en_plain_backslash_delimited=(_arg0); end
+
+    # @api public
+    def lex_en_plain_backslash_delimited_words; end
+
+    # @api public
+    def lex_en_plain_backslash_delimited_words=(_arg0); end
+
+    # @api public
+    def lex_en_plain_string; end
+
+    # @api public
+    def lex_en_plain_string=(_arg0); end
+
+    # @api public
+    def lex_en_plain_words; end
+
+    # @api public
+    def lex_en_plain_words=(_arg0); end
+
+    # @api public
+    def lex_en_regexp_modifiers; end
+
+    # @api public
+    def lex_en_regexp_modifiers=(_arg0); end
+
+    # @api public
+    def lex_error; end
+
+    # @api public
+    def lex_error=(_arg0); end
+
+    # @api public
+    def lex_start; end
+
+    # @api public
+    def lex_start=(_arg0); end
+
+    private
+
+    # @api public
+    def _lex_eof_trans; end
+
+    # @api public
+    def _lex_eof_trans=(_arg0); end
+
+    # @api public
+    def _lex_from_state_actions; end
+
+    # @api public
+    def _lex_from_state_actions=(_arg0); end
+
+    # @api public
+    def _lex_index_offsets; end
+
+    # @api public
+    def _lex_index_offsets=(_arg0); end
+
+    # @api public
+    def _lex_indicies; end
+
+    # @api public
+    def _lex_indicies=(_arg0); end
+
+    # @api public
+    def _lex_key_spans; end
+
+    # @api public
+    def _lex_key_spans=(_arg0); end
+
+    # @api public
+    def _lex_to_state_actions; end
+
+    # @api public
+    def _lex_to_state_actions=(_arg0); end
+
+    # @api public
+    def _lex_trans_actions; end
+
+    # @api public
+    def _lex_trans_actions=(_arg0); end
+
+    # @api public
+    def _lex_trans_keys; end
+
+    # @api public
+    def _lex_trans_keys=(_arg0); end
+
+    # @api public
+    def _lex_trans_targs; end
+
+    # @api public
+    def _lex_trans_targs=(_arg0); end
+  end
+end
+
+class Parser::Lexer::Dedenter
+  def initialize(dedent_level); end
+
+  def dedent(string); end
+  def interrupt; end
+end
+
+Parser::Lexer::Dedenter::TAB_WIDTH = T.let(T.unsafe(nil), Integer)
+
+# %
+#
+# @api public
+Parser::Lexer::ESCAPES = T.let(T.unsafe(nil), Hash)
+
+# @api public
+Parser::Lexer::KEYWORDS = T.let(T.unsafe(nil), Hash)
+
+# @api public
+Parser::Lexer::KEYWORDS_BEGIN = T.let(T.unsafe(nil), Hash)
+
+# @api public
+Parser::Lexer::LEX_STATES = T.let(T.unsafe(nil), Hash)
+
+class Parser::Lexer::Literal
+  def initialize(lexer, str_type, delimiter, str_s, heredoc_e = T.unsafe(nil), indent = T.unsafe(nil), dedent_body = T.unsafe(nil), label_allowed = T.unsafe(nil)); end
+
+  def backslash_delimited?; end
+  def dedent_level; end
+  def end_interp_brace_and_try_closing; end
+  def extend_content; end
+  def extend_space(ts, te); end
+  def extend_string(string, ts, te); end
+  def flush_string; end
+  def heredoc?; end
+  def heredoc_e; end
+  def infer_indent_level(line); end
+  def interpolate?; end
+  def munge_escape?(character); end
+  def nest_and_try_closing(delimiter, ts, te, lookahead = T.unsafe(nil)); end
+  def plain_heredoc?; end
+  def regexp?; end
+  def saved_herebody_s; end
+  def saved_herebody_s=(_arg0); end
+  def squiggly_heredoc?; end
+  def start_interp_brace; end
+  def str_s; end
+  def supports_line_continuation_via_slash?; end
+  def type; end
+  def words?; end
+
+  protected
+
+  def clear_buffer; end
+  def coerce_encoding(string); end
+  def delimiter?(delimiter); end
+  def emit(token, type, s, e); end
+  def emit_start_tok; end
+end
+
+Parser::Lexer::Literal::DELIMITERS = T.let(T.unsafe(nil), Hash)
+Parser::Lexer::Literal::TYPES = T.let(T.unsafe(nil), Hash)
+
+# Mapping of strings to parser tokens.
+#
+# @api public
+Parser::Lexer::PUNCTUATION = T.let(T.unsafe(nil), Hash)
+
+# @api public
+Parser::Lexer::PUNCTUATION_BEGIN = T.let(T.unsafe(nil), Hash)
+
+# @api public
+Parser::Lexer::REGEXP_META_CHARACTERS = T.let(T.unsafe(nil), Regexp)
+
+class Parser::Lexer::StackState
+  def initialize(name); end
+
+  def active?; end
+  def clear; end
+  def empty?; end
+  def inspect; end
+  def lexpop; end
+  def pop; end
+  def push(bit); end
+  def to_s; end
+end
+
+# Diagnostic messages (errors, warnings and notices) that can be generated.
+#
+# @api public
+# @see Diagnostic
+Parser::MESSAGES = T.let(T.unsafe(nil), Hash)
+
+# Holds p->max_numparam from parse.y
+#
+# @api private
+class Parser::MaxNumparamStack
+  # @api private
+  # @return [MaxNumparamStack] a new instance of MaxNumparamStack
+  def initialize; end
+
+  # @api private
+  # @return [Boolean]
+  def empty?; end
+
+  # @api private
+  # @return [Boolean]
+  def has_numparams?; end
+
+  # @api private
+  def has_ordinary_params!; end
+
+  # @api private
+  # @return [Boolean]
+  def has_ordinary_params?; end
+
+  # @api private
+  def pop; end
+
+  # @api private
+  def push(static:); end
+
+  # @api private
+  def register(numparam); end
+
+  # @api private
+  def stack; end
+
+  # @api private
+  def top; end
+
+  private
+
+  # @api private
+  def set(value); end
+end
+
+# @api private
+Parser::MaxNumparamStack::ORDINARY_PARAMS = T.let(T.unsafe(nil), Integer)
+
+# @api private
+module Parser::Messages
+  class << self
+    # Formats the message, returns a raw template if there's nothing to interpolate
+    #
+    # Code like `format("", {})` gives a warning, and so this method tries interpolating
+    # only if `arguments` hash is not empty.
+    #
+    # @api private
+    def compile(reason, arguments); end
+  end
+end
+
+# Parser metadata
+#
+# @api public
+module Parser::Meta; end
+
+# All node types that parser can produce. Not all parser versions
+# will be able to produce every possible node.
+#
+# @api public
+Parser::Meta::NODE_TYPES = T.let(T.unsafe(nil), Set)
+
+# {Parser::Rewriter} is deprecated. Use {Parser::TreeRewriter} instead.
+# It has a backwards compatible API and uses {Parser::Source::TreeRewriter}
+# instead of {Parser::Source::Rewriter}.
+# Please check the documentation for {Parser::Source::Rewriter} for details.
+#
+# @api public
+# @deprecated Use {Parser::TreeRewriter}
+class Parser::Rewriter < ::Parser::AST::Processor
+  extend ::Parser::Deprecation
+
+  # @api public
+  # @return [Rewriter] a new instance of Rewriter
+  def initialize(*_arg0); end
+
+  # Returns `true` if the specified node is an assignment node, returns false
+  # otherwise.
+  #
+  # @api public
+  # @param node [Parser::AST::Node]
+  # @return [Boolean]
+  def assignment?(node); end
+
+  # Inserts new code after the given source range.
+  #
+  # @api public
+  # @param range [Parser::Source::Range]
+  # @param content [String]
+  def insert_after(range, content); end
+
+  # Inserts new code before the given source range.
+  #
+  # @api public
+  # @param range [Parser::Source::Range]
+  # @param content [String]
+  def insert_before(range, content); end
+
+  # Removes the source range.
+  #
+  # @api public
+  # @param range [Parser::Source::Range]
+  def remove(range); end
+
+  # Replaces the code of the source range `range` with `content`.
+  #
+  # @api public
+  # @param range [Parser::Source::Range]
+  # @param content [String]
+  def replace(range, content); end
+
+  # Rewrites the AST/source buffer and returns a String containing the new
+  # version.
+  #
+  # @api public
+  # @param source_buffer [Parser::Source::Buffer]
+  # @param ast [Parser::AST::Node]
+  # @return [String]
+  def rewrite(source_buffer, ast); end
+
+  # Wraps the given source range with the given values.
+  #
+  # @api public
+  # @param range [Parser::Source::Range]
+  # @param content [String]
+  def wrap(range, before, after); end
+end
+
+# @api public
+Parser::Rewriter::DEPRECATION_WARNING = T.let(T.unsafe(nil), String)
+
+# @api public
+module Parser::Source; end
+
+# A buffer with source code. {Buffer} contains the source code itself,
+# associated location information (name and first line), and takes care
+# of encoding.
+#
+# A source buffer is immutable once populated.
+#
+# @api public
+class Parser::Source::Buffer
+  # @api public
+  # @return [Buffer] a new instance of Buffer
+  def initialize(name, first_line = T.unsafe(nil), source: T.unsafe(nil)); end
+
+  # Convert a character index into the source to a column number.
+  #
+  # @api private
+  # @param position [Integer]
+  # @return [Integer] column
+  def column_for_position(position); end
+
+  # Convert a character index into the source to a `[line, column]` tuple.
+  #
+  # @api public
+  # @param position [Integer]
+  # @return [[Integer, Integer]] `[line, column]`
+  def decompose_position(position); end
+
+  # First line of the buffer, 1 by default.
+  #
+  # @api public
+  # @return [Integer] first line
+  def first_line; end
+
+  # @api public
+  def freeze; end
+
+  # @api public
+  def inspect; end
+
+  # Number of last line in the buffer
+  #
+  # @api public
+  # @return [Integer]
+  def last_line; end
+
+  # Convert a character index into the source to a line number.
+  #
+  # @api private
+  # @param position [Integer]
+  # @return [Integer] line
+  def line_for_position(position); end
+
+  # Extract line `lineno` as a new `Range`, taking `first_line` into account.
+  #
+  # @api public
+  # @param lineno [Integer]
+  # @raise [IndexError] if `lineno` is out of bounds
+  # @return [Range]
+  def line_range(lineno); end
+
+  # Buffer name. If the buffer was created from a file, the name corresponds
+  # to relative path to the file.
+  #
+  # @api public
+  # @return [String] buffer name
+  def name; end
+
+  # Populate this buffer from a string without encoding autodetection.
+  #
+  # @api public
+  # @param input [String]
+  # @raise [ArgumentError] if already populated
+  # @return [String]
+  def raw_source=(input); end
+
+  # Populate this buffer from correspondingly named file.
+  #
+  # @api public
+  # @example
+  #   Parser::Source::Buffer.new('foo/bar.rb').read
+  # @raise [ArgumentError] if already populated
+  # @return [Buffer] self
+  def read; end
+
+  # @api public
+  def slice(range); end
+
+  # Source code contained in this buffer.
+  #
+  # @api public
+  # @raise [RuntimeError] if buffer is not populated yet
+  # @return [String] source code
+  def source; end
+
+  # Populate this buffer from a string with encoding autodetection.
+  # `input` is mutated if not frozen.
+  #
+  # @api public
+  # @param input [String]
+  # @raise [ArgumentError] if already populated
+  # @raise [EncodingError] if `input` includes invalid byte sequence for the encoding
+  # @return [String]
+  def source=(input); end
+
+  # Extract line `lineno` from source, taking `first_line` into account.
+  #
+  # @api public
+  # @param lineno [Integer]
+  # @raise [IndexError] if `lineno` is out of bounds
+  # @return [String]
+  def source_line(lineno); end
+
+  # Return an `Array` of source code lines.
+  #
+  # @api public
+  # @return [Array<String>]
+  def source_lines; end
+
+  # @api public
+  # @return [Range] A range covering the whole source
+  def source_range; end
+
+  private
+
+  # @api public
+  def bsearch(line_begins, position); end
+
+  # @api public
+  def line_begins; end
+
+  # @api public
+  def line_index_for_position(position); end
+
+  class << self
+    # Try to recognize encoding of `string` as Ruby would, i.e. by looking for
+    # magic encoding comment or UTF-8 BOM. `string` can be in any encoding.
+    #
+    # @api public
+    # @param string [String]
+    # @return [String, nil] encoding name, if recognized
+    def recognize_encoding(string); end
+
+    # Recognize encoding of `input` and process it so it could be lexed.
+    #
+    #  * If `input` does not contain BOM or magic encoding comment, it is
+    #    kept in the original encoding.
+    #  * If the detected encoding is binary, `input` is kept in binary.
+    #  * Otherwise, `input` is re-encoded into UTF-8 and returned as a
+    #    new string.
+    #
+    # This method mutates the encoding of `input`, but not its content.
+    #
+    # @api public
+    # @param input [String]
+    # @raise [EncodingError]
+    # @return [String]
+    def reencode_string(input); end
+  end
+end
+
+# @api private
+Parser::Source::Buffer::ENCODING_RE = T.let(T.unsafe(nil), Regexp)
+
+# A comment in the source code.
+#
+# @api public
+class Parser::Source::Comment
+  # @api public
+  # @param range [Parser::Source::Range]
+  # @return [Comment] a new instance of Comment
+  def initialize(range); end
+
+  # Compares comments. Two comments are equal if they
+  # correspond to the same source range.
+  #
+  # @api public
+  # @param other [Object]
+  # @return [Boolean]
+  def ==(other); end
+
+  # @api public
+  # @return [Boolean] true if this is a block comment.
+  # @see #type
+  def document?; end
+
+  # @api public
+  # @return [Boolean] true if this is an inline comment.
+  # @see #type
+  def inline?; end
+
+  # @api public
+  # @return [String] a human-readable representation of this comment
+  def inspect; end
+
+  # @api public
+  # @return [Parser::Source::Range]
+  def loc; end
+
+  # @api public
+  # @return [Parser::Source::Range]
+  def location; end
+
+  # @api public
+  # @return [String]
+  def text; end
+
+  # Type of this comment.
+  #
+  #   * Inline comments correspond to `:inline`:
+  #
+  #         # whatever
+  #
+  #   * Block comments correspond to `:document`:
+  #
+  #         =begin
+  #         hi i am a document
+  #         =end
+  #
+  # @api public
+  # @return [Symbol]
+  def type; end
+
+  class << self
+    # Associate `comments` with `ast` nodes by their corresponding node.
+    #
+    # @api public
+    # @deprecated Use {associate_locations}.
+    # @param ast [Parser::AST::Node]
+    # @param comments [Array<Comment>]
+    # @return [Hash<Parser::AST::Node, Array<Comment>>]
+    # @see Parser::Source::Comment::Associator#associate
+    def associate(ast, comments); end
+
+    # Associate `comments` with `ast` nodes using identity.
+    #
+    # @api public
+    # @param ast [Parser::AST::Node]
+    # @param comments [Array<Comment>]
+    # @return [Hash<Parser::Source::Node, Array<Comment>>]
+    # @see Parser::Source::Comment::Associator#associate_by_identity
+    def associate_by_identity(ast, comments); end
+
+    # Associate `comments` with `ast` nodes by their location in the
+    # source.
+    #
+    # @api public
+    # @param ast [Parser::AST::Node]
+    # @param comments [Array<Comment>]
+    # @return [Hash<Parser::Source::Map, Array<Comment>>]
+    # @see Parser::Source::Comment::Associator#associate_locations
+    def associate_locations(ast, comments); end
+  end
+end
+
+class Parser::Source::Comment::Associator
+  def initialize(ast, comments); end
+
+  def associate; end
+  def associate_by_identity; end
+  def associate_locations; end
+  def skip_directives; end
+  def skip_directives=(_arg0); end
+
+  private
+
+  def advance_comment; end
+  def advance_through_directives; end
+  def associate_and_advance_comment(node); end
+  def children_in_source_order(node); end
+  def current_comment_before?(node); end
+  def current_comment_before_end?(node); end
+  def current_comment_decorates?(node); end
+  def do_associate; end
+  def process_leading_comments(node); end
+  def process_trailing_comments(node); end
+  def visit(node); end
+end
+
+Parser::Source::Comment::Associator::MAGIC_COMMENT_RE = T.let(T.unsafe(nil), Regexp)
+Parser::Source::Comment::Associator::POSTFIX_TYPES = T.let(T.unsafe(nil), Set)
+
+# {Map} relates AST nodes to the source code they were parsed from.
+# More specifically, a {Map} or its subclass contains a set of ranges:
+#
+#  * `expression`: smallest range which includes all source corresponding
+#    to the node and all `expression` ranges of its children.
+#  * other ranges (`begin`, `end`, `operator`, ...): node-specific ranges
+#    pointing to various interesting tokens corresponding to the node.
+#
+# Note that the {Map::Heredoc} map is the only one whose `expression` does
+# not include other ranges. It only covers the heredoc marker (`<<HERE`),
+# not the here document itself.
+#
+# All ranges except `expression` are defined by {Map} subclasses.
+#
+# Ranges (except `expression`) can be `nil` if the corresponding token is
+# not present in source. For example, a hash may not have opening/closing
+# braces, and so would its source map.
+#
+#     p Parser::CurrentRuby.parse('[1 => 2]').children[0].loc
+#     # => <Parser::Source::Map::Collection:0x007f5492b547d8
+#     #  @end=nil, @begin=nil,
+#     #  @expression=#<Source::Range (string) 1...7>>
+#
+# The {file:doc/AST_FORMAT.md} document describes how ranges associated to source
+# code tokens. For example, the entry
+#
+#     (array (int 1) (int 2))
+#
+#     "[1, 2]"
+#      ^ begin
+#           ^ end
+#      ~~~~~~ expression
+#
+# means that if `node` is an {Parser::AST::Node} `(array (int 1) (int 2))`,
+# then `node.loc` responds to `begin`, `end` and `expression`, and
+# `node.loc.begin` returns a range pointing at the opening bracket, and so on.
+#
+# If you want to write code polymorphic by the source map (i.e. accepting
+# several subclasses of {Map}), use `respond_to?` instead of `is_a?` to
+# check whether the map features the range you need. Concrete {Map}
+# subclasses may not be preserved between versions, but their interfaces
+# will be kept compatible.
+#
+# You can visualize the source maps with `ruby-parse -E` command-line tool.
+#
+# @api public
+# @example
+#   require 'parser/current'
+#
+#   p Parser::CurrentRuby.parse('[1, 2]').loc
+#   # => #<Parser::Source::Map::Collection:0x007f14b80eccd8
+#   #  @end=#<Source::Range (string) 5...6>,
+#   #  @begin=#<Source::Range (string) 0...1>,
+#   #  @expression=#<Source::Range (string) 0...6>>
+class Parser::Source::Map
+  # @api public
+  # @param expression [Range]
+  # @return [Map] a new instance of Map
+  def initialize(expression); end
+
+  # Compares source maps.
+  #
+  # @api public
+  # @return [Boolean]
+  def ==(other); end
+
+  # A shortcut for `self.expression.column`.
+  #
+  # @api public
+  # @return [Integer]
+  def column; end
+
+  # @api public
+  # @return [Range]
+  def expression; end
+
+  # A shortcut for `self.expression.line`.
+  #
+  # @api public
+  # @return [Integer]
+  def first_line; end
+
+  # A shortcut for `self.expression.last_column`.
+  #
+  # @api public
+  # @return [Integer]
+  def last_column; end
+
+  # A shortcut for `self.expression.last_line`.
+  #
+  # @api public
+  # @return [Integer]
+  def last_line; end
+
+  # A shortcut for `self.expression.line`.
+  #
+  # @api public
+  # @return [Integer]
+  def line; end
+
+  # The node that is described by this map. Nodes and maps have 1:1 correspondence.
+  #
+  # @api public
+  # @return [Parser::AST::Node]
+  def node; end
+
+  # @api private
+  def node=(node); end
+
+  # Converts this source map to a hash with keys corresponding to
+  # ranges. For example, if called on an instance of {Collection},
+  # which adds the `begin` and `end` ranges, the resulting hash
+  # will contain keys `:expression`, `:begin` and `:end`.
+  #
+  # @api public
+  # @example
+  #   require 'parser/current'
+  #
+  #   p Parser::CurrentRuby.parse('[1, 2]').loc.to_hash
+  #   # => {
+  #   #   :begin => #<Source::Range (string) 0...1>,
+  #   #   :end => #<Source::Range (string) 5...6>,
+  #   #   :expression => #<Source::Range (string) 0...6>
+  #   # }
+  # @return [Hash<Symbol, Parser::Source::Range>]
+  def to_hash; end
+
+  # @api private
+  def with_expression(expression_l); end
+
+  protected
+
+  # @api public
+  def update_expression(expression_l); end
+
+  # @api public
+  def with(&block); end
+
+  private
+
+  # @api private
+  def initialize_copy(other); end
+end
+
+# @api public
+class Parser::Source::Map::Collection < ::Parser::Source::Map
+  # @api public
+  # @return [Collection] a new instance of Collection
+  def initialize(begin_l, end_l, expression_l); end
+
+  # @api public
+  def begin; end
+
+  # @api public
+  def end; end
+end
+
+# @api public
+class Parser::Source::Map::Condition < ::Parser::Source::Map
+  # @api public
+  # @return [Condition] a new instance of Condition
+  def initialize(keyword_l, begin_l, else_l, end_l, expression_l); end
+
+  # @api public
+  def begin; end
+
+  # @api public
+  def else; end
+
+  # @api public
+  def end; end
+
+  # @api public
+  def keyword; end
+end
+
+# @api public
+class Parser::Source::Map::Constant < ::Parser::Source::Map
+  # @api public
+  # @return [Constant] a new instance of Constant
+  def initialize(double_colon, name, expression); end
+
+  # @api public
+  def double_colon; end
+
+  # @api public
+  def name; end
+
+  # @api public
+  def operator; end
+
+  # @api private
+  def with_operator(operator_l); end
+
+  protected
+
+  # @api public
+  def update_operator(operator_l); end
+end
+
+# @api public
+class Parser::Source::Map::Definition < ::Parser::Source::Map
+  # @api public
+  # @return [Definition] a new instance of Definition
+  def initialize(keyword_l, operator_l, name_l, end_l); end
+
+  # @api public
+  def end; end
+
+  # @api public
+  def keyword; end
+
+  # @api public
+  def name; end
+
+  # @api public
+  def operator; end
+end
+
+# @api public
+class Parser::Source::Map::For < ::Parser::Source::Map
+  # @api public
+  # @return [For] a new instance of For
+  def initialize(keyword_l, in_l, begin_l, end_l, expression_l); end
+
+  # @api public
+  def begin; end
+
+  # @api public
+  def end; end
+
+  # @api public
+  def in; end
+
+  # @api public
+  def keyword; end
+end
+
+# @api public
+class Parser::Source::Map::Heredoc < ::Parser::Source::Map
+  # @api public
+  # @return [Heredoc] a new instance of Heredoc
+  def initialize(begin_l, body_l, end_l); end
+
+  # @api public
+  def heredoc_body; end
+
+  # @api public
+  def heredoc_end; end
+end
+
+# @api public
+class Parser::Source::Map::Index < ::Parser::Source::Map
+  # @api public
+  # @return [Index] a new instance of Index
+  def initialize(begin_l, end_l, expression_l); end
+
+  # @api public
+  def begin; end
+
+  # @api public
+  def end; end
+
+  # @api public
+  def operator; end
+
+  # @api private
+  def with_operator(operator_l); end
+
+  protected
+
+  # @api public
+  def update_operator(operator_l); end
+end
+
+# @api public
+class Parser::Source::Map::Keyword < ::Parser::Source::Map
+  # @api public
+  # @return [Keyword] a new instance of Keyword
+  def initialize(keyword_l, begin_l, end_l, expression_l); end
+
+  # @api public
+  def begin; end
+
+  # @api public
+  def end; end
+
+  # @api public
+  def keyword; end
+end
+
+# @api public
+class Parser::Source::Map::MethodDefinition < ::Parser::Source::Map
+  # @api public
+  # @return [MethodDefinition] a new instance of MethodDefinition
+  def initialize(keyword_l, operator_l, name_l, end_l, assignment_l, body_l); end
+
+  # @api public
+  def assignment; end
+
+  # @api public
+  def end; end
+
+  # @api public
+  def keyword; end
+
+  # @api public
+  def name; end
+
+  # @api public
+  def operator; end
+end
+
+# @api public
+class Parser::Source::Map::ObjcKwarg < ::Parser::Source::Map
+  # @api public
+  # @return [ObjcKwarg] a new instance of ObjcKwarg
+  def initialize(keyword_l, operator_l, argument_l, expression_l); end
+
+  # @api public
+  def argument; end
+
+  # @api public
+  def keyword; end
+
+  # @api public
+  def operator; end
+end
+
+# @api public
+class Parser::Source::Map::Operator < ::Parser::Source::Map
+  # @api public
+  # @return [Operator] a new instance of Operator
+  def initialize(operator, expression); end
+
+  # @api public
+  def operator; end
+end
+
+# @api public
+class Parser::Source::Map::RescueBody < ::Parser::Source::Map
+  # @api public
+  # @return [RescueBody] a new instance of RescueBody
+  def initialize(keyword_l, assoc_l, begin_l, expression_l); end
+
+  # @api public
+  def assoc; end
+
+  # @api public
+  def begin; end
+
+  # @api public
+  def keyword; end
+end
+
+# @api public
+class Parser::Source::Map::Send < ::Parser::Source::Map
+  # @api public
+  # @return [Send] a new instance of Send
+  def initialize(dot_l, selector_l, begin_l, end_l, expression_l); end
+
+  # @api public
+  def begin; end
+
+  # @api public
+  def dot; end
+
+  # @api public
+  def end; end
+
+  # @api public
+  def operator; end
+
+  # @api public
+  def selector; end
+
+  # @api private
+  def with_operator(operator_l); end
+
+  protected
+
+  # @api public
+  def update_operator(operator_l); end
+end
+
+# @api public
+class Parser::Source::Map::Ternary < ::Parser::Source::Map
+  # @api public
+  # @return [Ternary] a new instance of Ternary
+  def initialize(question_l, colon_l, expression_l); end
+
+  # @api public
+  def colon; end
+
+  # @api public
+  def question; end
+end
+
+# @api public
+class Parser::Source::Map::Variable < ::Parser::Source::Map
+  # @api public
+  # @return [Variable] a new instance of Variable
+  def initialize(name_l, expression_l = T.unsafe(nil)); end
+
+  # @api public
+  def name; end
+
+  # @api public
+  def operator; end
+
+  # @api private
+  def with_operator(operator_l); end
+
+  protected
+
+  # @api public
+  def update_operator(operator_l); end
+end
+
+# A range of characters in a particular source buffer.
+#
+# The range is always exclusive, i.e. a range with `begin_pos` of 3 and
+# `end_pos` of 5 will contain the following characters:
+#
+#     example
+#        ^^
+#
+# @api public
+class Parser::Source::Range
+  include ::Comparable
+
+  # @api public
+  # @param source_buffer [Buffer]
+  # @param begin_pos [Integer]
+  # @param end_pos [Integer]
+  # @return [Range] a new instance of Range
+  def initialize(source_buffer, begin_pos, end_pos); end
+
+  # Compare ranges, first by begin_pos, then by end_pos.
+  #
+  # @api public
+  def <=>(other); end
+
+  # by the given amount(s)
+  #
+  # @api public
+  # @param Endpoint(s) [Hash] to change, any combination of :begin_pos or :end_pos
+  # @return [Range] the same range as this range but with the given end point(s) adjusted
+  def adjust(begin_pos: T.unsafe(nil), end_pos: T.unsafe(nil)); end
+
+  # @api public
+  # @return [Range] a zero-length range located just before the beginning
+  #   of this range.
+  def begin; end
+
+  # @api public
+  # @return [Integer] index of the first character in the range
+  def begin_pos; end
+
+  # @api public
+  # @return [Integer] zero-based column number of the beginning of this range.
+  def column; end
+
+  # @api public
+  # @raise RangeError
+  # @return [::Range] a range of columns spanned by this range.
+  def column_range; end
+
+  # Return `other.contains?(self)`
+  #
+  # Two ranges must be one and only one of ==, disjoint?, contains?, contained? or crossing?
+  #
+  # @api public
+  # @param other [Range]
+  # @return [Boolean]
+  def contained?(other); end
+
+  # Returns true iff this range contains (strictly) `other`.
+  #
+  # Two ranges must be one and only one of ==, disjoint?, contains?, contained? or crossing?
+  #
+  # @api public
+  # @param other [Range]
+  # @return [Boolean]
+  def contains?(other); end
+
+  # Returns true iff both ranges intersect and also have different elements from one another.
+  #
+  # Two ranges must be one and only one of ==, disjoint?, contains?, contained? or crossing?
+  #
+  # @api public
+  # @param other [Range]
+  # @return [Boolean]
+  def crossing?(other); end
+
+  # Return `true` iff this range and `other` are disjoint.
+  #
+  # Two ranges must be one and only one of ==, disjoint?, contains?, contained? or crossing?
+  #
+  # @api public
+  # @param other [Range]
+  # @return [Boolean]
+  def disjoint?(other); end
+
+  # Checks if a range is empty; if it contains no characters
+  #
+  # @api public
+  # @return [Boolean]
+  def empty?; end
+
+  # @api public
+  # @return [Range] a zero-length range located just after the end
+  #   of this range.
+  def end; end
+
+  # @api public
+  # @return [Integer] index of the character after the last character in the range
+  def end_pos; end
+
+  # @api public
+  def eql?(_arg0); end
+
+  # Line number of the beginning of this range. By default, the first line
+  # of a buffer is 1; as such, line numbers are most commonly one-based.
+  #
+  # @api public
+  # @return [Integer] line number of the beginning of this range.
+  # @see Buffer
+  def first_line; end
+
+  # Support for Ranges be used in as Hash indices and in Sets.
+  #
+  # @api public
+  def hash; end
+
+  # @api public
+  # @return [String] a human-readable representation of this range.
+  def inspect; end
+
+  # @api public
+  # @param other [Range]
+  # @return [Range] overlapping region of this range and `other`, or `nil`
+  #   if they do not overlap
+  def intersect(other); end
+
+  # `is?` provides a concise way to compare the source corresponding to this range.
+  # For example, `r.source == '(' || r.source == 'begin'` is equivalent to
+  # `r.is?('(', 'begin')`.
+  #
+  # @api public
+  # @return [Boolean]
+  def is?(*what); end
+
+  # @api public
+  # @param other [Range]
+  # @return [Range] smallest possible range spanning both this range and `other`.
+  def join(other); end
+
+  # @api public
+  # @return [Integer] zero-based column number of the end of this range.
+  def last_column; end
+
+  # @api public
+  # @return [Integer] line number of the end of this range.
+  def last_line; end
+
+  # @api public
+  # @return [Integer] amount of characters included in this range.
+  def length; end
+
+  # Line number of the beginning of this range. By default, the first line
+  # of a buffer is 1; as such, line numbers are most commonly one-based.
+  #
+  # @api public
+  # @return [Integer] line number of the beginning of this range.
+  # @see Buffer
+  def line; end
+
+  # Return `true` iff this range is not disjoint from `other`.
+  #
+  # @api public
+  # @param other [Range]
+  # @return [Boolean] `true` if this range and `other` overlap
+  def overlaps?(other); end
+
+  # @api public
+  # @param new_size [Integer]
+  # @return [Range] a range beginning at the same point as this range and length `new_size`.
+  def resize(new_size); end
+
+  # @api public
+  # @return [Integer] amount of characters included in this range.
+  def size; end
+
+  # @api public
+  # @return [String] all source code covered by this range.
+  def source; end
+
+  # @api public
+  # @return [Parser::Source::Buffer]
+  def source_buffer; end
+
+  # @api public
+  # @return [String] a line of source code containing the beginning of this range.
+  def source_line; end
+
+  # @api public
+  # @return [Array<Integer>] a set of character indexes contained in this range.
+  def to_a; end
+
+  # @api public
+  # @return [Range] a Ruby range with the same `begin_pos` and `end_pos`
+  def to_range; end
+
+  # Composes a GNU/Clang-style string representation of the beginning of this
+  # range.
+  #
+  # For example, for the following range in file `foo.rb`,
+  #
+  #     def foo
+  #         ^^^
+  #
+  # `to_s` will return `foo.rb:1:5`.
+  # Note that the column index is one-based.
+  #
+  # @api public
+  # @return [String]
+  def to_s; end
+
+  # to the given value(s).
+  #
+  # @api public
+  # @param Endpoint(s) [Hash] to change, any combination of :begin_pos or :end_pos
+  # @return [Range] the same range as this range but with the given end point(s) changed
+  def with(begin_pos: T.unsafe(nil), end_pos: T.unsafe(nil)); end
+end
+
+# {Rewriter} is deprecated. Use {TreeRewriter} instead.
+#
+# TreeRewriter has simplified semantics, and customizable policies
+# with regards to clobbering. Please read the documentation.
+#
+# Keep in mind:
+# - Rewriter was discarding the `end_pos` of the given range for `insert_before`,
+#   and the `begin_pos` for `insert_after`. These are meaningful in TreeRewriter.
+# - TreeRewriter's wrap/insert_before/insert_after are multiple by default, while
+#   Rewriter would raise clobbering errors if the non '_multi' version was called.
+# - The TreeRewriter policy closest to Rewriter's behavior is:
+#       different_replacements: :raise,
+#       swallowed_insertions: :raise,
+#       crossing_deletions: :accept
+#
+# @api public
+# @deprecated Use {TreeRewriter}
+class Parser::Source::Rewriter
+  extend ::Parser::Deprecation
+
+  # @api public
+  # @deprecated Use {TreeRewriter}
+  # @param source_buffer [Source::Buffer]
+  # @return [Rewriter] a new instance of Rewriter
+  def initialize(source_buffer); end
+
+  # @api public
+  # @return [Diagnostic::Engine]
+  def diagnostics; end
+
+  # Inserts new code after the given source range.
+  #
+  # @api public
+  # @deprecated Use {TreeRewriter#insert_after}
+  # @param range [Range]
+  # @param content [String]
+  # @raise [ClobberingError] when clobbering is detected
+  # @return [Rewriter] self
+  def insert_after(range, content); end
+
+  # Inserts new code after the given source range by allowing other
+  # insertions at the same position.
+  # Note that an insertion with latter invocation comes _after_ earlier
+  # insertion at the same position in the rewritten source.
+  #
+  # @api public
+  # @deprecated Use {TreeRewriter#insert_after}
+  # @example Inserting ')]'
+  #   rewriter.
+  #   insert_after_multi(range, ')').
+  #   insert_after_multi(range, ']').
+  #   process
+  # @param range [Range]
+  # @param content [String]
+  # @raise [ClobberingError] when clobbering is detected
+  # @return [Rewriter] self
+  def insert_after_multi(range, content); end
+
+  # Inserts new code before the given source range.
+  #
+  # @api public
+  # @deprecated Use {TreeRewriter#insert_before}
+  # @param range [Range]
+  # @param content [String]
+  # @raise [ClobberingError] when clobbering is detected
+  # @return [Rewriter] self
+  def insert_before(range, content); end
+
+  # Inserts new code before the given source range by allowing other
+  # insertions at the same position.
+  # Note that an insertion with latter invocation comes _before_ earlier
+  # insertion at the same position in the rewritten source.
+  #
+  # @api public
+  # @deprecated Use {TreeRewriter#insert_before}
+  # @example Inserting '[('
+  #   rewriter.
+  #   insert_before_multi(range, '(').
+  #   insert_before_multi(range, '[').
+  #   process
+  # @param range [Range]
+  # @param content [String]
+  # @raise [ClobberingError] when clobbering is detected
+  # @return [Rewriter] self
+  def insert_before_multi(range, content); end
+
+  # Applies all scheduled changes to the `source_buffer` and returns
+  # modified source as a new string.
+  #
+  # @api public
+  # @deprecated Use {TreeRewriter#process}
+  # @return [String]
+  def process; end
+
+  # Removes the source range.
+  #
+  # @api public
+  # @deprecated Use {TreeRewriter#remove}
+  # @param range [Range]
+  # @raise [ClobberingError] when clobbering is detected
+  # @return [Rewriter] self
+  def remove(range); end
+
+  # Replaces the code of the source range `range` with `content`.
+  #
+  # @api public
+  # @deprecated Use {TreeRewriter#replace}
+  # @param range [Range]
+  # @param content [String]
+  # @raise [ClobberingError] when clobbering is detected
+  # @return [Rewriter] self
+  def replace(range, content); end
+
+  # @api public
+  # @return [Source::Buffer]
+  def source_buffer; end
+
+  # Provides a protected block where a sequence of multiple rewrite actions
+  # are handled atomically. If any of the actions failed by clobbering,
+  # all the actions are rolled back.
+  #
+  # @api public
+  # @deprecated Use {TreeRewriter#transaction}
+  # @example
+  #   begin
+  #   rewriter.transaction do
+  #   rewriter.insert_before(range_of_something, '(')
+  #   rewriter.insert_after(range_of_something, ')')
+  #   end
+  #   rescue Parser::ClobberingError
+  #   end
+  # @raise [RuntimeError] when no block is passed
+  # @raise [RuntimeError] when already in a transaction
+  def transaction; end
+
+  # Inserts new code before and after the given source range.
+  #
+  # @api public
+  # @deprecated Use {TreeRewriter#wrap}
+  # @param range [Range]
+  # @param before [String]
+  # @param after [String]
+  # @raise [ClobberingError] when clobbering is detected
+  # @return [Rewriter] self
+  def wrap(range, before, after); end
+
+  private
+
+  # @api public
+  def active_clobber; end
+
+  # @api public
+  def active_clobber=(value); end
+
+  # @api public
+  def active_insertions; end
+
+  # @api public
+  def active_insertions=(value); end
+
+  # @api public
+  def active_queue; end
+
+  # @api public
+  # @return [Boolean]
+  def adjacent?(range1, range2); end
+
+  # @api public
+  def adjacent_insertion_mask(range); end
+
+  # @api public
+  # @return [Boolean]
+  def adjacent_insertions?(range); end
+
+  # @api public
+  def adjacent_position_mask(range); end
+
+  # @api public
+  # @return [Boolean]
+  def adjacent_updates?(range); end
+
+  # Schedule a code update. If it overlaps with another update, check
+  # whether they conflict, and raise a clobbering error if they do.
+  # (As a special case, zero-length ranges at the same position are
+  # considered to "overlap".) Otherwise, merge them.
+  #
+  # Updates which are adjacent to each other, but do not overlap, are also
+  # merged.
+  #
+  # RULES:
+  #
+  # - Insertion ("replacing" a zero-length range):
+  #   - Two insertions at the same point conflict. This is true even
+  #     if the earlier insertion has already been merged with an adjacent
+  #     update, and even if they are both inserting the same text.
+  #   - An insertion never conflicts with a replace or remove operation
+  #     on its right or left side, which does not overlap it (in other
+  #     words, which does not update BOTH its right and left sides).
+  #   - An insertion always conflicts with a remove operation which spans
+  #     both its sides.
+  #   - An insertion conflicts with a replace operation which spans both its
+  #     sides, unless the replacement text is longer than the replaced text
+  #     by the size of the insertion (or more), and the portion of
+  #     replacement text immediately after the insertion position is
+  #     identical to the inserted text.
+  #
+  # - Removal operations never conflict with each other.
+  #
+  # - Replacement operations:
+  #   - Take the portion of each replacement text which falls within:
+  #     - The other operation's replaced region
+  #     - The other operation's replacement text, if it extends past the
+  #       end of its own replaced region (in other words, if the replacement
+  #       text is longer than the text it replaces)
+  #   - If and only if the taken texts are identical for both operations,
+  #     they do not conflict.
+  #
+  # @api public
+  def append(action); end
+
+  # @api public
+  # @return [Boolean]
+  def can_merge?(action, existing); end
+
+  # @api public
+  # @return [Boolean]
+  def clobbered_insertion?(insertion); end
+
+  # @api public
+  def clobbered_position_mask(range); end
+
+  # @api public
+  # @return [Boolean]
+  def in_transaction?; end
+
+  # @api public
+  def merge_actions(action, existing); end
+
+  # @api public
+  def merge_actions!(action, existing); end
+
+  # @api public
+  def merge_replacements(actions); end
+
+  # @api public
+  # @raise [ClobberingError]
+  def raise_clobber_error(action, existing); end
+
+  # @api public
+  def record_insertion(range); end
+
+  # @api public
+  def record_replace(range); end
+
+  # @api public
+  def replace_actions(old, updated); end
+
+  # @api public
+  # @return [Boolean]
+  def replace_compatible_with_insertion?(replace, insertion); end
+end
+
+class Parser::Source::Rewriter::Action
+  include ::Comparable
+
+  def initialize(range, replacement = T.unsafe(nil), allow_multiple_insertions = T.unsafe(nil), order = T.unsafe(nil)); end
+
+  def <=>(other); end
+  def allow_multiple_insertions; end
+  def allow_multiple_insertions?; end
+  def order; end
+  def range; end
+  def replacement; end
+  def to_s; end
+end
+
+# @api public
+Parser::Source::Rewriter::DEPRECATION_WARNING = T.let(T.unsafe(nil), String)
+
+# {TreeRewriter} performs the heavy lifting in the source rewriting process.
+# It schedules code updates to be performed in the correct order.
+#
+# For simple cases, the resulting source will be obvious.
+#
+# Examples for more complex cases follow. Assume these examples are acting on
+# the source `'puts(:hello, :world)`. The methods #wrap, #remove, etc.
+# receive a Range as first argument; for clarity, examples below use english
+# sentences and a string of raw code instead.
+#
+# ## Overlapping ranges:
+#
+# Any two rewriting actions on overlapping ranges will fail and raise
+# a `ClobberingError`, unless they are both deletions (covered next).
+#
+# * wrap ':hello, ' with '(' and ')'
+# * wrap ', :world' with '(' and ')'
+#  => CloberringError
+#
+# ## Overlapping deletions:
+#
+# * remove ':hello, '
+# * remove ', :world'
+#
+# The overlapping ranges are merged and `':hello, :world'` will be removed.
+# This policy can be changed. `:crossing_deletions` defaults to `:accept`
+# but can be set to `:warn` or `:raise`.
+#
+# ## Multiple actions at the same end points:
+#
+# Results will always be independent on the order they were given.
+# Exception: rewriting actions done on exactly the same range (covered next).
+#
+# Example:
+# * replace ', ' by ' => '
+# * wrap ':hello, :world' with '{' and '}'
+# * replace ':world' with ':everybody'
+# * wrap ':world' with '[', ']'
+#
+# The resulting string will be `'puts({:hello => [:everybody]})'`
+# and this result is independent on the order the instructions were given in.
+#
+# Note that if the two "replace" were given as a single replacement of ', :world'
+# for ' => :everybody', the result would be a `ClobberingError` because of the wrap
+# in square brackets.
+#
+# ## Multiple wraps on same range:
+# * wrap ':hello' with '(' and ')'
+# * wrap ':hello' with '[' and ']'
+#
+# The wraps are combined in order given and results would be `'puts([(:hello)], :world)'`.
+#
+# ## Multiple replacements on same range:
+# * replace ':hello' by ':hi', then
+# * replace ':hello' by ':hey'
+#
+# The replacements are made in the order given, so the latter replacement
+# supersedes the former and ':hello' will be replaced by ':hey'.
+#
+# This policy can be changed. `:different_replacements` defaults to `:accept`
+# but can be set to `:warn` or `:raise`.
+#
+# ## Swallowed insertions:
+# wrap 'world' by '__', '__'
+# replace ':hello, :world' with ':hi'
+#
+# A containing replacement will swallow the contained rewriting actions
+# and `':hello, :world'` will be replaced by `':hi'`.
+#
+# This policy can be changed for swallowed insertions. `:swallowed_insertions`
+# defaults to `:accept` but can be set to `:warn` or `:raise`
+#
+# ## Implementation
+# The updates are organized in a tree, according to the ranges they act on
+# (where children are strictly contained by their parent), hence the name.
+#
+# @api public
+class Parser::Source::TreeRewriter
+  extend ::Parser::Deprecation
+
+  # @api public
+  # @param source_buffer [Source::Buffer]
+  # @return [TreeRewriter] a new instance of TreeRewriter
+  def initialize(source_buffer, crossing_deletions: T.unsafe(nil), different_replacements: T.unsafe(nil), swallowed_insertions: T.unsafe(nil)); end
+
+  # Returns a representation of the rewriter as nested insertions (:wrap) and replacements.
+  #
+  #     rewriter.as_actions # =>[ [:wrap, 1...10, '(', ')'],
+  #                               [:wrap, 2...6, '', '!'],  # aka "insert_after"
+  #                               [:replace, 2...4, 'foo'],
+  #                               [:replace, 5...6, ''],  # aka "removal"
+  #                             ],
+  #
+  # Contrary to `as_replacements`, this representation is sufficient to recreate exactly
+  # the rewriter.
+  #
+  # @api public
+  # @return [Array<(Symbol, Range, String{, String})>]
+  def as_nested_actions; end
+
+  # Returns a representation of the rewriter as an ordered list of replacements.
+  #
+  #     rewriter.as_replacements # => [ [1...1, '('],
+  #                                     [2...4, 'foo'],
+  #                                     [5...6, ''],
+  #                                     [6...6, '!'],
+  #                                     [10...10, ')'],
+  #                                   ]
+  #
+  # This representation is sufficient to recreate the result of `process` but it is
+  # not sufficient to recreate completely the rewriter for further merging/actions.
+  # See `as_nested_actions`
+  #
+  # @api public
+  # @return [Array<Range, String>] an ordered list of pairs of range & replacement
+  def as_replacements; end
+
+  # @api public
+  # @return [Diagnostic::Engine]
+  def diagnostics; end
+
+  # Returns true iff no (non trivial) update has been recorded
+  #
+  # @api public
+  # @return [Boolean]
+  def empty?; end
+
+  # For special cases where one needs to merge a rewriter attached to a different source_buffer
+  # or that needs to be offset. Policies of the receiver are used.
+  #
+  # @api public
+  # @param rewriter [TreeRewriter] from different source_buffer
+  # @param offset [Integer]
+  # @raise [IndexError] if action ranges (once offset) don't fit the current buffer
+  # @return [Rewriter] self
+  def import!(foreign_rewriter, offset: T.unsafe(nil)); end
+
+  # @api public
+  # @return [Boolean]
+  def in_transaction?; end
+
+  # Shortcut for `wrap(range, nil, content)`
+  #
+  # @api public
+  # @param range [Range]
+  # @param content [String]
+  # @raise [ClobberingError] when clobbering is detected
+  # @return [Rewriter] self
+  def insert_after(range, content); end
+
+  # @api private
+  # @deprecated Use insert_after or wrap
+  def insert_after_multi(range, text); end
+
+  # Shortcut for `wrap(range, content, nil)`
+  #
+  # @api public
+  # @param range [Range]
+  # @param content [String]
+  # @raise [ClobberingError] when clobbering is detected
+  # @return [Rewriter] self
+  def insert_before(range, content); end
+
+  # @api private
+  # @deprecated Use insert_after or wrap
+  def insert_before_multi(range, text); end
+
+  # @api public
+  def inspect; end
+
+  # Returns a new rewriter that consists of the updates of the received
+  # and the given argument. Policies of the receiver are used.
+  #
+  # @api public
+  # @param with [Rewriter]
+  # @raise [ClobberingError] when clobbering is detected
+  # @return [Rewriter] merge of receiver and argument
+  def merge(with); end
+
+  # Merges the updates of argument with the receiver.
+  # Policies of the receiver are used.
+  # This action is atomic in that it won't change the receiver
+  # unless it succeeds.
+  #
+  # @api public
+  # @param with [Rewriter]
+  # @raise [ClobberingError] when clobbering is detected
+  # @return [Rewriter] self
+  def merge!(with); end
+
+  # Applies all scheduled changes to the `source_buffer` and returns
+  # modified source as a new string.
+  #
+  # @api public
+  # @return [String]
+  def process; end
+
+  # Shortcut for `replace(range, '')`
+  #
+  # @api public
+  # @param range [Range]
+  # @raise [ClobberingError] when clobbering is detected
+  # @return [Rewriter] self
+  def remove(range); end
+
+  # Replaces the code of the source range `range` with `content`.
+  #
+  # @api public
+  # @param range [Range]
+  # @param content [String]
+  # @raise [ClobberingError] when clobbering is detected
+  # @return [Rewriter] self
+  def replace(range, content); end
+
+  # @api public
+  # @return [Source::Buffer]
+  def source_buffer; end
+
+  # Provides a protected block where a sequence of multiple rewrite actions
+  # are handled atomically. If any of the actions failed by clobbering,
+  # all the actions are rolled back. Transactions can be nested.
+  #
+  # @api public
+  # @raise [RuntimeError] when no block is passed
+  def transaction; end
+
+  # Inserts the given strings before and after the given range.
+  #
+  # @api public
+  # @param range [Range]
+  # @param insert_before [String, nil]
+  # @param insert_after [String, nil]
+  # @raise [ClobberingError] when clobbering is detected
+  # @return [Rewriter] self
+  def wrap(range, insert_before, insert_after); end
+
+  protected
+
+  # @api public
+  def action_root; end
+
+  private
+
+  # @api public
+  def action_summary; end
+
+  # @api public
+  # @raise [ArgumentError]
+  def check_policy_validity; end
+
+  # @api public
+  def check_range_validity(range); end
+
+  # @api public
+  def combine(range, attributes); end
+
+  # @api public
+  def enforce_policy(event); end
+
+  # @api public
+  # @raise [Parser::ClobberingError]
+  def trigger_policy(event, range: T.unsafe(nil), conflict: T.unsafe(nil), **arguments); end
+end
+
+# @api public
+Parser::Source::TreeRewriter::ACTIONS = T.let(T.unsafe(nil), Array)
+
+# Actions are arranged in a tree and get combined so that:
+#   children are strictly contained by their parent
+#   sibblings all disjoint from one another and ordered
+#   only actions with replacement==nil may have children
+#
+# @api private
+class Parser::Source::TreeRewriter::Action
+  # @api private
+  # @return [Action] a new instance of Action
+  def initialize(range, enforcer, insert_before: T.unsafe(nil), replacement: T.unsafe(nil), insert_after: T.unsafe(nil), children: T.unsafe(nil)); end
+
+  # @api private
+  def combine(action); end
+
+  # A root action has its range set to the whole source range, even
+  # though it typically do not act on that range.
+  # This method returns the action as if it was a child action with
+  # its range contracted.
+  #
+  # @api private
+  # @return [Action]
+  def contract; end
+
+  # @api private
+  # @return [Boolean]
+  def empty?; end
+
+  # @api private
+  def insert_after; end
+
+  # @api private
+  def insert_before; end
+
+  # @api private
+  # @return [Boolean]
+  def insertion?; end
+
+  # No check is done on validity of resulting range.
+  #
+  # @api private
+  # @return [Action] that has been moved to the given source_buffer and with the given offset
+  def moved(source_buffer, offset); end
+
+  # @api private
+  def nested_actions; end
+
+  # @api private
+  def ordered_replacements; end
+
+  # @api private
+  def range; end
+
+  # @api private
+  def replacement; end
+
+  protected
+
+  # Returns the children in a hierarchy with respect to `action`:
+  #   :sibbling_left, sibbling_right (for those that are disjoint from `action`)
+  #   :parent (in case one of our children contains `action`)
+  #   :child (in case `action` strictly contains some of our children)
+  #   :fusible (in case `action` overlaps some children but they can be fused in one deletion)
+  #   or raises a `CloberingError`
+  # In case a child has equal range to `action`, it is returned as `:parent`
+  # Reminder: an empty range 1...1 is considered disjoint from 1...10
+  #
+  # @api private
+  def analyse_hierarchy(action); end
+
+  # Similar to @children.bsearch_index || size
+  # except allows for a starting point
+  # and `bsearch_index` is only Ruby 2.3+
+  #
+  # @api private
+  def bsearch_child_index(from = T.unsafe(nil)); end
+
+  # @api private
+  def call_enforcer_for_merge(action); end
+
+  # @api private
+  # @param fusible [Array(Action | nil)]
+  def check_fusible(action, *fusible); end
+
+  # @api private
+  def children; end
+
+  # Assumes `more_children` all contained within `@range`
+  #
+  # @api private
+  def combine_children(more_children); end
+
+  # Assumes range.contains?(action.range) && action.children.empty?
+  #
+  # @api private
+  def do_combine(action); end
+
+  # @api private
+  def fuse_deletions(action, fusible, other_sibblings); end
+
+  # Assumes action.range == range && action.children.empty?
+  #
+  # @api private
+  def merge(action); end
+
+  # @api private
+  def place_in_hierarchy(action); end
+
+  # @api private
+  def swallow(children); end
+
+  # @api private
+  def with(range: T.unsafe(nil), enforcer: T.unsafe(nil), children: T.unsafe(nil), insert_before: T.unsafe(nil), replacement: T.unsafe(nil), insert_after: T.unsafe(nil)); end
+end
+
+# @api public
+Parser::Source::TreeRewriter::DEPRECATION_WARNING = T.let(T.unsafe(nil), String)
+
+# @api public
+Parser::Source::TreeRewriter::POLICY_TO_LEVEL = T.let(T.unsafe(nil), Hash)
+
+# @api public
+class Parser::StaticEnvironment
+  # @api public
+  # @return [StaticEnvironment] a new instance of StaticEnvironment
+  def initialize; end
+
+  # @api public
+  def declare(name); end
+
+  # @api public
+  def declare_anonymous_blockarg; end
+
+  # @api public
+  def declare_forward_args; end
+
+  # @api public
+  # @return [Boolean]
+  def declared?(name); end
+
+  # @api public
+  # @return [Boolean]
+  def declared_anonymous_blockarg?; end
+
+  # @api public
+  # @return [Boolean]
+  def declared_forward_args?; end
+
+  # @api public
+  # @return [Boolean]
+  def empty?; end
+
+  # @api public
+  def extend_dynamic; end
+
+  # @api public
+  def extend_static; end
+
+  # @api public
+  def reset; end
+
+  # @api public
+  def unextend; end
+end
+
+# @api public
+Parser::StaticEnvironment::ANONYMOUS_BLOCKARG = T.let(T.unsafe(nil), Symbol)
+
+# @api public
+Parser::StaticEnvironment::FORWARD_ARGS = T.let(T.unsafe(nil), Symbol)
+
+# {Parser::SyntaxError} is raised whenever parser detects a syntax error,
+# similar to the standard SyntaxError class.
+#
+# @api public
+class Parser::SyntaxError < ::StandardError
+  # @api public
+  # @return [SyntaxError] a new instance of SyntaxError
+  def initialize(diagnostic); end
+
+  # @api public
+  # @return [Parser::Diagnostic]
+  def diagnostic; end
+end
+
+# {Parser::TreeRewriter} offers a basic API that makes it easy to rewrite
+# existing ASTs. It's built on top of {Parser::AST::Processor} and
+# {Parser::Source::TreeRewriter}
+#
+# For example, assume you want to remove `do` tokens from a while statement.
+# You can do this as following:
+#
+#     require 'parser/current'
+#
+#     class RemoveDo < Parser::TreeRewriter
+#       def on_while(node)
+#         # Check if the statement starts with "do"
+#         if node.location.begin.is?('do')
+#           remove(node.location.begin)
+#         end
+#       end
+#     end
+#
+#     code = <<-EOF
+#     while true do
+#       puts 'hello'
+#     end
+#     EOF
+#
+#     ast           = Parser::CurrentRuby.parse code
+#     buffer        = Parser::Source::Buffer.new('(example)', source: code)
+#     rewriter      = RemoveDo.new
+#
+#     # Rewrite the AST, returns a String with the new form.
+#     puts rewriter.rewrite(buffer, ast)
+#
+# This would result in the following Ruby code:
+#
+#     while true
+#       puts 'hello'
+#     end
+#
+# Keep in mind that {Parser::TreeRewriter} does not take care of indentation when
+# inserting/replacing code so you'll have to do this yourself.
+#
+# See also [a blog entry](http://whitequark.org/blog/2013/04/26/lets-play-with-ruby-code/)
+# describing rewriters in greater detail.
+#
+# @api public
+class Parser::TreeRewriter < ::Parser::AST::Processor
+  # Returns `true` if the specified node is an assignment node, returns false
+  # otherwise.
+  #
+  # @api public
+  # @param node [Parser::AST::Node]
+  # @return [Boolean]
+  def assignment?(node); end
+
+  # Inserts new code after the given source range.
+  #
+  # @api public
+  # @param range [Parser::Source::Range]
+  # @param content [String]
+  def insert_after(range, content); end
+
+  # Inserts new code before the given source range.
+  #
+  # @api public
+  # @param range [Parser::Source::Range]
+  # @param content [String]
+  def insert_before(range, content); end
+
+  # Removes the source range.
+  #
+  # @api public
+  # @param range [Parser::Source::Range]
+  def remove(range); end
+
+  # Replaces the code of the source range `range` with `content`.
+  #
+  # @api public
+  # @param range [Parser::Source::Range]
+  # @param content [String]
+  def replace(range, content); end
+
+  # Rewrites the AST/source buffer and returns a String containing the new
+  # version.
+  #
+  # @api public
+  # @param source_buffer [Parser::Source::Buffer]
+  # @param ast [Parser::AST::Node]
+  # @param crossing_deletions:, [Symbol] different_replacements:, swallowed_insertions:
+  #   policy arguments for TreeRewriter (optional)
+  # @return [String]
+  def rewrite(source_buffer, ast, **policy); end
+
+  # Wraps the given source range with the given values.
+  #
+  # @api public
+  # @param range [Parser::Source::Range]
+  # @param content [String]
+  def wrap(range, before, after); end
+end
+
+# @api public
+Parser::VERSION = T.let(T.unsafe(nil), String)
+
+# @api public
+class Parser::VariablesStack
+  # @api public
+  # @return [VariablesStack] a new instance of VariablesStack
+  def initialize; end
+
+  # @api public
+  def declare(name); end
+
+  # @api public
+  # @return [Boolean]
+  def declared?(name); end
+
+  # @api public
+  # @return [Boolean]
+  def empty?; end
+
+  # @api public
+  def pop; end
+
+  # @api public
+  def push; end
+
+  # @api public
+  def reset; end
+end