parser 2.5.1.0 → 2.5.1.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 3d4445244332537a2a91b8b6f6a2d35b750ffb1dbc3869c91f1a4de840a89600
-  data.tar.gz: 800b3adeae6c64459f2b604c3c4b935eb728018bfe4136debae16c96df0384bf
+  metadata.gz: 999565504b59c7ad12546445a92d20f6ff6235ed29d76c8c52eb73513c23d9e7
+  data.tar.gz: e04475df2071b10e772259cc6697875067432121122541a5ef5a5092eeee4e1f
 SHA512:
-  metadata.gz: 99138e99f88e016a3da7cac3fe45c492068fe5fa5ecb6df640ade2f6890c05fdc2aff096d255e0fd57f75f4e5c3300c15f16fa9be177e9fdc56711c6e6ea29ac
-  data.tar.gz: 71504873b9c22a3adfd0d0ee304e69e3317b93d52a7e2506c6225e2c768cea2ddd9bf1a874a04c8b0706047f78dc97f49b7841307f64198678f03a3336ad2675
+  metadata.gz: ef4a0c50b91ba31b62c2274a6d442589fa277e0a606811800e9590ae73e7f6236d80fbc01c1d180adf2d64532d87dc99fcfa4953a28fa272dcce2fb195e8b224
+  data.tar.gz: 88e285335392b9269787035fe5dccc073758157496bcade661be8acbb912ec134e86fa75e8a2e3fbc0a62f7fa8a38c9f581cbecd9059bbddfe03812f958002cd

data/CHANGELOG.md

@@ -1,9 +1,27 @@
 Changelog
 =========
 
-Not released (2018-04-12)
+Not released (2018-07-10)
 -------------------------
 
+Bugs fixed:
+ * lexer.rl: Partially revert 5ba072d and properly handle 'm = -> *args do end'. (Ilya Bylich)
+
+v2.5.1.1 (2018-07-10)
+---------------------
+
+Features implemented:
+ * ruby26.y: Endless ranges support. (Ilya Bylich)
+
+Bugs fixed:
+ * lexer.rl: Fix parsing of 'm = -> *args do end'. (Ilya Bylich)
+ * AST::Processor: Properly recurse into "kwsplat" nodes (Nelson Elhage)
+ * ruby24, ruby25, ruby26: Fix cmdargs after command_args followed by tLBRACE_ARG. This commit tracks upstream commit ruby/ruby@f168dbd. (Ilya Bylich)
+ * lexer.rl: Fix parsing of `let (:a) { m do; end }`. (Ilya Bylich)
+
+v2.5.1.0 (2018-04-12)
+---------------------
+
 API modifications:
  * Parser::Current: bump latest 2.2 branch to 2.2.10. (Ilya Bylich)
 

data/README.md

@@ -217,7 +217,7 @@ at some point.
 Sometimes it is necessary to modify the format of AST nodes that are already being emitted
 in a way that would break existing applications. To avoid such breakage, applications
 must opt-in to these modifications; without explicit opt-in, Parser will continue to emit
-the old AST node format. The most recent set of opt-ins is speified in
+the old AST node format. The most recent set of opt-ins is specified in
 the [usage section](#usage) of this README.
 
 ## Compatibility with Ruby MRI

data/doc/AST_FORMAT.md

@@ -322,6 +322,23 @@ Format:
  ~~~~~ expression
 ~~~
 
+
+### Endless (2.6)
+
+Format:
+
+~~~
+(irange (int 1) nil)
+"1.."
+  ~~ operator
+ ~~~ expression
+
+(erange (int 1) nil)
+"1..."
+  ~~~ operator
+ ~~~~ expression
+~~~
+
 ## Access
 
 ### Self
@@ -1293,8 +1310,8 @@ Format:
  ~~~~~~ keyword
              ~~~~ begin
                           ~~~~ else
-                                     ~~~ end
- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ expression
+                                         ~~~ end
+ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ expression
 
 "unless cond; iftrue; else; iffalse; end"
  ~~~~~~ keyword

data/lib/parser/ast/processor.rb

@@ -16,6 +16,7 @@ module Parser
       alias on_regexp   process_regular_node
       alias on_xstr     process_regular_node
       alias on_splat    process_regular_node
+      alias on_kwsplat  process_regular_node
       alias on_array    process_regular_node
       alias on_pair     process_regular_node
       alias on_hash     process_regular_node

data/lib/parser/builders/default.rb

@@ -400,12 +400,12 @@ module Parser
 
     def range_inclusive(lhs, dot2_t, rhs)
       n(:irange, [ lhs, rhs ],
-        binary_op_map(lhs, dot2_t, rhs))
+        range_map(lhs, dot2_t, rhs))
     end
 
     def range_exclusive(lhs, dot3_t, rhs)
       n(:erange, [ lhs, rhs ],
-        binary_op_map(lhs, dot3_t, rhs))
+        range_map(lhs, dot3_t, rhs))
     end
 
     #
@@ -1388,6 +1388,16 @@ module Parser
       Source::Map::Operator.new(loc(op_t), expr_l)
     end
 
+    def range_map(start_e, op_t, end_e)
+      if end_e
+        expr_l = join_exprs(start_e, end_e)
+      else
+        expr_l = start_e.loc.expression.join(loc(op_t))
+      end
+
+      Source::Map::Operator.new(loc(op_t), expr_l)
+    end
+
     def arg_prefix_map(op_t, name_t=nil)
       if name_t.nil?
         expr_l = loc(op_t)

data/lib/parser/lexer/stack_state.rb

@@ -35,6 +35,10 @@ module Parser
       @stack[0] == 1
     end
 
+    def empty?
+      @stack == 0
+    end
+
     def to_s
       "[#{@stack.to_s(2)} <= #{@name}]"
     end