onigmo 0.1.0

data/lib/onigmo/node.rb

@@ -0,0 +1,266 @@
+# frozen_string_literal: true
+
+module Onigmo
+  # The base class for all nodes in the tree.
+  class Node
+    def accept(visitor)
+      raise NoMethodError, __method__
+    end
+
+    def deconstruct_keys(keys)
+      accept(DeconstructVisitor.new)
+    end
+
+    def pretty_print(q)
+      accept(PrettyPrintVisitor.new(q))
+      q.flush
+    end
+
+    def as_json
+      accept(JSONVisitor.new)
+    end
+
+    def to_json(*opts)
+      as_json.to_json(*opts)
+    end
+
+    private_class_method :new
+  end
+
+  # foo|bar
+  # ^^^^^^^
+  class AlternationNode < Node
+    attr_reader :nodes
+
+    def initialize(nodes)
+      @nodes = nodes
+    end
+  end
+
+  # \A
+  # ^^
+  class AnchorBufferBeginNode < Node
+  end
+
+  # \z
+  # ^^
+  class AnchorBufferEndNode < Node
+  end
+
+  # \K
+  # ^^
+  class AnchorKeepNode < Node
+  end
+
+  # ^
+  # ^
+  class AnchorLineBeginNode < Node
+  end
+
+  # $
+  # ^
+  class AnchorLineEndNode < Node
+  end
+
+  # \G
+  # ^^
+  class AnchorPositionBeginNode < Node
+  end
+
+  # \Z
+  # ^^
+  class AnchorSemiEndNode < Node
+  end
+
+  # \b
+  # ^^
+  class AnchorWordBoundaryNode < Node
+  end
+
+  # \B
+  # ^^
+  class AnchorWordBoundaryInvertNode < Node
+  end
+
+  # .
+  # ^
+  class AnyNode < Node
+  end
+
+  # \k<name>
+  # ^^^^^^^^
+  class BackrefNode < Node
+    attr_reader :values
+
+    def initialize(values)
+      @values = values
+    end
+  end
+
+  # \g<name>
+  # ^^^^^^^^
+  class CallNode < Node
+    attr_reader :number, :name
+
+    def initialize(number, name)
+      @number = number
+      @name = name
+    end
+  end
+
+  # [a-z]
+  # ^^^^^
+  class CClassNode < Node
+    attr_reader :values
+
+    def initialize(values)
+      @values = values
+    end
+  end
+
+  # [^a-z]
+  # ^^^^^^
+  class CClassInvertNode < Node
+    attr_reader :values
+
+    def initialize(values)
+      @values = values
+    end
+  end
+
+  # (?~subexp)
+  # ^^^^^^^^^^
+  class EncloseAbsentNode < Node
+    attr_reader :node
+
+    def initialize(node)
+      @node = node
+    end
+  end
+
+  # (?(cond)subexp)
+  # ^^^^^^^^^^^^^^^
+  class EncloseConditionNode < Node
+    attr_reader :number, :node
+
+    def initialize(number, node)
+      @number = number
+      @node = node
+    end
+  end
+
+  # ()
+  # ^^
+  class EncloseMemoryNode < Node
+    attr_reader :number, :node
+
+    def initialize(number, node)
+      @number = number
+      @node = node
+    end
+  end
+
+  # (?options:subexp)
+  # ^^^^^^^^^^^^^^^^^
+  class EncloseOptionsNode < Node
+    attr_reader :options, :node
+
+    def initialize(options, node)
+      @options = options
+      @node = node
+    end
+  end
+
+  # (?>subexp)
+  # ^^^^^^^^^^
+  class EncloseStopBacktrackNode < Node
+    attr_reader :node
+
+    def initialize(node)
+      @node = node
+    end
+  end
+
+  # a.b
+  # ^^^
+  class ListNode < Node
+    attr_reader :nodes
+
+    def initialize(nodes)
+      @nodes = nodes
+    end
+  end
+
+  # (?=subexp)
+  # ^^^^^^^^^^
+  class LookAheadNode < Node
+    attr_reader :node
+
+    def initialize(node)
+      @node = node
+    end
+  end
+
+  # (?!subexp)
+  # ^^^^^^^^^^
+  class LookAheadInvertNode < Node
+    attr_reader :node
+
+    def initialize(node)
+      @node = node
+    end
+  end
+
+  # (?<=subexp)
+  # ^^^^^^^^^^
+  class LookBehindNode < Node
+    attr_reader :node
+
+    def initialize(node)
+      @node = node
+    end
+  end
+
+  # (?<!subexp)
+  # ^^^^^^^^^^^
+  class LookBehindInvertNode < Node
+    attr_reader :node
+
+    def initialize(node)
+      @node = node
+    end
+  end
+
+  # a{1,2}
+  #  ^^^^^
+  class QuantifierNode < Node
+    attr_reader :lower, :upper, :greedy, :node
+
+    def initialize(lower, upper, greedy, node)
+      @lower = lower
+      @upper = upper
+      @greedy = greedy
+      @node = node
+    end
+  end
+
+  # abc
+  # ^^^
+  class StringNode < Node
+    attr_reader :value
+
+    def initialize(value)
+      @value = value
+    end
+  end
+
+  # \w
+  # ^^
+  class WordNode < Node
+  end
+
+  # \W
+  # ^^
+  class WordInvertNode < Node
+  end
+end

data/lib/onigmo/pretty_print_visitor.rb

@@ -0,0 +1,284 @@
+# frozen_string_literal: true
+
+require "pp"
+
+module Onigmo
+  class PrettyPrintVisitor < Visitor
+    attr_reader :q
+
+    def initialize(q)
+      @q = q
+    end
+
+    def visit_alternation_node(node)
+      q.group do
+        q.text("alternation(")
+        q.nest(2) do
+          q.breakable("")
+          q.seplist(node.nodes) do |child_node|
+            visit(child_node)
+          end
+        end
+        q.breakable("")
+        q.text(")")
+      end
+    end
+
+    def visit_anchor_buffer_begin_node(node)
+      q.text("anchorBufferBegin()")
+    end
+
+    def visit_anchor_buffer_end_node(node)
+      q.text("anchorBufferEnd()")
+    end
+
+    def visit_anchor_keep_node(node)
+      q.text("anchorKeep()")
+    end
+
+    def visit_anchor_line_begin_node(node)
+      q.text("anchorLineBegin()")
+    end
+
+    def visit_anchor_line_end_node(node)
+      q.text("anchorLineEnd()")
+    end
+
+    def visit_anchor_position_begin_node(node)
+      q.text("anchorPositionBegin()")
+    end
+
+    def visit_anchor_semi_end_node(node)
+      q.text("anchorSemiEnd()")
+    end
+
+    def visit_anchor_word_boundary_node(node)
+      q.text("anchorWordBoundary()")
+    end
+
+    def visit_anchor_word_boundary_invert_node(node)
+      q.text("anchorWordBoundaryInvert()")
+    end
+
+    def visit_any_node(node)
+      q.text("any")
+    end
+
+    def visit_backref_node(node)
+      q.group do
+        q.text("backref(")
+        q.nest(2) do
+          q.breakable("")
+          q.seplist(node.values) do |value|
+            q.pp(value)
+          end
+        end
+        q.breakable("")
+        q.text(")")
+      end
+    end
+
+    def visit_call_node(node)
+      q.group do
+        q.text("call(")
+        q.nest(2) do
+          q.breakable("")
+          q.seplist([node.number, node.name]) do |value|
+            q.pp(value)
+          end
+        end
+        q.breakable("")
+        q.text(")")
+      end
+    end
+
+    def visit_cclass_node(node)
+      q.group do
+        q.text("cclass(")
+        q.nest(2) do
+          q.breakable("")
+          q.pp(node.values)
+        end
+        q.breakable("")
+        q.text(")")
+      end
+    end
+
+    def visit_cclass_invert_node(node)
+      q.group do
+        q.text("cclassInvert(")
+        q.nest(2) do
+          q.breakable("")
+          q.pp(node.values)
+        end
+        q.breakable("")
+        q.text(")")
+      end
+    end
+
+    def visit_enclose_absent_node(node)
+      q.group do
+        q.text("encloseAbsent(")
+        q.nest(2) do
+          q.breakable("")
+          visit(node.node)
+        end
+        q.breakable("")
+        q.text(")")
+      end
+    end
+
+    def visit_enclose_condition_node(node)
+      q.group do
+        q.text("encloseCondition(")
+        q.nest(2) do
+          q.breakable("")
+          q.pp(node.number)
+          q.comma_breakable
+          visit(node.node)
+        end
+        q.breakable("")
+        q.text(")")
+      end
+    end
+
+    def visit_enclose_memory_node(node)
+      q.group do
+        q.text("encloseMemory(")
+        q.nest(2) do
+          q.breakable("")
+          q.pp(node.number)
+          q.comma_breakable
+          visit(node.node)
+        end
+        q.breakable("")
+        q.text(")")
+      end
+    end
+
+    def visit_enclose_options_node(node)
+      q.group do
+        q.text("encloseOptions(")
+        q.nest(2) do
+          q.breakable("")
+          q.pp(node.options)
+          q.comma_breakable
+          visit(node.node)
+        end
+        q.breakable("")
+        q.text(")")
+      end
+    end
+
+    def visit_enclose_stop_backtrack_node(node)
+      q.group do
+        q.text("encloseStopBacktrack(")
+        q.nest(2) do
+          q.breakable("")
+          visit(node.node)
+        end
+        q.breakable("")
+        q.text(")")
+      end
+    end
+
+    def visit_list_node(node)
+      q.group do
+        q.text("list(")
+        q.nest(2) do
+          q.breakable("")
+          q.seplist(node.nodes) do |child_node|
+            visit(child_node)
+          end
+        end
+        q.breakable("")
+        q.text(")")
+      end
+    end
+
+    def visit_look_ahead_node(node)
+      q.group do
+        q.text("lookAhead(")
+        q.nest(2) do
+          q.breakable("")
+          visit(node.node)
+        end
+        q.breakable("")
+        q.text(")")
+      end
+    end
+
+    def visit_look_ahead_invert_node(node)
+      q.group do
+        q.text("lookAheadInvert(")
+        q.nest(2) do
+          q.breakable("")
+          visit(node.node)
+        end
+        q.breakable("")
+        q.text(")")
+      end
+    end
+
+    def visit_look_behind_node(node)
+      q.group do
+        q.text("lookBehind(")
+        q.nest(2) do
+          q.breakable("")
+          visit(node.node)
+        end
+        q.breakable("")
+        q.text(")")
+      end
+    end
+
+    def visit_look_behind_invert_node(node)
+      q.group do
+        q.text("lookBehindInvert(")
+        q.nest(2) do
+          q.breakable("")
+          visit(node.node)
+        end
+        q.breakable("")
+        q.text(")")
+      end
+    end
+
+    def visit_quantifier_node(node)
+      q.group do
+        q.text("quantifier(")
+        q.nest(2) do
+          q.breakable("")
+          q.seplist({ lower: node.lower, upper: node.upper, greedy: node.greedy }) do |key, value|
+            q.text("#{key}: ")
+            q.pp(value)
+          end
+          q.comma_breakable
+          visit(node.node)
+        end
+        q.breakable("")
+        q.text(")")
+      end
+    end
+
+    def visit_string_node(node)
+      q.group do
+        q.text("string(")
+        q.nest(2) do
+          q.breakable("")
+          q.pp(node.value)
+        end
+        q.breakable("")
+        q.text(")")
+      end
+    end
+
+    def visit_word_node(node)
+      q.text("word()")
+    end
+
+    def visit_word_invert_node(node)
+      q.text("wordInvert()")
+    end
+  end
+end