/
node_pattern.rb
720 lines (621 loc) · 25.2 KB
/
node_pattern.rb
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
# frozen_string_literal: true
require 'delegate'
require 'erb'
# rubocop:disable Metrics/ClassLength, Metrics/CyclomaticComplexity
module RuboCop
# This class performs a pattern-matching operation on an AST node.
#
# Initialize a new `NodePattern` with `NodePattern.new(pattern_string)`, then
# pass an AST node to `NodePattern#match`. Alternatively, use one of the class
# macros in `NodePattern::Macros` to define your own pattern-matching method.
#
# If the match fails, `nil` will be returned. If the match succeeds, the
# return value depends on whether a block was provided to `#match`, and
# whether the pattern contained any "captures" (values which are extracted
# from a matching AST.)
#
# - With block: #match yields the captures (if any) and passes the return
# value of the block through.
# - With no block, but one capture: the capture is returned.
# - With no block, but multiple captures: captures are returned as an array.
# - With no block and no captures: #match returns `true`.
#
# ## Pattern string format examples
#
# ':sym' # matches a literal symbol
# '1' # matches a literal integer
# 'nil' # matches a literal nil
# 'send' # matches (send ...)
# '(send)' # matches (send)
# '(send ...)' # matches (send ...)
# '(op-asgn)' # node types with hyphenated names also work
# '{send class}' # matches (send ...) or (class ...)
# '({send class})' # matches (send) or (class)
# '(send const)' # matches (send (const ...))
# '(send _ :new)' # matches (send <anything> :new)
# '(send $_ :new)' # as above, but whatever matches the $_ is captured
# '(send $_ $_)' # you can use as many captures as you want
# '(send !const ...)' # ! negates the next part of the pattern
# '$(send const ...)' # arbitrary matching can be performed on a capture
# '(send _recv _msg)' # wildcards can be named (for readability)
# '(send ... :new)' # you can match against the last children
# '(array <str sym>)' # you can match children in any order. This
# # would match `['x', :y]` as well as `[:y, 'x']
# '(_ <str sym ...>)' # will match if arguments have at least a `str` and
# # a `sym` node, but can have more.
# '(array <$str $_>)' # captures are in the order of the pattern,
# # irrespective of the actual order of the children
# '(send $...)' # capture all the children as an array
# '(send $... int)' # capture all children but the last as an array
# '(send _x :+ _x)' # unification is performed on named wildcards
# # (like Prolog variables...)
# # (#== is used to see if values unify)
# '(int odd?)' # words which end with a ? are predicate methods,
# # are are called on the target to see if it matches
# # any Ruby method which the matched object supports
# # can be used
# # if a truthy value is returned, the match succeeds
# '(int [!1 !2])' # [] contains multiple patterns, ALL of which must
# # match in that position
# # in other words, while {} is pattern union (logical
# # OR), [] is intersection (logical AND)
# '(send %1 _)' # % stands for a parameter which must be supplied to
# # #match at matching time
# # it will be compared to the corresponding value in
# # the AST using #==
# # a bare '%' is the same as '%1'
# # the number of extra parameters passed to #match
# # must equal the highest % value in the pattern
# # for consistency, %0 is the 'root node' which is
# # passed as the 1st argument to #match, where the
# # matching process starts
# '^^send' # each ^ ascends one level in the AST
# # so this matches against the grandparent node
# '#method' # we call this a 'funcall'; it calls a method in the
# # context where a pattern-matching method is defined
# # if that returns a truthy value, the match succeeds
# 'equal?(%1)' # predicates can be given 1 or more extra args
# '#method(%0, 1)' # funcalls can also be given 1 or more extra args
#
# You can nest arbitrarily deep:
#
# # matches node parsed from 'Const = Class.new' or 'Const = Module.new':
# '(casgn nil? :Const (send (const nil? {:Class :Module}) :new))'
# # matches a node parsed from an 'if', with a '==' comparison,
# # and no 'else' branch:
# '(if (send _ :== _) _ nil?)'
#
# Note that patterns like 'send' are implemented by calling `#send_type?` on
# the node being matched, 'const' by `#const_type?`, 'int' by `#int_type?`,
# and so on. Therefore, if you add methods which are named like
# `#prefix_type?` to the AST node class, then 'prefix' will become usable as
# a pattern.
#
# Also note that if you need a "guard clause" to protect against possible nils
# in a certain place in the AST, you can do it like this: `[!nil <pattern>]`
#
# The compiler code is very simple; don't be afraid to read through it!
class NodePattern
# @private
Invalid = Class.new(StandardError)
# @private
# Builds Ruby code which implements a pattern
class Compiler
SYMBOL = %r{:(?:[\w+@*/?!<>=~|%^-]+|\[\]=?)}.freeze
IDENTIFIER = /[a-zA-Z_][a-zA-Z0-9_-]*/.freeze
META = Regexp.union(%w"( ) { } [ ] $< < > $... $ ! ^ ...").freeze
NUMBER = /-?\d+(?:\.\d+)?/.freeze
STRING = /".+?"/.freeze
METHOD_NAME = /\#?#{IDENTIFIER}[\!\?]?\(?/.freeze
PARAM_NUMBER = /%\d*/.freeze
SEPARATORS = /[\s]+/.freeze
TOKENS = Regexp.union(META, PARAM_NUMBER, NUMBER,
METHOD_NAME, SYMBOL, STRING)
TOKEN = /\G(?:#{SEPARATORS}|#{TOKENS}|.)/.freeze
NODE = /\A#{IDENTIFIER}\Z/.freeze
PREDICATE = /\A#{IDENTIFIER}\?\(?\Z/.freeze
WILDCARD = /\A_(?:#{IDENTIFIER})?\Z/.freeze
FUNCALL = /\A\##{METHOD_NAME}/.freeze
LITERAL = /\A(?:#{SYMBOL}|#{NUMBER}|#{STRING})\Z/.freeze
PARAM = /\A#{PARAM_NUMBER}\Z/.freeze
CLOSING = /\A(?:\)|\}|\])\Z/.freeze
REST = '...'
CAPTURED_REST = '$...'
attr_reader :match_code, :tokens, :captures
SEQ_HEAD_INDEX = -1
# Placeholders while compiling, see with_..._context methods
CUR_PLACEHOLDER = '@@@cur'
CUR_NODE = "#{CUR_PLACEHOLDER} node@@@"
CUR_ELEMENT = "#{CUR_PLACEHOLDER} element@@@"
SEQ_HEAD_GUARD = '@@@seq guard head@@@'
line = __LINE__
ANY_ORDER_TEMPLATE = ERB.new <<-RUBY.strip_indent.gsub("-%>\n", '%>')
<% if capture_rest %>(<%= capture_rest %> = []) && <% end -%>
<% if capture_all %>(<%= capture_all %> = <% end -%>
<%= CUR_NODE %>.children[<%= range %>]<% if capture_all %>)<% end -%>
.each_with_object({}) { |<%= child %>, <%= matched %>|
case
<% patterns.each_with_index do |pattern, i| -%>
when !<%= matched %>[<%= i %>] && <%=
with_context(pattern, child, use_temp_node: false)
%> then <%= matched %>[<%= i %>] = true
<% end -%>
<% if !rest %> else break({})
<% elsif capture_rest %> else <%= capture_rest %> << <%= child %>
<% end -%>
end
}.size == <%= patterns.size -%>
RUBY
ANY_ORDER_TEMPLATE.location = [__FILE__, line + 1]
def initialize(str, node_var = 'node0')
@string = str
@root = node_var
@temps = 0 # avoid name clashes between temp variables
@captures = 0 # number of captures seen
@unify = {} # named wildcard -> temp variable number
@params = 0 # highest % (param) number seen
run(node_var)
end
def run(node_var)
@tokens = Compiler.tokens(@string)
@match_code = with_context(compile_expr, node_var, use_temp_node: false)
@match_code.prepend("(captures = Array.new(#{@captures})) && ") \
if @captures.positive?
fail_due_to('unbalanced pattern') unless tokens.empty?
end
# rubocop:disable Metrics/MethodLength, Metrics/AbcSize
def compile_expr(token = tokens.shift)
# read a single pattern-matching expression from the token stream,
# return Ruby code which performs the corresponding matching operation
#
# the 'pattern-matching' expression may be a composite which
# contains an arbitrary number of sub-expressions, but that composite
# must all have precedence higher or equal to that of `&&`
#
# Expressions may use placeholders like:
# CUR_NODE: Ruby code that evaluates to an AST node
# CUR_ELEMENT: Either the node or the type if in first element of
# a sequence (aka seq_head, e.g. "(seq_head first_node_arg ...")
case token
when '(' then compile_seq
when '{' then compile_union
when '[' then compile_intersect
when '!' then compile_negation
when '$' then compile_capture
when '^' then compile_ascend
when WILDCARD then compile_wildcard(token[1..-1])
when FUNCALL then compile_funcall(token)
when LITERAL then compile_literal(token)
when PREDICATE then compile_predicate(token)
when NODE then compile_nodetype(token)
when PARAM then compile_param(token[1..-1])
when CLOSING then fail_due_to("#{token} in invalid position")
when nil then fail_due_to('pattern ended prematurely')
else fail_due_to("invalid token #{token.inspect}")
end
end
# rubocop:enable Metrics/MethodLength, Metrics/AbcSize
def tokens_until(stop, what)
return to_enum __method__, stop, what unless block_given?
fail_due_to("empty #{what}") if tokens.first == stop && what
yield until tokens.first == stop
tokens.shift
end
def compile_seq
terms = tokens_until(')', 'sequence').map { variadic_seq_term }
Sequence.new(self, *terms).compile
end
def compile_guard_clause
"#{CUR_NODE}.is_a?(RuboCop::AST::Node)"
end
def variadic_seq_term
token = tokens.shift
case token
when CAPTURED_REST then compile_captured_ellipsis
when REST then compile_ellipsis
when '$<' then compile_any_order(next_capture)
when '<' then compile_any_order
else [1, compile_expr(token)]
end
end
# @private
# Builds Ruby code for a sequence
# (head *first_terms variadic_term *last_terms)
class Sequence < SimpleDelegator
def initialize(compiler, *arity_term_list)
@arities, @terms = arity_term_list.transpose
super(compiler)
@variadic_index = @arities.find_index { |a| a.is_a?(Range) }
fail_due_to 'multiple variable patterns in same sequence' \
if @variadic_index && !@arities.one? { |a| a.is_a?(Range) }
end
def compile
[
compile_guard_clause,
compile_child_nb_guard,
compile_seq_head,
*compile_first_terms,
compile_variadic_term,
*compile_last_terms
].compact.join(" &&\n") << SEQ_HEAD_GUARD
end
private
def first_terms_arity
first_terms_range { |r| @arities[r].inject(0, :+) } || 0
end
def last_terms_arity
last_terms_range { |r| @arities[r].inject(0, :+) } || 0
end
def first_terms_range
yield 1..(@variadic_index || @terms.size) - 1 if seq_head?
end
def last_terms_range
yield @variadic_index + 1...@terms.size if @variadic_index
end
def seq_head?
@variadic_index != 0
end
def compile_child_nb_guard
min = first_terms_arity + last_terms_arity
"#{CUR_NODE}.children.size #{@variadic_index ? '>' : '='}= #{min}"
end
def term(index, range)
t = @terms[index]
if t.respond_to? :call
t.call(range)
else
with_child_context(t, range.begin)
end
end
def compile_seq_head
return unless seq_head?
fail_due_to 'sequences can not start with <' \
if @terms[0].respond_to? :call
with_seq_head_context(@terms[0])
end
def compile_first_terms
first_terms_range { |range| compile_terms(range, 0) }
end
def compile_last_terms
last_terms_range { |r| compile_terms(r, -last_terms_arity) }
end
def compile_terms(index_range, start)
index_range.map do |i|
current = start
start += @arities.fetch(i)
term(i, current..start - 1)
end
end
def compile_variadic_term
variadic_arity { |arity| term(@variadic_index, arity) }
end
def variadic_arity
return unless @variadic_index
first = @variadic_index.positive? ? first_terms_arity : SEQ_HEAD_INDEX
yield first..-last_terms_arity - 1
end
end
private_constant :Sequence
def compile_captured_ellipsis
capture = next_capture
block = lambda { |range|
# Consider ($...) like (_ $...):
range = 0..range.end if range.begin == SEQ_HEAD_INDEX
"(#{capture} = #{CUR_NODE}.children[#{range}])"
}
[0..Float::INFINITY, block]
end
def compile_ellipsis
[0..Float::INFINITY, 'true']
end
# rubocop:disable Metrics/MethodLength
def compile_any_order(capture_all = nil)
rest = capture_rest = nil
patterns = []
with_temp_variables do |child, matched|
tokens_until('>', 'any child').each do
fail_due_to 'ellipsis must be at the end of <>' if rest
token = tokens.shift
case token
when CAPTURED_REST then rest = capture_rest = next_capture
when REST then rest = true
else patterns << compile_expr(token)
end
end
[rest ? patterns.size..Float::INFINITY : patterns.size,
->(range) { ANY_ORDER_TEMPLATE.result(binding) }]
end
end
# rubocop:enable Metrics/MethodLength
def insure_same_captures(enum, what)
return to_enum __method__, enum, what unless block_given?
captures_before = captures_after = nil
enum.each do
captures_before ||= @captures
@captures = captures_before
yield
captures_after ||= @captures
if captures_after != @captures
fail_due_to("each #{what} must have same # of captures")
end
end
end
def compile_union
# we need to ensure that each branch of the {} contains the same
# number of captures (since only one branch of the {} can actually
# match, the same variables are used to hold the captures for each
# branch)
enum = tokens_until('}', 'union')
terms = insure_same_captures(enum, 'branch of {}')
.map { compile_expr }
"(#{terms.join(' || ')})"
end
def compile_intersect
tokens_until(']', 'intersection')
.map { compile_expr }
.join(' && ')
end
def compile_capture
"(#{next_capture} = #{CUR_ELEMENT}; #{compile_expr})"
end
def compile_negation
"!(#{compile_expr})"
end
def compile_ascend
with_context("#{CUR_NODE} && #{compile_expr}", "#{CUR_NODE}.parent")
end
def compile_wildcard(name)
if name.empty?
'true'
elsif @unify.key?(name)
# we have already seen a wildcard with this name before
# so the value it matched the first time will already be stored
# in a temp. check if this value matches the one stored in the temp
"#{CUR_ELEMENT} == temp#{@unify[name]}"
else
n = @unify[name] = next_temp_value
# double assign to temp#{n} to avoid "assigned but unused variable"
"(temp#{n} = #{CUR_ELEMENT}; " \
"temp#{n} = temp#{n}; true)"
end
end
def compile_literal(literal)
"#{CUR_ELEMENT} == #{literal}"
end
def compile_predicate(predicate)
if predicate.end_with?('(') # is there an arglist?
args = compile_args(tokens)
predicate = predicate[0..-2] # drop the trailing (
"#{CUR_ELEMENT}.#{predicate}(#{args.join(',')})"
else
"#{CUR_ELEMENT}.#{predicate}"
end
end
def compile_funcall(method)
# call a method in the context which this pattern-matching
# code is used in. pass target value as an argument
method = method[1..-1] # drop the leading #
if method.end_with?('(') # is there an arglist?
args = compile_args(tokens)
method = method[0..-2] # drop the trailing (
"#{method}(#{CUR_ELEMENT},#{args.join(',')})"
else
"#{method}(#{CUR_ELEMENT})"
end
end
def compile_nodetype(type)
"#{compile_guard_clause} && #{CUR_NODE}.#{type.tr('-', '_')}_type?"
end
def compile_param(number)
"#{CUR_ELEMENT} == #{get_param(number)}"
end
def compile_args(tokens)
index = tokens.find_index { |token| token == ')' }
tokens.slice!(0..index).each_with_object([]) do |token, args|
next if [')', ','].include?(token)
args << compile_arg(token)
end
end
def compile_arg(token)
case token
when WILDCARD then
name = token[1..-1]
number = @unify[name] || fail_due_to('invalid in arglist: ' + token)
"temp#{number}"
when LITERAL then token
when PARAM then get_param(token[1..-1])
when CLOSING then fail_due_to("#{token} in invalid position")
when nil then fail_due_to('pattern ended prematurely')
else fail_due_to("invalid token in arglist: #{token.inspect}")
end
end
def next_capture
index = @captures
@captures += 1
"captures[#{index}]"
end
def get_param(number)
number = number.empty? ? 1 : Integer(number)
@params = number if number > @params
number.zero? ? @root : "param#{number}"
end
def emit_yield_capture(when_no_capture = '')
yield_val = if @captures.zero?
when_no_capture
elsif @captures == 1
'captures[0]' # Circumvent https://github.com/jruby/jruby/issues/5710
else
'*captures'
end
"yield(#{yield_val})"
end
def emit_retval
if @captures.zero?
'true'
elsif @captures == 1
'captures[0]'
else
'captures'
end
end
def emit_param_list
(1..@params).map { |n| "param#{n}" }.join(',')
end
def emit_trailing_params
params = emit_param_list
params.empty? ? '' : ",#{params}"
end
def emit_method_code
<<-RUBY
return unless #{@match_code}
block_given? ? #{emit_yield_capture} : (return #{emit_retval})
RUBY
end
def fail_due_to(message)
raise Invalid, "Couldn't compile due to #{message}. Pattern: #{@string}"
end
def with_temp_node(cur_node)
with_temp_variables do |node|
yield "(#{node} = #{cur_node})", node
end
.gsub("\n", "\n ") # Nicer indent for debugging
end
def with_temp_variables(&block)
names = block.parameters.map { |_, name| "#{name}#{next_temp_value}" }
yield(*names)
end
def next_temp_value
@temps += 1
end
def auto_use_temp_node?(code)
code.scan(CUR_PLACEHOLDER).count > 1
end
# with_<...>_context methods are used whenever the context,
# i.e the current node or the current element can be determined.
def with_child_context(code, child_index)
with_context(code, "#{CUR_NODE}.children[#{child_index}]")
end
def with_context(code, cur_node,
use_temp_node: auto_use_temp_node?(code))
if use_temp_node
with_temp_node(cur_node) do |init, temp_var|
substitute_cur_node(code, temp_var, first_cur_node: init)
end
else
substitute_cur_node(code, cur_node)
end
end
def with_seq_head_context(code)
if code.include?(SEQ_HEAD_GUARD)
fail_due_to('parentheses at sequence head')
end
code.gsub CUR_ELEMENT, "#{CUR_NODE}.type"
end
def substitute_cur_node(code, cur_node, first_cur_node: cur_node)
iter = 0
code
.gsub(CUR_ELEMENT, CUR_NODE)
.gsub(CUR_NODE) do
iter += 1
iter == 1 ? first_cur_node : cur_node
end
.gsub(SEQ_HEAD_GUARD, '')
end
def self.tokens(pattern)
pattern.scan(TOKEN).reject { |token| token =~ /\A#{SEPARATORS}\Z/ }
end
end
private_constant :Compiler
# Helpers for defining methods based on a pattern string
module Macros
# Define a method which applies a pattern to an AST node
#
# The new method will return nil if the node does not match
# If the node matches, and a block is provided, the new method will
# yield to the block (passing any captures as block arguments).
# If the node matches, and no block is provided, the new method will
# return the captures, or `true` if there were none.
def def_node_matcher(method_name, pattern_str)
compiler = Compiler.new(pattern_str, 'node')
src = "def #{method_name}(node = self" \
"#{compiler.emit_trailing_params});" \
"#{compiler.emit_method_code};end"
location = caller_locations(1, 1).first
class_eval(src, location.path, location.lineno)
end
# Define a method which recurses over the descendants of an AST node,
# checking whether any of them match the provided pattern
#
# If the method name ends with '?', the new method will return `true`
# as soon as it finds a descendant which matches. Otherwise, it will
# yield all descendants which match.
def def_node_search(method_name, pattern_str)
compiler = Compiler.new(pattern_str, 'node')
called_from = caller(1..1).first.split(':')
if method_name.to_s.end_with?('?')
node_search_first(method_name, compiler, called_from)
else
node_search_all(method_name, compiler, called_from)
end
end
def node_search_first(method_name, compiler, called_from)
node_search(method_name, compiler, 'return true', '', called_from)
end
def node_search_all(method_name, compiler, called_from)
yield_code = compiler.emit_yield_capture('node')
prelude = "return enum_for(:#{method_name}, node0" \
"#{compiler.emit_trailing_params}) unless block_given?"
node_search(method_name, compiler, yield_code, prelude, called_from)
end
def node_search(method_name, compiler, on_match, prelude, called_from)
src = node_search_body(method_name, compiler.emit_trailing_params,
prelude, compiler.match_code, on_match)
filename, lineno = *called_from
class_eval(src, filename, lineno.to_i)
end
def node_search_body(method_name, trailing_params, prelude, match_code,
on_match)
<<-RUBY
def #{method_name}(node0#{trailing_params})
#{prelude}
node0.each_node do |node|
if #{match_code}
#{on_match}
end
end
nil
end
RUBY
end
end
attr_reader :pattern
def initialize(str)
@pattern = str
compiler = Compiler.new(str)
src = "def match(node0#{compiler.emit_trailing_params});" \
"#{compiler.emit_method_code}end"
instance_eval(src, __FILE__, __LINE__ + 1)
end
def match(*args)
# If we're here, it's because the singleton method has not been defined,
# either because we've been dup'ed or serialized through YAML
initialize(pattern)
match(*args)
end
def marshal_load(pattern)
initialize pattern
end
def marshal_dump
pattern
end
def ==(other)
other.is_a?(NodePattern) &&
Compiler.tokens(other.pattern) == Compiler.tokens(pattern)
end
alias eql? ==
def to_s
"#<#{self.class} #{pattern}>"
end
end
end
# rubocop:enable Metrics/ClassLength, Metrics/CyclomaticComplexity