jruby-prism-parser 0.24.0-java → 1.4.0-java

metadata

@@ -1,16 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: jruby-prism-parser
 version: !ruby/object:Gem::Version
-  version: 0.24.0
+  version: 1.4.0
 platform: java
 authors:
 - JRuby Team
-autorequire:
 bindir: bin
 cert_chain: []
-date: 2024-02-23 00:00:00.000000000 Z
+date: 2025-03-27 00:00:00.000000000 Z
 dependencies: []
-description:
 email:
 - admin@jruby.org
 executables: []
@@ -18,6 +16,7 @@ extensions:
 - ext/prism/extconf.rb
 extra_rdoc_files: []
 files:
+- BSDmakefile
 - CHANGELOG.md
 - CODE_OF_CONDUCT.md
 - CONTRIBUTING.md
@@ -38,7 +37,8 @@ files:
 - docs/parser_translation.md
 - docs/parsing_rules.md
 - docs/releasing.md
-- docs/ripper.md
+- docs/relocation.md
+- docs/ripper_translation.md
 - docs/ruby_api.md
 - docs/ruby_parser_translation.md
 - docs/serialization.md
@@ -59,54 +59,92 @@ files:
 - include/prism/parser.h
 - include/prism/prettyprint.h
 - include/prism/regexp.h
+- include/prism/static_literals.h
 - include/prism/util/pm_buffer.h
 - include/prism/util/pm_char.h
 - include/prism/util/pm_constant_pool.h
+- include/prism/util/pm_integer.h
 - include/prism/util/pm_list.h
 - include/prism/util/pm_memchr.h
 - include/prism/util/pm_newline_list.h
-- include/prism/util/pm_state_stack.h
 - include/prism/util/pm_string.h
-- include/prism/util/pm_string_list.h
 - include/prism/util/pm_strncasecmp.h
 - include/prism/util/pm_strpbrk.h
 - include/prism/version.h
 - jruby-prism.jar
 - lib/prism.rb
 - lib/prism/compiler.rb
-- lib/prism/debug.rb
 - lib/prism/desugar_compiler.rb
 - lib/prism/dispatcher.rb
 - lib/prism/dot_visitor.rb
 - lib/prism/dsl.rb
 - lib/prism/ffi.rb
+- lib/prism/inspect_visitor.rb
 - lib/prism/lex_compat.rb
 - lib/prism/mutation_compiler.rb
 - lib/prism/node.rb
 - lib/prism/node_ext.rb
-- lib/prism/node_inspector.rb
 - lib/prism/pack.rb
 - lib/prism/parse_result.rb
 - lib/prism/parse_result/comments.rb
+- lib/prism/parse_result/errors.rb
 - lib/prism/parse_result/newlines.rb
 - lib/prism/pattern.rb
+- lib/prism/polyfill/append_as_bytes.rb
+- lib/prism/polyfill/byteindex.rb
+- lib/prism/polyfill/unpack1.rb
+- lib/prism/reflection.rb
+- lib/prism/relocation.rb
 - lib/prism/serialize.rb
+- lib/prism/string_query.rb
 - lib/prism/translation.rb
 - lib/prism/translation/parser.rb
+- lib/prism/translation/parser/builder.rb
 - lib/prism/translation/parser/compiler.rb
 - lib/prism/translation/parser/lexer.rb
-- lib/prism/translation/parser/rubocop.rb
 - lib/prism/translation/parser33.rb
 - lib/prism/translation/parser34.rb
+- lib/prism/translation/parser35.rb
 - lib/prism/translation/ripper.rb
+- lib/prism/translation/ripper/sexp.rb
+- lib/prism/translation/ripper/shim.rb
 - lib/prism/translation/ruby_parser.rb
 - lib/prism/version.rb
 - lib/prism/visitor.rb
 - prism.gemspec
 - rbi/prism.rbi
-- rbi/prism_static.rbi
+- rbi/prism/compiler.rbi
+- rbi/prism/dsl.rbi
+- rbi/prism/inspect_visitor.rbi
+- rbi/prism/node.rbi
+- rbi/prism/node_ext.rbi
+- rbi/prism/parse_result.rbi
+- rbi/prism/reflection.rbi
+- rbi/prism/string_query.rbi
+- rbi/prism/translation/parser.rbi
+- rbi/prism/translation/parser33.rbi
+- rbi/prism/translation/parser34.rbi
+- rbi/prism/translation/parser35.rbi
+- rbi/prism/translation/ripper.rbi
+- rbi/prism/visitor.rbi
 - sig/prism.rbs
-- sig/prism_static.rbs
+- sig/prism/compiler.rbs
+- sig/prism/dispatcher.rbs
+- sig/prism/dot_visitor.rbs
+- sig/prism/dsl.rbs
+- sig/prism/inspect_visitor.rbs
+- sig/prism/lex_compat.rbs
+- sig/prism/mutation_compiler.rbs
+- sig/prism/node.rbs
+- sig/prism/node_ext.rbs
+- sig/prism/pack.rbs
+- sig/prism/parse_result.rbs
+- sig/prism/pattern.rbs
+- sig/prism/reflection.rbs
+- sig/prism/relocation.rbs
+- sig/prism/serialize.rbs
+- sig/prism/string_query.rbs
+- sig/prism/visitor.rbs
 - src/diagnostic.c
 - src/encoding.c
 - src/node.c
@@ -116,16 +154,16 @@ files:
 - src/prism.c
 - src/regexp.c
 - src/serialize.c
+- src/static_literals.c
 - src/token_type.c
 - src/util/pm_buffer.c
 - src/util/pm_char.c
 - src/util/pm_constant_pool.c
+- src/util/pm_integer.c
 - src/util/pm_list.c
 - src/util/pm_memchr.c
 - src/util/pm_newline_list.c
-- src/util/pm_state_stack.c
 - src/util/pm_string.c
-- src/util/pm_string_list.c
 - src/util/pm_strncasecmp.c
 - src/util/pm_strpbrk.c
 homepage: https://github.com/jruby/jruby-prism
@@ -135,7 +173,6 @@ metadata:
   allowed_push_host: https://rubygems.org
   source_code_uri: https://github.com/ruby/prism
   changelog_uri: https://github.com/ruby/prism/blob/main/CHANGELOG.md
-post_install_message:
 rdoc_options: []
 require_paths:
 - lib
@@ -143,16 +180,15 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
-      version: 2.7.0
+      version: 3.4.0
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 requirements:
-- jar org.jruby, jruby-prism, 0.24.0, :scope => :runtime
-rubygems_version: 3.3.26
-signing_key:
+- jar org.jruby, jruby-prism, 1.4.0, :scope => :runtime
+rubygems_version: 3.6.2
 specification_version: 4
 summary: Prism JRuby Parser Support
 test_files: []

data/docs/ripper.md

@@ -1,36 +0,0 @@
-# Ripper
-
-To test the parser, we compare against the output from `Ripper`, both for testing the lexer and testing the parser. The lexer test suite is much more feature complete at the moment.
-
-To lex source code using `prism`, you typically would run `Prism.lex(source)`. If you want to instead get output that `Ripper` would normally produce, you can run `Prism.lex_compat(source)`. This will produce tokens that should be equivalent to `Ripper`.
-
-To parse source code using `prism`, you typically would run `Prism.parse(source)`. If you want to instead using the `Ripper` streaming interface, you can inherit from `Prism::RipperCompat` and override the `on_*` methods. This will produce a syntax tree that should be equivalent to `Ripper`. That would look like:
-
-```ruby
-class ArithmeticRipper < Prism::RipperCompat
-  def on_binary(left, operator, right)
-    left.public_send(operator, right)
-  end
-
-  def on_int(value)
-    value.to_i
-  end
-
-  def on_program(stmts)
-    stmts
-  end
-
-  def on_stmts_new
-    []
-  end
-
-  def on_stmts_add(stmts, stmt)
-    stmts << stmt
-    stmts
-  end
-end
-
-ArithmeticRipper.new("1 + 2 - 3").parse # => [0]
-```
-
-There are also APIs for building trees similar to the s-expression builders in `Ripper`. The method names are the same. These include `Prism::RipperCompat.sexp_raw(source)` and `Prism::RipperCompat.sexp(source)`.

data/include/prism/util/pm_state_stack.h

@@ -1,42 +0,0 @@
-/**
- * @file pm_state_stack.h
- *
- * A stack of boolean values.
- */
-#ifndef PRISM_STATE_STACK_H
-#define PRISM_STATE_STACK_H
-
-#include "prism/defines.h"
-
-#include <stdbool.h>
-#include <stdint.h>
-
-/**
- * A struct that represents a stack of boolean values.
- */
-typedef uint32_t pm_state_stack_t;
-
-/**
- * Pushes a value onto the stack.
- *
- * @param stack The stack to push the value onto.
- * @param value The value to push onto the stack.
- */
-void pm_state_stack_push(pm_state_stack_t *stack, bool value);
-
-/**
- * Pops a value off the stack.
- *
- * @param stack The stack to pop the value off of.
- */
-void pm_state_stack_pop(pm_state_stack_t *stack);
-
-/**
- * Returns the value at the top of the stack.
- *
- * @param stack The stack to get the value from.
- * @return The value at the top of the stack.
- */
-bool pm_state_stack_p(pm_state_stack_t *stack);
-
-#endif

data/include/prism/util/pm_string_list.h

@@ -1,44 +0,0 @@
-/**
- * @file pm_string_list.h
- *
- * A list of strings.
- */
-#ifndef PRISM_STRING_LIST_H
-#define PRISM_STRING_LIST_H
-
-#include "prism/defines.h"
-#include "prism/util/pm_string.h"
-
-#include <stddef.h>
-#include <stdlib.h>
-
-/**
- * A list of strings.
- */
-typedef struct {
-    /** The length of the string list. */
-    size_t length;
-
-    /** The capacity of the string list that has been allocated. */
-    size_t capacity;
-
-    /** A pointer to the start of the string list. */
-    pm_string_t *strings;
-} pm_string_list_t;
-
-/**
- * Append a pm_string_t to the given string list.
- *
- * @param string_list The string list to append to.
- * @param string The string to append.
- */
-void pm_string_list_append(pm_string_list_t *string_list, pm_string_t *string);
-
-/**
- * Free the memory associated with the string list.
- *
- * @param string_list The string list to free.
- */
-PRISM_EXPORTED_FUNCTION void pm_string_list_free(pm_string_list_t *string_list);
-
-#endif

data/lib/prism/debug.rb

@@ -1,206 +0,0 @@
-# frozen_string_literal: true
-
-module Prism
-  # This module is used for testing and debugging and is not meant to be used by
-  # consumers of this library.
-  module Debug
-    # A wrapper around a RubyVM::InstructionSequence that provides a more
-    # convenient interface for accessing parts of the iseq.
-    class ISeq # :nodoc:
-      attr_reader :parts
-
-      def initialize(parts)
-        @parts = parts
-      end
-
-      def type
-        parts[0]
-      end
-
-      def local_table
-        parts[10]
-      end
-
-      def instructions
-        parts[13]
-      end
-
-      def each_child
-        instructions.each do |instruction|
-          # Only look at arrays. Other instructions are line numbers or
-          # tracepoint events.
-          next unless instruction.is_a?(Array)
-
-          instruction.each do |opnd|
-            # Only look at arrays. Other operands are literals.
-            next unless opnd.is_a?(Array)
-
-            # Only look at instruction sequences. Other operands are literals.
-            next unless opnd[0] == "YARVInstructionSequence/SimpleDataFormat"
-
-            yield ISeq.new(opnd)
-          end
-        end
-      end
-    end
-
-    private_constant :ISeq
-
-    # :call-seq:
-    #   Debug::cruby_locals(source) -> Array
-    #
-    # For the given source, compiles with CRuby and returns a list of all of the
-    # sets of local variables that were encountered.
-    def self.cruby_locals(source)
-      verbose, $VERBOSE = $VERBOSE, nil
-
-      begin
-        locals = []
-        stack = [ISeq.new(RubyVM::InstructionSequence.compile(source).to_a)]
-
-        while (iseq = stack.pop)
-          names = [*iseq.local_table]
-          names.map!.with_index do |name, index|
-            # When an anonymous local variable is present in the iseq's local
-            # table, it is represented as the stack offset from the top.
-            # However, when these are dumped to binary and read back in, they
-            # are replaced with the symbol :#arg_rest. To consistently handle
-            # this, we replace them here with their index.
-            if name == :"#arg_rest"
-              names.length - index + 1
-            else
-              name
-            end
-          end
-
-          locals << names
-          iseq.each_child { |child| stack << child }
-        end
-
-        locals
-      ensure
-        $VERBOSE = verbose
-      end
-    end
-
-    # Used to hold the place of a local that will be in the local table but
-    # cannot be accessed directly from the source code. For example, the
-    # iteration variable in a for loop or the positional parameter on a method
-    # definition that is destructured.
-    AnonymousLocal = Object.new
-    private_constant :AnonymousLocal
-
-    # :call-seq:
-    #   Debug::prism_locals(source) -> Array
-    #
-    # For the given source, parses with prism and returns a list of all of the
-    # sets of local variables that were encountered.
-    def self.prism_locals(source)
-      locals = []
-      stack = [Prism.parse(source).value]
-
-      while (node = stack.pop)
-        case node
-        when BlockNode, DefNode, LambdaNode
-          names = node.locals
-          params =
-            if node.is_a?(DefNode)
-              node.parameters
-            elsif node.parameters.is_a?(NumberedParametersNode)
-              nil
-            else
-              node.parameters&.parameters
-            end
-
-          # prism places parameters in the same order that they appear in the
-          # source. CRuby places them in the order that they need to appear
-          # according to their own internal calling convention. We mimic that
-          # order here so that we can compare properly.
-          if params
-            sorted = [
-              *params.requireds.map do |required|
-                if required.is_a?(RequiredParameterNode)
-                  required.name
-                else
-                  AnonymousLocal
-                end
-              end,
-              *params.optionals.map(&:name),
-              *((params.rest.name || :*) if params.rest && !params.rest.is_a?(ImplicitRestNode)),
-              *params.posts.map do |post|
-                if post.is_a?(RequiredParameterNode)
-                  post.name
-                else
-                  AnonymousLocal
-                end
-              end,
-              *params.keywords.grep(RequiredKeywordParameterNode).map(&:name),
-              *params.keywords.grep(OptionalKeywordParameterNode).map(&:name),
-            ]
-
-            sorted << AnonymousLocal if params.keywords.any?
-
-            if params.keyword_rest.is_a?(ForwardingParameterNode)
-              sorted.push(:*, :**, :&, :"...")
-            elsif params.keyword_rest.is_a?(KeywordRestParameterNode)
-              sorted << (params.keyword_rest.name || :**)
-            end
-
-            # Recurse down the parameter tree to find any destructured
-            # parameters and add them after the other parameters.
-            param_stack = params.requireds.concat(params.posts).grep(MultiTargetNode).reverse
-            while (param = param_stack.pop)
-              case param
-              when MultiTargetNode
-                param_stack.concat(param.rights.reverse)
-                param_stack << param.rest if param.rest&.expression && !sorted.include?(param.rest.expression.name)
-                param_stack.concat(param.lefts.reverse)
-              when RequiredParameterNode
-                sorted << param.name
-              when SplatNode
-                sorted << param.expression.name
-              end
-            end
-
-            if params.block
-              sorted << (params.block.name || :&)
-            end
-
-            names = sorted.concat(names - sorted)
-          end
-
-          names.map!.with_index do |name, index|
-            if name == AnonymousLocal
-              names.length - index + 1
-            else
-              name
-            end
-          end
-
-          locals << names
-        when ClassNode, ModuleNode, ProgramNode, SingletonClassNode
-          locals << node.locals
-        when ForNode
-          locals << [2]
-        when PostExecutionNode
-          locals.push([], [])
-        when InterpolatedRegularExpressionNode
-          locals << [] if node.once?
-        end
-
-        stack.concat(node.compact_child_nodes)
-      end
-
-      locals
-    end
-
-    # :call-seq:
-    #   Debug::newlines(source) -> Array
-    #
-    # For the given source string, return the byte offsets of every newline in
-    # the source.
-    def self.newlines(source)
-      Prism.parse(source).source.offsets
-    end
-  end
-end

data/lib/prism/node_inspector.rb

@@ -1,68 +0,0 @@
-# frozen_string_literal: true
-
-module Prism
-  # This object is responsible for generating the output for the inspect method
-  # implementations of child nodes.
-  class NodeInspector # :nodoc:
-    attr_reader :prefix, :output
-
-    def initialize(prefix = "")
-      @prefix = prefix
-      @output = +""
-    end
-
-    # Appends a line to the output with the current prefix.
-    def <<(line)
-      output << "#{prefix}#{line}"
-    end
-
-    # This generates a string that is used as the header of the inspect output
-    # for any given node.
-    def header(node)
-      output = +"@ #{node.class.name.split("::").last} ("
-      output << "location: (#{node.location.start_line},#{node.location.start_column})-(#{node.location.end_line},#{node.location.end_column})"
-      output << ", newline: true" if node.newline?
-      output << ")\n"
-      output
-    end
-
-    # Generates a string that represents a list of nodes. It handles properly
-    # using the box drawing characters to make the output look nice.
-    def list(prefix, nodes)
-      output = +"(length: #{nodes.length})\n"
-      last_index = nodes.length - 1
-
-      nodes.each_with_index do |node, index|
-        pointer, preadd = (index == last_index) ? ["└── ", "    "] : ["├── ", "│   "]
-        node_prefix = "#{prefix}#{preadd}"
-        output << node.inspect(NodeInspector.new(node_prefix)).sub(node_prefix, "#{prefix}#{pointer}")
-      end
-
-      output
-    end
-
-    # Generates a string that represents a location field on a node.
-    def location(value)
-      if value
-        "(#{value.start_line},#{value.start_column})-(#{value.end_line},#{value.end_column}) = #{value.slice.inspect}"
-      else
-        "∅"
-      end
-    end
-
-    # Generates a string that represents a child node.
-    def child_node(node, append)
-      node.inspect(child_inspector(append)).delete_prefix(prefix)
-    end
-
-    # Returns a new inspector that can be used to inspect a child node.
-    def child_inspector(append)
-      NodeInspector.new("#{prefix}#{append}")
-    end
-
-    # Returns the output as a string.
-    def to_str
-      output
-    end
-  end
-end

data/lib/prism/translation/parser/rubocop.rb

@@ -1,45 +0,0 @@
-# frozen_string_literal: true
-
-require "parser"
-require "rubocop"
-
-require "prism"
-require "prism/translation/parser"
-
-module Prism
-  module Translation
-    class Parser
-      # This is the special version numbers that should be used in RuboCop
-      # configuration files to trigger using prism.
-
-      # For Ruby 3.3
-      VERSION_3_3 = 80_82_73_83_77.33
-
-      # For Ruby 3.4
-      VERSION_3_4 = 80_82_73_83_77.34
-
-      # This module gets prepended into RuboCop::AST::ProcessedSource.
-      module ProcessedSource
-        # Redefine parser_class so that we can inject the prism parser into the
-        # list of known parsers.
-        def parser_class(ruby_version)
-          if ruby_version == Prism::Translation::Parser::VERSION_3_3
-            require "prism/translation/parser33"
-            Prism::Translation::Parser33
-          elsif ruby_version == Prism::Translation::Parser::VERSION_3_4
-            require "prism/translation/parser34"
-            Prism::Translation::Parser34
-          else
-            super
-          end
-        end
-      end
-    end
-  end
-end
-
-# :stopdoc:
-RuboCop::AST::ProcessedSource.prepend(Prism::Translation::Parser::ProcessedSource)
-known_rubies = RuboCop::TargetRuby.const_get(:KNOWN_RUBIES)
-RuboCop::TargetRuby.send(:remove_const, :KNOWN_RUBIES)
-RuboCop::TargetRuby::KNOWN_RUBIES = [*known_rubies, Prism::Translation::Parser::VERSION_3_3].freeze