parsanol 1.3.5-aarch64-linux → 1.3.7-aarch64-linux

data/lib/parsanol/atoms/sequence.rb

@@ -63,7 +63,8 @@ module Parsanol
         when 2
           match_pair(components[0], components[1], source, context, consume_all)
         when 3
-          match_triple(components[0], components[1], components[2], source, context, consume_all)
+          match_triple(components[0], components[1], components[2], source,
+                       context, consume_all)
         else
           match_general(components, source, context, consume_all)
         end
@@ -76,7 +77,7 @@ module Parsanol
       # @param prec [Integer] precedence
       # @return [String]
       def to_s_inner(prec)
-        @parslets.map { |p| p.to_s(prec) }.join(' ')
+        @parslets.map { |p| p.to_s(prec) }.join(" ")
       end
 
       # FIRST set is first element's FIRST set (with epsilon propagation).

data/lib/parsanol/atoms/str.rb

@@ -21,7 +21,7 @@ module Parsanol
         @char_count = @str.length
 
         # Pre-built error messages (frozen)
-        @early_eof_msg = 'Unexpected end of input'
+        @early_eof_msg = "Unexpected end of input"
         @mismatch_msg = "Expected #{@str.inspect}, but got "
 
         # Optimization: single-char fast path
@@ -75,7 +75,10 @@ module Parsanol
 
       # Fast path for single-character strings.
       def single_char_match(source, context)
-        return context.err(self, source, @early_eof_msg) if source.chars_left < 1
+        if source.chars_left < 1
+          return context.err(self, source,
+                             @early_eof_msg)
+        end
 
         pos = source.pos
         slice = source.consume(1)
@@ -88,7 +91,10 @@ module Parsanol
 
       # Standard path for multi-character strings.
       def multi_char_match(source, context)
-        return context.err(self, source, @early_eof_msg) if source.chars_left < @char_count
+        if source.chars_left < @char_count
+          return context.err(self, source,
+                             @early_eof_msg)
+        end
 
         pos = source.pos
         slice = source.consume(@char_count)

data/lib/parsanol/atoms.rb

@@ -21,26 +21,26 @@ module Parsanol
     end
 
     # Load atom implementations
-    require 'parsanol/atoms/can_flatten'
-    require 'parsanol/atoms/context'
-    require 'parsanol/atoms/dsl'
-    require 'parsanol/atoms/base'
-    require 'parsanol/atoms/custom'
-    require 'parsanol/atoms/ignored'
-    require 'parsanol/atoms/named'
-    require 'parsanol/atoms/lookahead'
-    require 'parsanol/atoms/cut'
-    require 'parsanol/atoms/alternative'
-    require 'parsanol/atoms/sequence'
-    require 'parsanol/atoms/repetition'
-    require 'parsanol/atoms/re'
-    require 'parsanol/atoms/str'
-    require 'parsanol/atoms/entity'
-    require 'parsanol/atoms/capture'
-    require 'parsanol/atoms/dynamic'
-    require 'parsanol/atoms/scope'
-    require 'parsanol/atoms/infix'
+    require "parsanol/atoms/can_flatten"
+    require "parsanol/atoms/context"
+    require "parsanol/atoms/dsl"
+    require "parsanol/atoms/base"
+    require "parsanol/atoms/custom"
+    require "parsanol/atoms/ignored"
+    require "parsanol/atoms/named"
+    require "parsanol/atoms/lookahead"
+    require "parsanol/atoms/cut"
+    require "parsanol/atoms/alternative"
+    require "parsanol/atoms/sequence"
+    require "parsanol/atoms/repetition"
+    require "parsanol/atoms/re"
+    require "parsanol/atoms/str"
+    require "parsanol/atoms/entity"
+    require "parsanol/atoms/capture"
+    require "parsanol/atoms/dynamic"
+    require "parsanol/atoms/scope"
+    require "parsanol/atoms/infix"
     # Load visitor pattern (must be after all atom classes)
-    require 'parsanol/atoms/visitor'
+    require "parsanol/atoms/visitor"
   end
 end

data/lib/parsanol/builder_callbacks.rb

@@ -204,7 +204,7 @@ module Parsanol
       end
 
       def on_success
-        @events << 'success'
+        @events << "success"
       end
 
       def on_error(message)
@@ -228,7 +228,7 @@ module Parsanol
       end
 
       def on_nil
-        @events << 'nil'
+        @events << "nil"
       end
 
       def on_hash_start(size = nil)

data/lib/parsanol/cause.rb

@@ -113,10 +113,10 @@ module Parsanol
       return if prefix_flags.size < 2
 
       prefix_flags[1..-2].each do |is_last|
-        stream.print is_last ? '   ' : '|  '
+        stream.print is_last ? "   " : "|  "
       end
 
-      stream.print prefix_flags.last ? '`- ' : '|- '
+      stream.print prefix_flags.last ? "`- " : "|- "
     end
   end
 end

data/lib/parsanol/context.rb

@@ -32,8 +32,8 @@ module Parsanol
     #
     # @param name [Symbol, String] method name
     # @yield block to execute when method is called
-    def define_singleton_method(name, &body)
-      singleton_class.define_method(name, &body)
+    def define_singleton_method(name, &)
+      singleton_class.define_method(name, &)
     end
   end
 end

data/lib/parsanol/error_reporter.rb

@@ -50,7 +50,7 @@ module Parsanol
       #
       def err(atom, source, message, children = nil)
         raise NotImplementedError,
-              'Error reporters must implement #err(atom, source, message, children)'
+              "Error reporters must implement #err(atom, source, message, children)"
       end
 
       # Report an error at a specific position.
@@ -66,7 +66,7 @@ module Parsanol
       #
       def err_at(atom, source, message, pos, children = nil)
         raise NotImplementedError,
-              'Error reporters must implement #err_at(atom, source, message, pos, children)'
+              "Error reporters must implement #err_at(atom, source, message, pos, children)"
       end
 
       # Called when an expression successfully parses.
@@ -95,6 +95,6 @@ module Parsanol
   end
 end
 
-require 'parsanol/error_reporter/tree'
-require 'parsanol/error_reporter/deepest'
-require 'parsanol/error_reporter/contextual'
+require "parsanol/error_reporter/tree"
+require "parsanol/error_reporter/deepest"
+require "parsanol/error_reporter/contextual"

data/lib/parsanol/expression/treetop.rb

@@ -44,7 +44,7 @@ module Parsanol
 
         # Alternative: 'a' / 'b'
         rule(:alternatives) do
-          (simple >> (spaced('/') >> simple).repeat).as(:alt)
+          (simple >> (spaced("/") >> simple).repeat).as(:alt)
         end
 
         # Sequence by concatenation: 'a' 'b'
@@ -52,15 +52,15 @@ module Parsanol
 
         # Occurrence modifiers: ?, *, +, {min,max}
         rule(:occurrence) do
-          (atom.as(:repetition) >> spaced('*').as(:sign)) |
-            (atom.as(:repetition) >> spaced('+').as(:sign)) |
+          (atom.as(:repetition) >> spaced("*").as(:sign)) |
+            (atom.as(:repetition) >> spaced("+").as(:sign)) |
             (atom.as(:repetition) >> repetition_spec) |
-            (atom.as(:maybe) >> spaced('?')) |
+            (atom.as(:maybe) >> spaced("?")) |
             atom
         end
 
         rule(:atom) do
-          (spaced('(') >> expression.as(:unwrap) >> spaced(')')) |
+          (spaced("(") >> expression.as(:unwrap) >> spaced(")")) |
             dot |
             string |
             char_class
@@ -68,30 +68,30 @@ module Parsanol
 
         # Character class: [a-z], [0-9], etc.
         rule(:char_class) do
-          (str('[') >>
-            ((str('\\') >> any) | (str(']').absent? >> any)).repeat(1) >>
-            str(']')).as(:match) >> space?
+          (str("[") >>
+            ((str("\\") >> any) | (str("]").absent? >> any)).repeat(1) >>
+            str("]")).as(:match) >> space?
         end
 
         # Any character: .
-        rule(:dot) { spaced('.').as(:any) }
+        rule(:dot) { spaced(".").as(:any) }
 
         # String literal: 'hello'
         rule(:string) do
           str("'") >>
-            ((str('\\') >> any) | (str("'").absent? >> any)).repeat.as(:string) >>
+            ((str("\\") >> any) | (str("'").absent? >> any)).repeat.as(:string) >>
             str("'") >> space?
         end
 
         # Repetition specification: {1,3}, {2,}, {,5}
         rule(:repetition_spec) do
-          spaced('{') >>
-            integer.maybe.as(:min) >> spaced(',') >>
-            integer.maybe.as(:max) >> spaced('}')
+          spaced("{") >>
+            integer.maybe.as(:min) >> spaced(",") >>
+            integer.maybe.as(:max) >> spaced("}")
         end
 
         rule(:integer) do
-          match['0-9'].repeat(1)
+          match["0-9"].repeat(1)
         end
 
         # Whitespace handling
@@ -115,7 +115,7 @@ module Parsanol
       class Transform < Parsanol::Transform
         # Repetition with sign: * (zero+) or + (one+)
         rule(repetition: simple(:rep), sign: simple(:sign)) do
-          min = sign == '+' ? 1 : 0
+          min = sign == "+" ? 1 : 0
           Parsanol::Atoms::Repetition.new(rep, min, nil)
         end
 
@@ -124,7 +124,7 @@ module Parsanol
           Parsanol::Atoms::Repetition.new(
             rep,
             Integer(min || 0),
-            (max && Integer(max)) || nil
+            (max && Integer(max)) || nil,
           )
         end
 
@@ -147,7 +147,7 @@ module Parsanol
         rule(match: simple(:m)) { Parsanol::Atoms::Re.new("[#{m}]") }
 
         # Any character: .
-        rule(any: simple(:_a)) { Parsanol::Atoms::Re.new('.') }
+        rule(any: simple(:_a)) { Parsanol::Atoms::Re.new(".") }
       end
     end
   end

data/lib/parsanol/expression.rb

@@ -56,7 +56,7 @@ module Parsanol
   class Expression
     include Parsanol
 
-    autoload :Treetop, 'parsanol/expression/treetop'
+    autoload :Treetop, "parsanol/expression/treetop"
 
     # Creates a parser atom from a treetop-style expression string.
     #

data/lib/parsanol/fast_mode.rb

@@ -25,7 +25,10 @@ module Parsanol
         unless (entry = @cache[beg]&.[](obj.object_id))
           result = obj.try(source, self, consume_all)
 
-          (@cache[beg] ||= {})[obj.object_id] = [result, source.bytepos - beg] if obj.cached?
+          if obj.cached?
+            (@cache[beg] ||= {})[obj.object_id] =
+              [result, source.bytepos - beg]
+          end
 
           return result
         end
@@ -45,13 +48,24 @@ module Parsanol
         case parslets.size
         when 1
           success, value = parslets[0].apply(source, context, consume_all)
-          success ? succ([:sequence, value]) : context.err(self, source, @error_msg, [value])
+          if success
+            succ([:sequence,
+                  value])
+          else
+            context.err(self, source, @error_msg,
+                        [value])
+          end
         when 2
           success, v1 = parslets[0].apply(source, context, false)
           return context.err(self, source, @error_msg, [v1]) unless success
 
           success, v2 = parslets[1].apply(source, context, consume_all)
-          success ? succ([:sequence, v1, v2]) : context.err(self, source, @error_msg, [v2])
+          if success
+            succ([:sequence, v1,
+                  v2])
+          else
+            context.err(self, source, @error_msg, [v2])
+          end
         when 3
           success, v1 = parslets[0].apply(source, context, false)
           return context.err(self, source, @error_msg, [v1]) unless success
@@ -60,13 +74,19 @@ module Parsanol
           return context.err(self, source, @error_msg, [v2]) unless success
 
           success, v3 = parslets[2].apply(source, context, consume_all)
-          success ? succ([:sequence, v1, v2, v3]) : context.err(self, source, @error_msg, [v3])
+          if success
+            succ([:sequence, v1, v2,
+                  v3])
+          else
+            context.err(self, source, @error_msg, [v3])
+          end
         else
           result = [:sequence]
           last_idx = parslets.size - 1
           i = 0
           while i <= last_idx
-            success, value = parslets[i].apply(source, context, consume_all && i == last_idx)
+            success, value = parslets[i].apply(source, context,
+                                               consume_all && i == last_idx)
             return context.err(self, source, @error_msg, [value]) unless success
 
             result << value
@@ -100,22 +120,37 @@ module Parsanol
           case max
           when 1
             success, value = parslet.apply(source, context, consume_all)
-            return success ? succ([tag, value]) : context.err_at(self, source, @error_msg, source.bytepos, [value])
+            return success ? succ([tag,
+                                   value]) : context.err_at(self, source,
+                                                            @error_msg, source.bytepos, [value])
           when 2
             success, v1 = parslet.apply(source, context, false)
-            return context.err_at(self, source, @error_msg, source.bytepos, [v1]) unless success
+            unless success
+              return context.err_at(self, source, @error_msg, source.bytepos,
+                                    [v1])
+            end
 
             success, v2 = parslet.apply(source, context, consume_all)
-            return success ? succ([tag, v1, v2]) : context.err_at(self, source, @error_msg, source.bytepos, [v2])
+            return success ? succ([tag, v1,
+                                   v2]) : context.err_at(self, source,
+                                                         @error_msg, source.bytepos, [v2])
           when 3
             success, v1 = parslet.apply(source, context, false)
-            return context.err_at(self, source, @error_msg, source.bytepos, [v1]) unless success
+            unless success
+              return context.err_at(self, source, @error_msg, source.bytepos,
+                                    [v1])
+            end
 
             success, v2 = parslet.apply(source, context, false)
-            return context.err_at(self, source, @error_msg, source.bytepos, [v2]) unless success
+            unless success
+              return context.err_at(self, source, @error_msg, source.bytepos,
+                                    [v2])
+            end
 
             success, v3 = parslet.apply(source, context, consume_all)
-            return success ? succ([tag, v1, v2, v3]) : context.err_at(self, source, @error_msg, source.bytepos, [v3])
+            return success ? succ([tag, v1, v2,
+                                   v3]) : context.err_at(self, source,
+                                                         @error_msg, source.bytepos, [v3])
           end
         end
 
@@ -140,7 +175,10 @@ module Parsanol
           return context.err_at(self, source, @error_msg, start_pos, [break_on])
         end
 
-        return context.err(self, source, @unconsumed_msg, [break_on]) if consume_all && source.chars_left.positive?
+        if consume_all && source.chars_left.positive?
+          return context.err(self, source, @unconsumed_msg,
+                             [break_on])
+        end
 
         succ(result)
       end

data/lib/parsanol/first_set.rb

@@ -58,7 +58,7 @@ module Parsanol
         return true if real_set1.empty? || real_set2.empty?
 
         # Check if intersection is empty (using to_a for Opal compatibility)
-        (real_set1.to_a & real_set2.to_a).empty?
+        !real_set1.to_a.intersect?(real_set2.to_a)
       end
 
       # Check if all FIRST sets in a collection are mutually disjoint

data/lib/parsanol/grammar_builder.rb

@@ -72,7 +72,8 @@ module Parsanol
                      when Hash
                        grammar
                      else
-                       raise ArgumentError, "Expected GrammarBuilder or Hash, got #{grammar.class}"
+                       raise ArgumentError,
+                             "Expected GrammarBuilder or Hash, got #{grammar.class}"
                      end
 
       @imports << { grammar: grammar_data, prefix: prefix }
@@ -92,7 +93,8 @@ module Parsanol
                      when Hash
                        grammar
                      else
-                       raise ArgumentError, "Expected GrammarBuilder or Hash, got #{grammar.class}"
+                       raise ArgumentError,
+                             "Expected GrammarBuilder or Hash, got #{grammar.class}"
                      end
 
       @imports << { grammar: grammar_data, prefix: prefix, rules: rules }
@@ -106,7 +108,7 @@ module Parsanol
       {
         rules: @rules,
         root: @root,
-        imports: @imports
+        imports: @imports,
       }
     end
 
@@ -140,7 +142,7 @@ module Parsanol
       if grammar_name
         ref("#{grammar_name}:root")
       else
-        ref('root')
+        ref("root")
       end
     end
 
@@ -149,9 +151,9 @@ module Parsanol
       #
       # @yield [GrammarBuilder] Builder to configure
       # @return [Hash] Built grammar
-      def build(&block)
+      def build(&)
         builder = new
-        builder.instance_eval(&block)
+        builder.instance_eval(&)
         builder.build
       end
 
@@ -170,8 +172,8 @@ module Parsanol
     # Create a new grammar builder
     #
     # @return [GrammarBuilder] New builder
-    def grammar(&block)
-      GrammarBuilder.build(&block)
+    def grammar(&)
+      GrammarBuilder.build(&)
     end
   end
 end

data/lib/parsanol/incremental_parser.rb

@@ -19,7 +19,7 @@ module Parsanol
   class Edit
     attr_reader :start, :deleted, :inserted
 
-    def initialize(start:, deleted:, inserted: '')
+    def initialize(start:, deleted:, inserted: "")
       @start = start
       @deleted = deleted
       @inserted = inserted
@@ -61,13 +61,14 @@ module Parsanol
     #
     # @param grammar [Parsanol::Parser, Parsanol::Atoms::Base] Grammar to use
     # @param initial_input [String] Initial input string
-    def initialize(grammar, initial_input = '')
+    def initialize(grammar, initial_input = "")
       @grammar = grammar
       @input = initial_input
 
       if Parsanol::Native.available?
         grammar_json = Parsanol::Native.serialize_grammar(grammar.root)
-        @native_parser = Parsanol::Native.incremental_parser_new(grammar_json, initial_input)
+        @native_parser = Parsanol::Native.incremental_parser_new(grammar_json,
+                                                                 initial_input)
       else
         @native_parser = nil
       end
@@ -81,7 +82,7 @@ module Parsanol
     # @param start [Integer] Start position of edit
     # @param deleted [Integer] Number of characters deleted
     # @param inserted [String] Text to insert
-    def apply_edit(start:, deleted:, inserted: '')
+    def apply_edit(start:, deleted:, inserted: "")
       edit = Edit.new(start: start, deleted: deleted, inserted: inserted)
       @edits << edit
 
@@ -93,7 +94,8 @@ module Parsanol
 
       return unless @native_parser
 
-      Parsanol::Native.incremental_parser_apply_edit(@native_parser, start, deleted, inserted)
+      Parsanol::Native.incremental_parser_apply_edit(@native_parser, start,
+                                                     deleted, inserted)
     end
 
     # Convenience method to apply multiple edits
@@ -119,7 +121,9 @@ module Parsanol
       return @cached_result if @cached_result
 
       if @native_parser
-        @cached_result = Parsanol::Native.incremental_parser_reparse(@native_parser, @input)
+        @cached_result = Parsanol::Native.incremental_parser_reparse(
+          @native_parser, @input
+        )
       else
         # Pure Ruby fallback - reparse from scratch
         root = @grammar.root
@@ -164,14 +168,15 @@ module Parsanol
     #
     # @param new_input [String, nil] Optional new initial input
     def reset(new_input = nil)
-      @input = new_input || ''
+      @input = new_input || ""
       @edits.clear
       @cached_result = nil
 
       return unless @native_parser && new_input
 
       grammar_json = Parsanol::Native.serialize_grammar(@grammar.root)
-      @native_parser = Parsanol::Native.incremental_parser_new(grammar_json, @input)
+      @native_parser = Parsanol::Native.incremental_parser_new(grammar_json,
+                                                               @input)
     end
   end
 end

data/lib/parsanol/interval_tree.rb

@@ -132,7 +132,10 @@ module Parsanol
 
       # Check right subtree
       # Only search right if intervals starting there could overlap
-      query_recursive(node.right, low, high, results) if node.right && node.low < high
+      if node.right && node.low < high
+        query_recursive(node.right, low, high,
+                        results)
+      end
     end
 
     # Find exact interval match
@@ -154,10 +157,16 @@ module Parsanol
       return nil if node.nil?
 
       # Recursively delete from left subtree
-      node.left = delete_overlapping_recursive(node.left, low, high, deleted) if node.left
+      if node.left
+        node.left = delete_overlapping_recursive(node.left, low, high,
+                                                 deleted)
+      end
 
       # Recursively delete from right subtree
-      node.right = delete_overlapping_recursive(node.right, low, high, deleted) if node.right
+      if node.right
+        node.right = delete_overlapping_recursive(node.right, low, high,
+                                                  deleted)
+      end
 
       # Check if current node overlaps
       if node.low < high && low < node.high

data/lib/parsanol/lazy_result.rb

@@ -85,10 +85,10 @@ module Parsanol
     # @yield [element] Each element
     # @return [Enumerator, self] Enumerator if no block, self otherwise
     #
-    def each(&block)
+    def each(&)
       return to_enum(:each) unless block_given?
 
-      to_a.each(&block)
+      to_a.each(&)
       self
     end
 

data/lib/parsanol/mermaid.rb

@@ -16,7 +16,7 @@ module Parsanol
   # Generates Mermaid diagram syntax from parser atoms.
   class MermaidBuilder
     def initialize
-      @lines = ['graph TD']
+      @lines = ["graph TD"]
       @node_counter = 0
       @connections = []
       @seen_rules = Set.new
@@ -24,8 +24,8 @@ module Parsanol
 
     # Entry point for parser visualization
     def visit_parser(root_atom)
-      add_node('Parser', 'root')
-      traverse(root_atom, 'Parser')
+      add_node("Parser", "root")
+      traverse(root_atom, "Parser")
       finalize
     end
 
@@ -35,7 +35,7 @@ module Parsanol
 
       @seen_rules << rule_name
 
-      node_id = add_node(rule_name.to_s.upcase, 'rule')
+      node_id = add_node(rule_name.to_s.upcase, "rule")
       connect(current_parent, node_id)
       traverse(rule_block.call, node_id)
     end
@@ -67,18 +67,18 @@ module Parsanol
 
     # Leaf nodes
     def visit_re(regexp)
-      add_node("match(#{regexp.inspect})", 'terminal', style: 'ellipse')
+      add_node("match(#{regexp.inspect})", "terminal", style: "ellipse")
     end
 
     def visit_str(string)
-      add_node("'#{string}'", 'terminal', style: 'ellipse')
+      add_node("'#{string}'", "terminal", style: "ellipse")
     end
 
     private
 
     attr_reader :current_parent
 
-    def add_node(label, _shape_type = 'rect', _style = nil)
+    def add_node(label, _shape_type = "rect", _style = nil)
       @node_counter += 1
       node_id = "node_#{@node_counter}"
       @lines << "    #{node_id}[\"#{escape_mermaid(label)}\"]"
@@ -97,7 +97,7 @@ module Parsanol
       @connections.each do |from, to|
         @lines << "    #{from} --> #{to}"
       end
-      @lines << ''
+      @lines << ""
       @lines.join("\n")
     end
 
@@ -125,7 +125,10 @@ module Parsanol
     def mermaid_for_rule(rule_name)
       builder = MermaidBuilder.new
       rule_method = method(rule_name)
-      raise NotImplementedError, "Rule '#{rule_name}' not found" unless rule_method
+      unless rule_method
+        raise NotImplementedError,
+              "Rule '#{rule_name}' not found"
+      end
 
       rule_method.call.accept(builder)
       builder.output