birman 0.2.0 → 0.2.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: dffa403d5b8db3f4c977235997baedda18400899c9f1e692bf196bc6bb645152
-  data.tar.gz: e62c15487c0f6d1c4494e9103a198677379772f5904112877f8988c41f6be4b2
+  metadata.gz: 6e56dfecb27c1584f8aefdb873503084e140abf83d53f2b85ed453ad1e25dbbe
+  data.tar.gz: 35b4ee8725298c3809fbde953f51fca4c550ac207a68a2eade43ad7745e02b15
 SHA512:
-  metadata.gz: 51c0f918fec494fc1ef09b9af553f8824d486d2861d6a16a1b0bd06f273b20599f4d92844c2232c93dfd72e3b1635d3d8546e3ddee227b8a6406cebd7d67dbaf
-  data.tar.gz: 39a35b19fb92866e48b8fc80e308af33d70c105f108fa5ca093e35e0df7aa0d8ef29c11922d8cf66ac14baec6263b2f494765d2b4888fe538fb706188f8ef802
+  metadata.gz: abf8ca7031fe77792fb4a3e0a2c8480358320b2edfeebe0e8da7de0814cf71cbccc5229cf8fb710ec1ddebd49208a9b6f7cf8d9a3b6a066830b57b7271e90827
+  data.tar.gz: bdf4b37b3adcfc42ce7f5eb1bee447c83bbe5cc25ab4795a6478991775f9d913554426abf5c6b1392314f072fced9e7f53b8615ffb4fe5eeb37d0483764ece40

data/CHANGELOG.md

@@ -1,5 +1,17 @@
 ## [Unreleased]
 
+## [0.2.1] - 2026-10-17
+
+- **Fixed:** `rep` and `maybe` over something that can match empty.
+  An empty first match now counts, so `match(/a*/).rep(1)` accepts `""`
+  and `match(/a*/).maybe` gives `""` instead of `nil`. After real
+  matches, an empty one still just ends the repetition. (A plain
+  `.rep` over such a matcher now gives `[""]` on empty input, not `[]`.)
+- **Fixed:** a `label` now replaces the low-level expectations when its
+  matcher succeeds without consuming anything, as it already did when
+  the matcher failed: `str("a").maybe.label("prefix") >> str("b")` on
+  `"x"` reports `expected prefix or "b"`.
+
 ## [0.2.0] - 2026-10-17
 
 - **Added:** `one_of` takes a hash mapping literals to the values they

data/README.md

@@ -17,6 +17,12 @@ memoization, commit points, labels, and `Success`/`Failure` results.
 bundle add birman
 ```
 
+or in your Gemfile:
+
+```ruby
+gem "birman", "~> 0.2.1"
+```
+
 ```ruby
 require "birman"
 

data/lib/birman/matchers.rb

@@ -235,7 +235,13 @@ module Birman
       values = []
       while max.nil? || values.size < max
         r = inner.match(ctx, pos) or break
-        break if r.pos == pos # an empty match would loop forever
+        # Matching nothing ends the loop (repeating it would never stop).
+        # It still counts as the first match, so `x.rep(1)` and `x.maybe`
+        # work when x can match empty; after real matches it's just the end.
+        if r.pos == pos
+          values << r.value if values.empty?
+          break
+        end
 
         values << r.value
         pos = r.pos
@@ -291,8 +297,9 @@ module Birman
     def capture_key = inner.capture_key
   end
 
-  # Names a matcher for error messages. If inner fails without getting
-  # past its starting position, the error says "expected <name>"
+  # Names a matcher for error messages. If inner fails (or succeeds
+  # while consuming nothing) without getting past its starting
+  # position, the error says "expected <name>"
   # instead of listing every low-level alternative. If it got further,
   # the deeper (more specific) error is kept.
   Label = Data.define(:inner, :name) do
@@ -300,7 +307,7 @@ module Birman
 
     def match(ctx, pos)
       result, furthest, expected = ctx.isolate(pos) { inner.match(ctx, pos) }
-      if result.nil? && furthest == pos
+      if furthest == pos && (result.nil? || (result.pos == pos && expected.any?))
         ctx.fail_at(pos, name)
       else
         ctx.merge(furthest, expected)

data/lib/birman/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 module Birman
-  VERSION = "0.2.0"
+  VERSION = "0.2.1"
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: birman
 version: !ruby/object:Gem::Version
-  version: 0.2.0
+  version: 0.2.1
 platform: ruby
 authors:
 - Tad Thorley