rley 0.8.14 → 0.9.01

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: cf803f55dde48af888bfb7e0be524e66b8d2357aa85ae6292cf8c70d7a521273
-  data.tar.gz: f9cf09dffb9939c03b2c301c4669600d6d8f3bcefac20313fd54406456ed800a
+  metadata.gz: 7fc61215b7d8262c0ffa08c6149558e79915dcc3fbe58ba1bb4b8c57d8097423
+  data.tar.gz: a5e363a07f5daf5ef99799e6abe8b88dd322b6c68fbe752d3be77270329058c5
 SHA512:
-  metadata.gz: fa9e22773d7679b615d9119be340aac8ad91890dab9e1fe79c240883cb8059bed11dc48be011649ba068db7c62de23d25f3637acd2c3112b92f057e8319bae9e
-  data.tar.gz: 892e9fdb184f4ab33de790fe998504b8ab9fbacdcd19f1ce389ca39cdddc4c28634742cef281036a67a4e8cdb1b7d301df15a6846386f279eb971def3d083820
+  metadata.gz: '0605876019c02c17ba22d3e916bbdbfae96182da06384276939805569aaac83f11fb62ad3c22c7e837a59f3718e018ca3577cbf22566fcc38bfe044832c8a54b'
+  data.tar.gz: 6d56cf19e500a36e1abb5298bd7d46418d548bee380cd2ed1abab5b72a2e74c05a2a6e9dcf877dd6bf0f8af133192bf86d227a57ba912884f499fe31a9e0e37b

data/.rubocop.yml

@@ -438,6 +438,9 @@ Lint/TopLevelReturnWithArgument:
 Lint/UnreachableLoop:
   Enabled: true
 
+Naming/BlockForwarding:
+  EnforcedStyle: explicit
+
 Style/AccessorGrouping:
   Enabled: true
 
@@ -505,7 +508,22 @@ Style/StringConcatenation:
 #  Enabled: false
 #
 #RSpec/ExampleLength:
-#  Max: 50
+#  Max: 350
+#
+#RSpec/IndexedLet:
+#  Enabled: false
+#
+#RSpec/MultipleDescribes:
+#  Enabled: false
 #
 #RSpec/MultipleExpectations:
-#  Max: 15
+#  Max: 55
+#
+#RSpec/MultipleMemoizedHelpers:
+#  Max: 30
+#
+#RSpec/NoExpectationExample:
+#  Enabled: false
+#
+#RSpec/VerifiedDoubles:
+#  Enabled: false

data/CHANGELOG.md

@@ -1,3 +1,17 @@
+### 0.9.01 / 2025-03-16
+Version bumped.
+* [CHANGED] Updated `.rbs` signature files.
+
+### 0.9.00 / 2025-03-08
+Version bumped.
+* [NEW] Added `sig` folder with `.rbs` signature files.
+- [FIX] Broken Cucumber test. Replaced reference to `GrammarBuilder` by `BaseGrammarBuilder`.
+- [FIX] File `rley.gemspec` now returns a GemSpecification as expected by Bundler.
+- [CHANGE] File `Gemfile` refers to gemspec
+
+### 0.8.15 / 2025-02-28
+- [FIX] Re-styled spec files
+
 ### 0.8.14 / 2025-02-26
 - [FIX] Re-styled spec files of tutorial/iter4 folder
 

data/Gemfile

@@ -0,0 +1,8 @@
+# frozen_string_literal: true
+
+source 'https://rubygems.org'
+
+git_source(:github) { |repo_name| "https://github.com/#{repo_name}" }
+
+# Specify the gem's dependencies in rley.gemspec
+gemspec

data/examples/general/calc_iter1/spec/calculator_spec.rb

@@ -33,39 +33,39 @@ describe 'Calculator' do
     return result
   end
 
-  it 'should evaluate simple number literals' do
+  it 'evaluates simple number literals' do
     expect_expr('2').to eq(2)
   end
 
-  it 'should evaluate addition' do
+  it 'evaluates addition' do
     expect_expr('2 + 2').to eq(4)
   end
 
-  it 'should evaluate subtraction' do
+  it 'evaluates subtraction' do
     expect_expr('2.1 - 2').to be_within(0.000000000000001).of(0.1)
   end
 
-  it 'should evaluate division' do
+  it 'evaluates division' do
     expect_expr('10.5 / 5').to eq(2.1)
   end
 
-  it 'should evaluate multiplication' do
+  it 'evaluates multiplication' do
     expect_expr('2 * 3.1').to eq(6.2)
   end
 
-  it 'should evaluate parentheses' do
+  it 'evaluates parentheses' do
     expect_expr('2 * (2.1 + 1)').to eq(6.2)
   end
 
-  it 'should evaluate regardless of whitespace' do
+  it 'evaluates regardless of whitespace' do
     expect_expr("2*(1+\t1)").to eq(4)
   end
 
-  it 'should evaluate order of operations' do
+  it 'evaluates order of operations' do
     expect_expr('2 * 2.1 + 1 / 2').to eq 4.7
   end
 
-  it 'should evaluate multiple levels of parentheses' do
+  it 'evaluates multiple levels of parentheses' do
     expect_expr('2*(1/(1+3))').to eq(0.5)
   end
 end # describe

data/examples/general/calc_iter2/spec/calculator_spec.rb

@@ -41,152 +41,152 @@ describe 'Calculator' do
   context 'Parsing valid expressions' do
     let(:epsilon) { 0.0000000001 }
 
-    it 'should evaluate simple integer literals' do
+    it 'evaluates simple integer literals' do
       expect_expr('2').to eq(2)
     end
 
-    it 'should evaluate simple floating-point literals' do
+    it 'evaluates simple floating-point literals' do
       expect_expr('3.1').to eq(3.1)
     end
 
-    it 'should evaluate positive integer literals' do
+    it 'evaluates positive integer literals' do
       expect_expr('+2').to eq(2)
       expect_expr('+ 2').to eq(2)
     end
 
-    it 'should evaluate positive floating-point literals' do
+    it 'evaluates positive floating-point literals' do
       expect_expr('+3.1').to eq(3.1)
       expect_expr('+ 3.1').to eq(3.1)
     end
 
-    it 'should evaluate negative integer literals' do
+    it 'evaluates negative integer literals' do
       expect_expr('-2').to eq(-2)
       expect_expr('- 2').to eq(-2)
     end
 
-    it 'should evaluate negative floating-point literals' do
+    it 'evaluates negative floating-point literals' do
       expect_expr('-3.1').to eq(-3.1)
       expect_expr('- 3.1').to eq(-3.1)
     end
 
-    it 'should evaluate the pi constant' do
+    it 'evaluates the pi constant' do
       expect_expr('PI').to eq(3.141592653589793)
     end
 
-    it 'should evaluate the negated pi constant' do
+    it 'evaluates the negated pi constant' do
       expect_expr('-PI').to eq(-3.141592653589793)
     end
 
-    it "should evaluate Neper's e constant" do
+    it "evaluates Neper's e constant" do
       expect_expr('E').to eq(2.718281828459045)
     end
 
-    it "should evaluate negated Neper's e constant" do
+    it "evaluates negated Neper's e constant" do
       expect_expr('-E').to eq(-2.718281828459045)
     end
 
-    it 'should evaluate integer addition' do
+    it 'evaluates integer addition' do
       expect_expr('2 + 2').to eq(4)
     end
 
-    it 'should evaluate floating-point addition' do
+    it 'evaluates floating-point addition' do
       expect_expr('2.0 + 3.1').to eq(5.1)
     end
 
-    it 'should evaluate integer subtraction' do
+    it 'evaluates integer subtraction' do
       expect_expr('2 - 3').to eq(-1)
     end
 
-    it 'should evaluate floating-point subtraction' do
+    it 'evaluates floating-point subtraction' do
       expect_expr('3.1 - 2').to eq(1.1)
     end
 
-    it 'should handle negation of negative numbers' do
+    it 'handles negation of negative numbers' do
        expect_expr('3--2').to eq(5)
     end
 
-    it 'should evaluate integer multiplication' do
+    it 'evaluates integer multiplication' do
       expect_expr('2 * 3').to eq(6)
     end
 
-    it 'should evaluate floating-point multiplication' do
+    it 'evaluates floating-point multiplication' do
       expect_expr('2 * 3.1').to eq(6.2)
     end
 
-    it 'should evaluate division of integers' do
+    it 'evaluates division of integers' do
       expect_expr('5 / 2').to eq(2.5)
     end
 
-    it 'should evaluate floating-point division' do
+    it 'evaluates floating-point division' do
       expect_expr('10.5 / 5').to eq(2.1)
     end
 
-    it 'should evaluate integer exponent' do
+    it 'evaluates integer exponent' do
       expect_expr('5 ** (3 - 1)').to eq(25)
     end
 
-    it 'should evaluate floating-point exponent' do
+    it 'evaluates floating-point exponent' do
       expect_expr('25 ** 0.5').to eq(5)
     end
 
-    it 'should evaluate negative exponent' do
+    it 'evaluates negative exponent' do
       expect_expr('5 ** -2').to eq(0.04)
     end
 
-    it 'should handle nested exponentiations' do
+    it 'handles nested exponentiations' do
       expect_expr('2 ** 2**2').to eq(16)
     end
 
-    it 'should change sign of expression in parentheses' do
+    it 'changes sign of expression in parentheses' do
       expect_expr('- (2 * 5)').to eq(-10)
     end
 
-    it 'should evaluate parentheses' do
+    it 'evaluates parentheses' do
       expect_expr('2 * (2.1 + 1)').to eq(6.2)
     end
 
-    it 'should evaluate regardless of whitespace' do
+    it 'evaluates regardless of whitespace' do
       expect_expr("2*(1+\t1)").to eq(4)
     end
 
-    it 'should evaluate order of operations' do
+    it 'evaluates order of operations' do
       expect_expr('2 * 2.1 + 1 / 2').to eq 4.7
     end
 
-    it 'should evaluate multiple levels of parentheses' do
+    it 'evaluates multiple levels of parentheses' do
       expect_expr('2*(1/(1+3))').to eq(0.5)
     end
 
     # Some special functions
-    it 'should evaluate square root of expressions' do
+    it 'evaluates square root of expressions' do
       expect_expr('sqrt(0)').to eq(0)
       expect_expr('sqrt(1)').to eq(1)
       expect_expr('sqrt(1 + 1)').to eq(Math.sqrt(2))
       expect_expr('sqrt(5 * 5)').to eq(5)
     end
 
-    it 'should evaluate cubic root of expressions' do
+    it 'evaluates cubic root of expressions' do
       expect_expr('cbrt(0)').to eq(0)
       expect_expr('cbrt(1)').to eq(1)
       expect_expr('cbrt(1 + 1)').to eq(Math.cbrt(2))
       expect_expr('cbrt(5 * 5 * 5)').to eq(5)
     end
 
-    it 'should evaluate exponential of expressions' do
+    it 'evaluates exponential of expressions' do
       expect_expr('exp(-1)').to eq(1 / Math::E)
       expect_expr('exp(0)').to eq(1)
       expect_expr('exp(1)').to eq(Math::E)
       expect_expr('exp(2)').to be_within(epsilon).of(Math::E * Math::E)
     end
 
-    it 'should evaluate natural logarithm of expressions' do
+    it 'evaluates natural logarithm of expressions' do
       expect_expr('ln(1/E)').to eq(-1)
       expect_expr('ln(1)').to eq(0)
       expect_expr('ln(E)').to eq(1)
       expect_expr('ln(E * E)').to eq(2)
     end
 
-    it 'should evaluate the logarithm base 10 of expressions' do
+    it 'evaluates the logarithm base 10 of expressions' do
       expect_expr('log(1/10)').to eq(-1)
       expect_expr('log(1)').to eq(0)
       expect_expr('log(10)').to eq(1)
@@ -195,19 +195,19 @@ describe 'Calculator' do
 
     # Trigonometric functions
 
-    it 'should compute the sinus of an expression' do
+    it 'computes the sinus of an expression' do
       expect_expr('sin(0)').to eq(0)
       expect_expr('sin(PI/6)').to be_within(epsilon).of(0.5)
       expect_expr('sin(PI/2)').to eq(1)
     end
 
-    it 'should compute the cosinus of an expression' do
+    it 'computes the cosinus of an expression' do
       expect_expr('cos(0)').to eq(1)
       expect_expr('cos(PI/3)').to be_within(epsilon).of(0.5)
       expect_expr('cos(PI/2)').to be_within(epsilon).of(0)
     end
 
-    it 'should compute the tangent of an expression' do
+    it 'computes the tangent of an expression' do
       expect_expr('tan(0)').to eq(0)
       expect_expr('tan(PI/4)').to be_within(epsilon).of(1)
       expect_expr('tan(5*PI/12)').to be_within(epsilon).of(2 + Math.sqrt(3))
@@ -215,19 +215,19 @@ describe 'Calculator' do
 
     # Inverse trigonometric functions
 
-    it 'should compute the arcsinus of an expression' do
+    it 'computes the arcsinus of an expression' do
       expect_expr('asin(0)').to eq(0)
       expect_expr('asin(0.5)').to be_within(epsilon).of(Math::PI / 6)
       expect_expr('asin(1)').to eq(Math::PI / 2)
     end
 
-    it 'should compute the arccosinus of an expression' do
+    it 'computes the arccosinus of an expression' do
       expect_expr('acos(1)').to eq(0)
       expect_expr('acos(0.5)').to be_within(epsilon).of(Math::PI / 3)
       expect_expr('acos(0)').to be_within(epsilon).of(Math::PI / 2)
     end
 
-    it 'should compute the tangent of an expression' do
+    it 'computes the arctangent of an expression' do
       expect_expr('atan(0)').to eq(0)
       pi = Math::PI
       expect_expr('atan(1)').to be_within(epsilon).of(pi / 4)

data/examples/general/recursive_right.rb

@@ -143,7 +143,7 @@ find every scan edge
 def build_gfg(aGrammar)
   items_builder = Object.new.extend(Rley::Base::GrmItemsBuilder)
   items = items_builder.build_dotted_items(aGrammar)
-  gfg = Rley::GFG::GrmFlowGraph.new(items)
+  Rley::GFG::GrmFlowGraph.new(items)
 end
 
 graph = build_gfg(right_recursive_grammar)
@@ -326,7 +326,7 @@ module GraphMixin
 
   # visit_action takes two arguments: a vertex and an edge
   # return true/false if false stop traversal
-  def df_traversal(aVertex, &visit_action)
+  def df_traversal(aVertex, &_visit_action)
     visit = [aVertex]
     vtx2count = { aVertex => 0 }
 

data/lib/rley/constants.rb

@@ -5,10 +5,10 @@
 
 module Rley # Module used as a namespace
   # The version number of the gem.
-  Version = '0.8.14'
+  Version = '0.9.01'
 
   # Brief description of the gem.
-  Description = "Ruby implementation of the Earley's parsing algorithm"
+  Description = "A parsing library based on the Earley's parsing algorithm."
 
   # Constant Rley::RootDir contains the absolute path of Rley's
   # start directory. Note: it also ends with a slash character.

data/lib/rley/engine.rb

@@ -19,6 +19,7 @@ module Rley # This module is used as a namespace
       # Constructor with default initialization.
       def initialize
         super()
+        # @type self: EngineConfig
         self.parse_repr = :parse_tree
         self.repr_builder = :default
         self.diagnose = false
@@ -80,7 +81,7 @@ module Rley # This module is used as a namespace
       aTokenizer.each do |a_token|
         next unless a_token
 
-        if a_token.terminal.kind_of?(String)
+        if a_token.terminal.is_a?(String)
           term_name = a_token.terminal
           term_symb = grammar.name2symbol[term_name]
           a_token.instance_variable_set(:@terminal, term_symb)
@@ -133,6 +134,7 @@ module Rley # This module is used as a namespace
         result = factory.create(configuration.repr_builder)
       end
 
+      # @type var result : Rley::SPPF::ParseForest
       result
     end
 

data/lib/rley/formatter/asciitree.rb

@@ -82,9 +82,10 @@ module Rley # This module is used as a namespace
       def rank_of(aChild)
         if curr_path.empty?
           rank = 'root'
-        elsif curr_path[-1].subnodes.size == 1
+        elsif curr_path[-1].subnodes.size == 1 # steep:ignore
           rank = 'first_and_last'
         else
+          # @type var parent : Rley::PTree::NonTerminalNode
           parent = curr_path[-1]
           siblings = parent.subnodes
           siblings_last_index = siblings.size - 1
@@ -96,6 +97,8 @@ module Rley # This module is used as a namespace
                  end
         end
         ranks << rank
+
+        rank
       end
 
       # 'root', 'first', 'first_and_last', 'last', 'other'

data/lib/rley/gfg/epsilon_edge.rb

@@ -9,8 +9,6 @@ module Rley # This module is used as a namespace
     # Responsibilities:
     # - To know the successor vertex
     class EpsilonEdge < Edge
-      # The destination vertex of the edge.
-      attr_reader :successor
     end # class
   end # module
 end # module

data/lib/rley/gfg/grm_flow_graph.rb

@@ -1,6 +1,5 @@
 # frozen_string_literal: true
 
-require 'set'
 require_relative 'start_vertex'
 require_relative 'end_vertex'
 require_relative 'item_vertex'
@@ -41,7 +40,7 @@ module Rley # This module is used as a namespace
       attr_reader :vertices
 
       # The vertex marked as start node of the graph
-      # @return [StartVertex>]
+      # @return [StartVertex]
       attr_reader :start_vertex
 
       # A Hash with pairs of the form: non-terminal symbol => start node
@@ -189,7 +188,7 @@ module Rley # This module is used as a namespace
       # For debugging purposes
       def print_vertex(aText, aVertex)
         print "#{aText} "
-        if aVertex.kind_of?(NonTerminalVertex)
+        if aVertex.is_a?(NonTerminalVertex)
           puts "#{aVertex.class} #{aVertex.non_terminal.name}"
         else
           p(aVertex.label)
@@ -223,7 +222,7 @@ module Rley # This module is used as a namespace
         productions.each do |prod|
           all_nterms << prod.lhs
           nterms_of_rhs = prod.rhs.members.select do |symb|
-            symb.kind_of?(Syntax::NonTerminal)
+            symb.is_a?(Syntax::NonTerminal)
           end
           all_nterms.merge(nterms_of_rhs)
         end
@@ -286,7 +285,7 @@ module Rley # This module is used as a namespace
             # At least one symbol before the dot
             # Retrieve the symbol before the dot...
             prev_symbol = current_item.prev_symbol
-            if prev_symbol.kind_of?(Syntax::Terminal)
+            if prev_symbol.is_a?(Syntax::Terminal)
               build_scan_edge(vertices[-2], new_vertex)
             else
               # ...non-terminal
@@ -295,7 +294,7 @@ module Rley # This module is used as a namespace
           end
 
           prev_symbol = current_item.prev_symbol
-          if prev_symbol&.kind_of?(Syntax::NonTerminal)
+          if prev_symbol&.is_a?(Syntax::NonTerminal)
             build_shortcut_edge(prev_vertex, new_vertex)
           end
           prev_vertex = new_vertex
@@ -356,8 +355,7 @@ module Rley # This module is used as a namespace
         end_vertex = end_vertex_for[aCallEdge.successor.non_terminal]
 
         # Retrieve the return edge with specified key
-        return_edge = end_vertex.edges.find { |edge| edge.key == ret_key }
-        return return_edge
+        end_vertex.edges.find { |edge| edge.key == ret_key }
       end
 
       # Mark non-terminal symbols that cannot be derived from the start symbol.
@@ -373,7 +371,7 @@ module Rley # This module is used as a namespace
         # and mark all visited non-terminals as reachable
         traverse_df(start_vertex) do |a_vertex|
           # print_vertex('  Visiting', a_vertex)
-          if a_vertex.kind_of?(StartVertex)
+          if a_vertex.is_a?(StartVertex)
             a_vertex.non_terminal.unreachable = false
           end
         end

data/lib/rley/gfg/item_vertex.rb

@@ -30,7 +30,7 @@ module Rley # This module is used as a namespace
       # Set the "shortcut" edge.
       # @param aShortcut [ShortcutEdge] the "shortcut" edge.
       def shortcut=(aShortcut)
-        unless aShortcut.kind_of?(ShortcutEdge)
+        unless aShortcut.is_a?(ShortcutEdge)
           raise StandardError, 'Invalid shortcut argument'
         end
 

data/lib/rley/gfg/vertex.rb

@@ -69,6 +69,17 @@ module Rley # This module is used as a namespace
         edges << arrow
       end
 
+      # The label of this vertex.
+      # It is the same as the label of the corresponding dotted item.
+      # @return [String] Label for this vertex
+      def label
+        raise NotImplementedError
+      end
+
+      def dotted_item
+        raise NotImplementedError
+      end
+
       protected
 
       # Validation method for adding an outgoing edge to the vertex.

data/lib/rley/lexical/token.rb

@@ -5,13 +5,20 @@ module Rley # This module is used as a namespace
   # as return values from a tokenizer / lexer.
   module Lexical
     # A Position is the location of a lexeme within a source file.
-    Position = Struct.new(:line, :column) do
+    class Position
+      attr_reader :line
+      attr_reader :column
+
+      def initialize(aLine, aCol)
+        @line = aLine
+        @column = aCol
+      end
+
       def to_s
         "line #{line}, column #{column}"
       end
     end
 
-
     # In Rley, a (lexical) token is an object created by a lexer (tokenizer)
     # and passed to the parser. Such token an object is created when a lexer
     # detects that a sequence of characters(a lexeme) from the input stream
@@ -27,7 +34,7 @@ module Rley # This module is used as a namespace
       # @return [String] Input substring that is an instance of the terminal.
       attr_reader(:lexeme)
 
-      # @return [String] The name of terminal symbol matching the lexeme.
+      # @return [Syntax::Terminal] The name of terminal symbol matching the lexeme.
       attr_reader(:terminal)
 
       # @return [Position] The position -in "editor" coordinates- of the lexeme in the source file.

data/lib/rley/parse_forest_visitor.rb

@@ -1,6 +1,5 @@
 # frozen_string_literal: true
 
-# require 'pry'
 require 'prime'
 
 module Rley # This module is used as a namespace
@@ -145,9 +144,10 @@ module Rley # This module is used as a namespace
       # Let's proceed with the visit of children
       children.each_with_index do |a_node, i|
         edge_sign = aParentNode.signatures[i]
-        if a_node.kind_of?(SPPF::CompositeNode)
+        if a_node.is_a?(SPPF::CompositeNode)
           push_node(a_node, edge_sign)
           access_paths = node_accesses[a_node]
+          # @type var last_path : Integer
           last_path = legs.last[-1]
           path_reused = access_paths.include?(last_path)
           unless path_reused
@@ -178,8 +178,8 @@ module Rley # This module is used as a namespace
       if legs.empty?
         legs << [aCompositeNode, anEdgeSignature]
       else
+        # @type var path_signature : Integer
         path_signature = legs.last[-1]
-        # binding.pry if anEdgeSignature == 37 && path_signature != 230
         if (path_signature % anEdgeSignature).zero?
           legs << [aCompositeNode, path_signature]
         else

data/lib/rley/parse_rep/ast_base_builder.rb

@@ -94,9 +94,10 @@ module Rley # This module is used as a namespace
         klass = terminal2node.fetch(aTerminal.name, terminalnode_class)
         if klass.is_a?(Hash)
           # Lexical ambiguity...
-          klass = klass.fetch(aProduction.name)
+          klass = klass.fetch(aProduction.name) # steep:ignore ArgumentTypeMismatch
         end
-        klass.new(aToken, aTokenPosition)
+
+        klass.new(aToken, aTokenPosition) # steep:ignore
       end
 
       # Method to override.
@@ -106,7 +107,7 @@ module Rley # This module is used as a namespace
       # @param theTokens [Array] The input tokens
       # @param theChildren [Array] Children nodes (one per rhs symbol)
       def new_parent_node(aProduction, aRange, theTokens, theChildren)
-        mth_name = method_name(aProduction.name)
+        mth_name = method_name(aProduction.name) # steep:ignore ArgumentTypeMismatch
         if respond_to?(mth_name, true)
           node = send(mth_name, aProduction, aRange, theTokens, theChildren)
         else
@@ -139,7 +140,7 @@ module Rley # This module is used as a namespace
       # Implicit rule generated for * modifier
       # rule('X') => 'X item'.as '_star_more'
       def reduce__star_more(_production, _range, _tokens, theChildren)
-        theChildren[0] << theChildren[1]
+        theChildren[0] << theChildren[1] # steep:ignore NoMethod
         theChildren[0]
       end
 
@@ -152,7 +153,7 @@ module Rley # This module is used as a namespace
       # Implicit rule generated for + modifier
       # rule('X') => 'X item'.as '_plus_more'
       def reduce__plus_more(_production, _range, _tokens, theChildren)
-        theChildren[0] << theChildren[1]
+        theChildren[0] << theChildren[1] # steep:ignore NoMethod
         theChildren[0]
       end