/
parser.rb
834 lines (732 loc) · 27.4 KB
/
parser.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
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
require 'sass/script/lexer'
module Sass
module Script
# The parser for SassScript.
# It parses a string of code into a tree of {Script::Tree::Node}s.
class Parser
# The line number of the parser's current position.
#
# @return [Integer]
def line
@lexer.line
end
# The column number of the parser's current position.
#
# @return [Integer]
def offset
@lexer.offset
end
# @param str [String, StringScanner] The source text to parse
# @param line [Integer] The line on which the SassScript appears.
# Used for error reporting and sourcemap building
# @param offset [Integer] The character (not byte) offset where the script starts in the line.
# Used for error reporting and sourcemap building
# @param options [{Symbol => Object}] An options hash; see
# {file:SASS_REFERENCE.md#Options the Sass options documentation}.
# This supports an additional `:allow_extra_text` option that controls
# whether the parser throws an error when extra text is encountered
# after the parsed construct.
def initialize(str, line, offset, options = {})
@options = options
@allow_extra_text = options.delete(:allow_extra_text)
@lexer = lexer_class.new(str, line, offset, options)
@stop_at = nil
end
# Parses a SassScript expression within an interpolated segment (`#{}`).
# This means that it stops when it comes across an unmatched `}`,
# which signals the end of an interpolated segment,
# it returns rather than throwing an error.
#
# @param warn_for_color [Boolean] Whether raw color values passed to
# interoplation should cause a warning.
# @return [Script::Tree::Node] The root node of the parse tree
# @raise [Sass::SyntaxError] if the expression isn't valid SassScript
def parse_interpolated(warn_for_color = false)
# Start two characters back to compensate for #{
start_pos = Sass::Source::Position.new(line, offset - 2)
expr = assert_expr :expr
assert_tok :end_interpolation
expr = Sass::Script::Tree::Interpolation.new(
nil, expr, nil, false, false, :warn_for_color => warn_for_color)
check_for_interpolation expr
expr.options = @options
node(expr, start_pos)
rescue Sass::SyntaxError => e
e.modify_backtrace :line => @lexer.line, :filename => @options[:filename]
raise e
end
# Parses a SassScript expression.
#
# @return [Script::Tree::Node] The root node of the parse tree
# @raise [Sass::SyntaxError] if the expression isn't valid SassScript
def parse
expr = assert_expr :expr
assert_done
expr.options = @options
check_for_interpolation expr
expr
rescue Sass::SyntaxError => e
e.modify_backtrace :line => @lexer.line, :filename => @options[:filename]
raise e
end
# Parses a SassScript expression,
# ending it when it encounters one of the given identifier tokens.
#
# @param tokens [#include?(String)] A set of strings that delimit the expression.
# @return [Script::Tree::Node] The root node of the parse tree
# @raise [Sass::SyntaxError] if the expression isn't valid SassScript
def parse_until(tokens)
@stop_at = tokens
expr = assert_expr :expr
assert_done
expr.options = @options
check_for_interpolation expr
expr
rescue Sass::SyntaxError => e
e.modify_backtrace :line => @lexer.line, :filename => @options[:filename]
raise e
end
# Parses the argument list for a mixin include.
#
# @return [(Array<Script::Tree::Node>,
# {String => Script::Tree::Node},
# Script::Tree::Node,
# Script::Tree::Node)]
# The root nodes of the positional arguments, keyword arguments, and
# splat argument(s). Keyword arguments are in a hash from names to values.
# @raise [Sass::SyntaxError] if the argument list isn't valid SassScript
def parse_mixin_include_arglist
args, keywords = [], {}
if try_tok(:lparen)
args, keywords, splat, kwarg_splat = mixin_arglist
assert_tok(:rparen)
end
assert_done
args.each do |a|
check_for_interpolation a
a.options = @options
end
keywords.each do |_, v|
check_for_interpolation v
v.options = @options
end
if splat
check_for_interpolation splat
splat.options = @options
end
if kwarg_splat
check_for_interpolation kwarg_splat
kwarg_splat.options = @options
end
return args, keywords, splat, kwarg_splat
rescue Sass::SyntaxError => e
e.modify_backtrace :line => @lexer.line, :filename => @options[:filename]
raise e
end
# Parses the argument list for a mixin definition.
#
# @return [(Array<Script::Tree::Node>, Script::Tree::Node)]
# The root nodes of the arguments, and the splat argument.
# @raise [Sass::SyntaxError] if the argument list isn't valid SassScript
def parse_mixin_definition_arglist
args, splat = defn_arglist!(false)
assert_done
args.each do |k, v|
check_for_interpolation k
k.options = @options
if v
check_for_interpolation v
v.options = @options
end
end
if splat
check_for_interpolation splat
splat.options = @options
end
return args, splat
rescue Sass::SyntaxError => e
e.modify_backtrace :line => @lexer.line, :filename => @options[:filename]
raise e
end
# Parses the argument list for a function definition.
#
# @return [(Array<Script::Tree::Node>, Script::Tree::Node)]
# The root nodes of the arguments, and the splat argument.
# @raise [Sass::SyntaxError] if the argument list isn't valid SassScript
def parse_function_definition_arglist
args, splat = defn_arglist!(true)
assert_done
args.each do |k, v|
check_for_interpolation k
k.options = @options
if v
check_for_interpolation v
v.options = @options
end
end
if splat
check_for_interpolation splat
splat.options = @options
end
return args, splat
rescue Sass::SyntaxError => e
e.modify_backtrace :line => @lexer.line, :filename => @options[:filename]
raise e
end
# Parse a single string value, possibly containing interpolation.
# Doesn't assert that the scanner is finished after parsing.
#
# @return [Script::Tree::Node] The root node of the parse tree.
# @raise [Sass::SyntaxError] if the string isn't valid SassScript
def parse_string
unless (peek = @lexer.peek) &&
(peek.type == :string ||
(peek.type == :funcall && peek.value.downcase == 'url'))
lexer.expected!("string")
end
expr = assert_expr :funcall
check_for_interpolation expr
expr.options = @options
@lexer.unpeek!
expr
rescue Sass::SyntaxError => e
e.modify_backtrace :line => @lexer.line, :filename => @options[:filename]
raise e
end
# Parses a SassScript expression.
#
# @overload parse(str, line, offset, filename = nil)
# @return [Script::Tree::Node] The root node of the parse tree
# @see Parser#initialize
# @see Parser#parse
def self.parse(*args)
new(*args).parse
end
PRECEDENCE = [
:comma, :single_eq, :space, :or, :and,
[:eq, :neq],
[:gt, :gte, :lt, :lte],
[:plus, :minus],
[:times, :div, :mod],
]
ASSOCIATIVE = [:plus, :times]
class << self
# Returns an integer representing the precedence
# of the given operator.
# A lower integer indicates a looser binding.
#
# @private
def precedence_of(op)
PRECEDENCE.each_with_index do |e, i|
return i if Array(e).include?(op)
end
raise "[BUG] Unknown operator #{op.inspect}"
end
# Returns whether or not the given operation is associative.
#
# @private
def associative?(op)
ASSOCIATIVE.include?(op)
end
private
# Defines a simple left-associative production.
# name is the name of the production,
# sub is the name of the production beneath it,
# and ops is a list of operators for this precedence level
def production(name, sub, *ops)
class_eval <<RUBY, __FILE__, __LINE__ + 1
def #{name}
interp = try_ops_after_interp(#{ops.inspect}, #{name.inspect})
return interp if interp
return unless e = #{sub}
while tok = try_toks(#{ops.map {|o| o.inspect}.join(', ')})
if interp = try_op_before_interp(tok, e)
other_interp = try_ops_after_interp(#{ops.inspect}, #{name.inspect}, interp)
return interp unless other_interp
return other_interp
end
e = node(Tree::Operation.new(e, assert_expr(#{sub.inspect}), tok.type),
e.source_range.start_pos)
end
e
end
RUBY
end
def unary(op, sub)
class_eval <<RUBY, __FILE__, __LINE__ + 1
def unary_#{op}
return #{sub} unless tok = try_tok(:#{op})
interp = try_op_before_interp(tok)
return interp if interp
start_pos = source_position
node(Tree::UnaryOperation.new(assert_expr(:unary_#{op}), :#{op}), start_pos)
end
RUBY
end
end
private
def source_position
Sass::Source::Position.new(line, offset)
end
def range(start_pos, end_pos = source_position)
Sass::Source::Range.new(start_pos, end_pos, @options[:filename], @options[:importer])
end
# @private
def lexer_class; Lexer; end
def map
start_pos = source_position
e = interpolation
return unless e
return list e, start_pos unless @lexer.peek && @lexer.peek.type == :colon
pair = map_pair(e)
map = node(Sass::Script::Tree::MapLiteral.new([pair]), start_pos)
while try_tok(:comma)
pair = map_pair
return map unless pair
map.pairs << pair
end
map
end
def map_pair(key = nil)
return unless key ||= interpolation
assert_tok :colon
return key, assert_expr(:interpolation)
end
def expr
start_pos = source_position
e = interpolation
return unless e
list e, start_pos
end
def list(first, start_pos)
return first unless @lexer.peek && @lexer.peek.type == :comma
list = node(Sass::Script::Tree::ListLiteral.new([first], separator: :comma), start_pos)
while (tok = try_tok(:comma))
element_before_interp = list.elements.length == 1 ? list.elements.first : list
if (interp = try_op_before_interp(tok, element_before_interp))
other_interp = try_ops_after_interp([:comma], :expr, interp)
return interp unless other_interp
return other_interp
end
return list unless (e = interpolation)
list.elements << e
list.source_range.end_pos = list.elements.last.source_range.end_pos
end
list
end
production :equals, :interpolation, :single_eq
def try_op_before_interp(op, prev = nil, after_interp = false)
return unless @lexer.peek && @lexer.peek.type == :begin_interpolation
unary = !prev && !after_interp
wb = @lexer.whitespace?(op)
str = literal_node(Script::Value::String.new(Lexer::OPERATORS_REVERSE[op.type]),
op.source_range)
deprecation =
case op.type
when :comma; :potential
when :div, :single_eq; :none
when :plus; unary ? :none : :immediate
when :minus; @lexer.whitespace?(@lexer.peek) ? :immediate : :none
else; :immediate
end
interp = node(
Script::Tree::Interpolation.new(
prev, str, nil, wb, false, :originally_text => true, :deprecation => deprecation),
(prev || str).source_range.start_pos)
interpolation(first: interp)
end
def try_ops_after_interp(ops, name, prev = nil)
return unless @lexer.after_interpolation?
op = try_toks(*ops)
return unless op
interp = try_op_before_interp(op, prev, :after_interp)
return interp if interp
wa = @lexer.whitespace?
str = literal_node(Script::Value::String.new(Lexer::OPERATORS_REVERSE[op.type]),
op.source_range)
str.line = @lexer.line
deprecation =
case op.type
when :comma; :potential
when :div, :single_eq; :none
when :minus; @lexer.whitespace?(op) ? :immediate : :none
else; :immediate
end
interp = node(
Script::Tree::Interpolation.new(
prev, str, assert_expr(name), false, wa,
:originally_text => true, :deprecation => deprecation),
(prev || str).source_range.start_pos)
interp
end
def interpolation(first: nil, inner: :space)
e = first || send(inner)
while (interp = try_tok(:begin_interpolation))
wb = @lexer.whitespace?(interp)
char_before = @lexer.char(interp.pos - 1)
mid = assert_expr :expr
assert_tok :end_interpolation
wa = @lexer.whitespace?
char_after = @lexer.char
after = send(inner)
before_deprecation = e.is_a?(Script::Tree::Interpolation) ? e.deprecation : :none
after_deprecation = after.is_a?(Script::Tree::Interpolation) ? after.deprecation : :none
deprecation =
if before_deprecation == :immediate || after_deprecation == :immediate ||
# Warn for #{foo}$var and #{foo}(1) but not #{$foo}1.
(after && !wa && char_after =~ /[$(]/) ||
# Warn for $var#{foo} and (a)#{foo} but not a#{foo}.
(e && !wb && is_unsafe_before?(e, char_before))
:immediate
else
:potential
end
e = node(
Script::Tree::Interpolation.new(e, mid, after, wb, wa, :deprecation => deprecation),
(e || interp).source_range.start_pos)
end
e
end
# Returns whether `expr` is unsafe to include before an interpolation.
#
# @param expr [Node] The expression to check.
# @param char_before [String] The character immediately before the
# interpolation being checked (and presumably the last character of
# `expr`).
# @return [Boolean]
def is_unsafe_before?(expr, char_before)
return char_before == ')' if is_safe_value?(expr)
# Otherwise, it's only safe if it was another interpolation.
!expr.is_a?(Script::Tree::Interpolation)
end
# Returns whether `expr` is safe as the value immediately before an
# interpolation.
#
# It's safe as long as the previous expression is an identifier or number,
# or a list whose last element is also safe.
def is_safe_value?(expr)
return is_safe_value?(expr.elements.last) if expr.is_a?(Script::Tree::ListLiteral)
return false unless expr.is_a?(Script::Tree::Literal)
expr.value.is_a?(Script::Value::Number) ||
(expr.value.is_a?(Script::Value::String) && expr.value.type == :identifier)
end
def space
start_pos = source_position
e = or_expr
return unless e
arr = [e]
while (e = or_expr)
arr << e
end
if arr.size == 1
arr.first
else
node(Sass::Script::Tree::ListLiteral.new(arr, separator: :space), start_pos)
end
end
production :or_expr, :and_expr, :or
production :and_expr, :eq_or_neq, :and
production :eq_or_neq, :relational, :eq, :neq
production :relational, :plus_or_minus, :gt, :gte, :lt, :lte
production :plus_or_minus, :times_div_or_mod, :plus, :minus
production :times_div_or_mod, :unary_plus, :times, :div, :mod
unary :plus, :unary_minus
unary :minus, :unary_div
unary :div, :unary_not # For strings, so /foo/bar works
unary :not, :ident
def ident
return funcall unless @lexer.peek && @lexer.peek.type == :ident
return if @stop_at && @stop_at.include?(@lexer.peek.value)
name = @lexer.next
if (color = Sass::Script::Value::Color::COLOR_NAMES[name.value.downcase])
literal_node(Sass::Script::Value::Color.new(color, name.value), name.source_range)
elsif name.value == "true"
literal_node(Sass::Script::Value::Bool.new(true), name.source_range)
elsif name.value == "false"
literal_node(Sass::Script::Value::Bool.new(false), name.source_range)
elsif name.value == "null"
literal_node(Sass::Script::Value::Null.new, name.source_range)
else
literal_node(Sass::Script::Value::String.new(name.value, :identifier), name.source_range)
end
end
def funcall
tok = try_tok(:funcall)
return raw unless tok
args, keywords, splat, kwarg_splat = fn_arglist
assert_tok(:rparen)
node(Script::Tree::Funcall.new(tok.value, args, keywords, splat, kwarg_splat),
tok.source_range.start_pos, source_position)
end
def defn_arglist!(must_have_parens)
if must_have_parens
assert_tok(:lparen)
else
return [], nil unless try_tok(:lparen)
end
res = []
splat = nil
must_have_default = false
loop do
break if peek_tok(:rparen)
c = assert_tok(:const)
var = node(Script::Tree::Variable.new(c.value), c.source_range)
if try_tok(:colon)
val = assert_expr(:space)
must_have_default = true
elsif try_tok(:splat)
splat = var
break
elsif must_have_default
raise SyntaxError.new(
"Required argument #{var.inspect} must come before any optional arguments.")
end
res << [var, val]
break unless try_tok(:comma)
end
assert_tok(:rparen)
return res, splat
end
def fn_arglist
arglist(:equals, "function argument")
end
def mixin_arglist
arglist(:interpolation, "mixin argument")
end
def arglist(subexpr, description)
args = []
keywords = Sass::Util::NormalizedMap.new
splat = nil
while (e = send(subexpr))
if @lexer.peek && @lexer.peek.type == :colon
name = e
@lexer.expected!("comma") unless name.is_a?(Tree::Variable)
assert_tok(:colon)
value = assert_expr(subexpr, description)
if keywords[name.name]
raise SyntaxError.new("Keyword argument \"#{name.to_sass}\" passed more than once")
end
keywords[name.name] = value
else
if try_tok(:splat)
return args, keywords, splat, e if splat
splat, e = e, nil
elsif splat
raise SyntaxError.new("Only keyword arguments may follow variable arguments (...).")
elsif !keywords.empty?
raise SyntaxError.new("Positional arguments must come before keyword arguments.")
end
args << e if e
end
return args, keywords, splat unless try_tok(:comma)
end
return args, keywords
end
def raw
tok = try_tok(:raw)
return special_fun unless tok
literal_node(Script::Value::String.new(tok.value), tok.source_range)
end
def special_fun
first = try_tok(:special_fun)
return square_list unless first
str = literal_node(first.value, first.source_range)
return str unless try_tok(:string_interpolation)
mid = assert_expr :expr
assert_tok :end_interpolation
last = assert_expr(:special_fun)
node(
Tree::Interpolation.new(str, mid, last, false, false),
first.source_range.start_pos)
end
def square_list
start_pos = source_position
return paren unless try_tok(:lsquare)
space_start_pos = source_position
e = interpolation(inner: :or_expr)
separator = nil
if e
elements = [e]
while (e = interpolation(inner: :or_expr))
elements << e
end
# If there's a comma after a space-separated list, it's actually a
# space-separated list nested in a comma-separated list.
if try_tok(:comma)
e = if elements.length == 1
elements.first
else
node(
Sass::Script::Tree::ListLiteral.new(elements, separator: :space),
space_start_pos)
end
elements = [e]
while (e = space)
elements << e
break unless try_tok(:comma)
end
separator = :comma
else
separator = :space if elements.length > 1
end
else
elements = []
end
assert_tok(:rsquare)
end_pos = source_position
node(Sass::Script::Tree::ListLiteral.new(elements, separator: separator, bracketed: true),
start_pos, end_pos)
end
def paren
return variable unless try_tok(:lparen)
start_pos = source_position
e = map
e.force_division! if e
end_pos = source_position
assert_tok(:rparen)
e || node(Sass::Script::Tree::ListLiteral.new([]), start_pos, end_pos)
end
def variable
start_pos = source_position
c = try_tok(:const)
return string unless c
node(Tree::Variable.new(*c.value), start_pos)
end
def string
first = try_tok(:string)
return number unless first
str = literal_node(first.value, first.source_range)
return str unless try_tok(:string_interpolation)
mid = assert_expr :expr
assert_tok :end_interpolation
last = assert_expr(:string)
node(Tree::StringInterpolation.new(str, mid, last), first.source_range.start_pos)
end
def number
tok = try_tok(:number)
return selector unless tok
num = tok.value
num.options = @options
num.original = num.to_s
literal_node(num, tok.source_range.start_pos)
end
def selector
tok = try_tok(:selector)
return literal unless tok
node(tok.value, tok.source_range.start_pos)
end
def literal
t = try_tok(:color)
return literal_node(t.value, t.source_range) if t
end
# It would be possible to have unified #assert and #try methods,
# but detecting the method/token difference turns out to be quite expensive.
EXPR_NAMES = {
:string => "string",
:default => "expression (e.g. 1px, bold)",
:mixin_arglist => "mixin argument",
:fn_arglist => "function argument",
:splat => "...",
:special_fun => '")"',
}
def assert_expr(name, expected = nil)
e = send(name)
return e if e
@lexer.expected!(expected || EXPR_NAMES[name] || EXPR_NAMES[:default])
end
def assert_tok(name)
# Avoids an array allocation caused by argument globbing in assert_toks.
t = try_tok(name)
return t if t
@lexer.expected!(Lexer::TOKEN_NAMES[name] || name.to_s)
end
def assert_toks(*names)
t = try_toks(*names)
return t if t
@lexer.expected!(names.map {|tok| Lexer::TOKEN_NAMES[tok] || tok}.join(" or "))
end
def peek_tok(name)
# Avoids an array allocation caused by argument globbing in the try_toks method.
peeked = @lexer.peek
peeked && name == peeked.type
end
def try_tok(name)
peek_tok(name) && @lexer.next
end
def try_toks(*names)
peeked = @lexer.peek
peeked && names.include?(peeked.type) && @lexer.next
end
def assert_done
if @allow_extra_text
# If extra text is allowed, just rewind the lexer so that the
# StringScanner is pointing to the end of the parsed text.
@lexer.unpeek!
else
return if @lexer.done?
@lexer.expected!(EXPR_NAMES[:default])
end
end
# @overload node(value, source_range)
# @param value [Sass::Script::Value::Base]
# @param source_range [Sass::Source::Range]
# @overload node(value, start_pos, end_pos = source_position)
# @param value [Sass::Script::Value::Base]
# @param start_pos [Sass::Source::Position]
# @param end_pos [Sass::Source::Position]
def literal_node(value, source_range_or_start_pos, end_pos = source_position)
node(Sass::Script::Tree::Literal.new(value), source_range_or_start_pos, end_pos)
end
# @overload node(node, source_range)
# @param node [Sass::Script::Tree::Node]
# @param source_range [Sass::Source::Range]
# @overload node(node, start_pos, end_pos = source_position)
# @param node [Sass::Script::Tree::Node]
# @param start_pos [Sass::Source::Position]
# @param end_pos [Sass::Source::Position]
def node(node, source_range_or_start_pos, end_pos = source_position)
source_range =
if source_range_or_start_pos.is_a?(Sass::Source::Range)
source_range_or_start_pos
else
range(source_range_or_start_pos, end_pos)
end
node.line = source_range.start_pos.line
node.source_range = source_range
node.filename = @options[:filename]
node
end
# Checks a script node for any immediately-deprecated interpolations, and
# emits warnings for them.
#
# @param node [Sass::Script::Tree::Node]
def check_for_interpolation(node)
nodes = [node]
until nodes.empty?
node = nodes.pop
unless node.is_a?(Sass::Script::Tree::Interpolation) &&
node.deprecation == :immediate
nodes.concat node.children
next
end
interpolation_deprecation(node)
end
end
# Emits a deprecation warning for an interpolation node.
#
# @param node [Sass::Script::Tree::Node]
def interpolation_deprecation(interpolation)
return if @options[:_convert]
location = "on line #{interpolation.line}"
location += " of #{interpolation.filename}" if interpolation.filename
Sass::Util.sass_warn <<WARNING
DEPRECATION WARNING #{location}:
\#{} interpolation near operators will be simplified in a future version of Sass.
To preserve the current behavior, use quotes:
#{interpolation.to_quoted_equivalent.to_sass}
You can use the sass-convert command to automatically fix most cases.
WARNING
end
end
end
end