edn-abnf 0.5.21 → 0.5.23

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
checksums.yaml CHANGED
@@ -1,7 +1,7 @@
1
1
  ---
2
2
  SHA256:
3
- metadata.gz: 1a48d4b4d55d42a64eb47ed73557f846722afa3c53bd8f41585361c34968eda7
4
- data.tar.gz: db3a3032894bf087c97ff0ce6cc61b39378d4eca06d5512ded102bfaec2aa66d
3
+ metadata.gz: 2de62d87cb2ff756b2aaf5a615604391289921e5430f28f5ba0d655d4e0eb631
4
+ data.tar.gz: 56d5f8bc3a375799c9d8c534463b61a3b0e1d69c8422e21d0b8e40e7f4b79164
5
5
  SHA512:
6
- metadata.gz: e26cb769623d7a3cf6e5d2eb43a971651b36523b8f14152c6d8d703212f0c5be4bddd5b7f92f3add2f60545d39d075cebccb2eed98a377d0ccac4560207b0076
7
- data.tar.gz: 53c91f71836fe3532e358d6d2c74fa196274fb66b098c048ce8ff587dec561139edd3877b6ff734fc9904752bfb2ae3b42d4b475ace082085a1610531d6eeb58
6
+ metadata.gz: 05ca01e9fb98904f0d81b61d94bd78006ab09c8abf059c8ee71d40bf8110624021c711ca995fda388ac0528d1653100e57459487425166e785dbd2e6f0ff67aa
7
+ data.tar.gz: 3b8cb49feb84b974d613b87094e391bc3f00a7afb7fdbf113a37f92d996123b764729e876849432539a9a57244365954152d7d5daa9b41dbe208eb125b3bfb5a
data/edn-abnf.gemspec CHANGED
@@ -1,6 +1,6 @@
1
1
  Gem::Specification.new do |s|
2
2
  s.name = "edn-abnf"
3
- s.version = "0.5.21"
3
+ s.version = "0.5.23"
4
4
  s.summary = "CBOR Extended Diagnostic Notation (EDN) implemented in ABNF"
5
5
  s.description = %q{edn-abnf implements converters and miscellaneous tools for CBOR EDN's ABNF}
6
6
  s.author = "Carsten Bormann"
@@ -2129,69 +2129,57 @@ module EDNGRAMMAR
2129
2129
  s0, i0 = [], index
2130
2130
  loop do
2131
2131
  i1 = index
2132
- if (match_len = has_terminal?("\t", false, index))
2132
+ if (match_len = has_terminal?("\n", false, index))
2133
2133
  r2 = true
2134
2134
  @index += match_len
2135
2135
  else
2136
- terminal_parse_failure('"\\t"')
2136
+ terminal_parse_failure('"\\n"')
2137
2137
  r2 = nil
2138
2138
  end
2139
2139
  if r2
2140
2140
  r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
2141
2141
  r1 = r2
2142
2142
  else
2143
- if (match_len = has_terminal?("\n", false, index))
2143
+ if (match_len = has_terminal?("\r", false, index))
2144
2144
  r3 = true
2145
2145
  @index += match_len
2146
2146
  else
2147
- terminal_parse_failure('"\\n"')
2147
+ terminal_parse_failure('"\\r"')
2148
2148
  r3 = nil
2149
2149
  end
2150
2150
  if r3
2151
2151
  r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true
2152
2152
  r1 = r3
2153
2153
  else
2154
- if (match_len = has_terminal?("\r", false, index))
2154
+ if has_terminal?(@regexps[gr = '\A[\\ -_]'] ||= Regexp.new(gr), :regexp, index)
2155
2155
  r4 = true
2156
- @index += match_len
2156
+ @index += 1
2157
2157
  else
2158
- terminal_parse_failure('"\\r"')
2158
+ terminal_parse_failure('[\\ -_]')
2159
2159
  r4 = nil
2160
2160
  end
2161
2161
  if r4
2162
2162
  r4 = SyntaxNode.new(input, (index-1)...index) if r4 == true
2163
2163
  r1 = r4
2164
2164
  else
2165
- if has_terminal?(@regexps[gr = '\A[\\ -_]'] ||= Regexp.new(gr), :regexp, index)
2165
+ if has_terminal?(@regexps[gr = '\A[a-~]'] ||= Regexp.new(gr), :regexp, index)
2166
2166
  r5 = true
2167
2167
  @index += 1
2168
2168
  else
2169
- terminal_parse_failure('[\\ -_]')
2169
+ terminal_parse_failure('[a-~]')
2170
2170
  r5 = nil
2171
2171
  end
2172
2172
  if r5
2173
2173
  r5 = SyntaxNode.new(input, (index-1)...index) if r5 == true
2174
2174
  r1 = r5
2175
2175
  else
2176
- if has_terminal?(@regexps[gr = '\A[a-~]'] ||= Regexp.new(gr), :regexp, index)
2177
- r6 = true
2178
- @index += 1
2179
- else
2180
- terminal_parse_failure('[a-~]')
2181
- r6 = nil
2182
- end
2176
+ r6 = _nt_NONASCII
2183
2177
  if r6
2184
2178
  r6 = SyntaxNode.new(input, (index-1)...index) if r6 == true
2185
2179
  r1 = r6
2186
2180
  else
2187
- r7 = _nt_NONASCII
2188
- if r7
2189
- r7 = SyntaxNode.new(input, (index-1)...index) if r7 == true
2190
- r1 = r7
2191
- else
2192
- @index = i1
2193
- r1 = nil
2194
- end
2181
+ @index = i1
2182
+ r1 = nil
2195
2183
  end
2196
2184
  end
2197
2185
  end
@@ -3189,6 +3177,50 @@ module EDNGRAMMAR
3189
3177
  r0
3190
3178
  end
3191
3179
 
3180
+ def _nt_lblank
3181
+ start_index = index
3182
+ if node_cache[:lblank].has_key?(index)
3183
+ cached = node_cache[:lblank][index]
3184
+ if cached
3185
+ node_cache[:lblank][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
3186
+ @index = cached.interval.end
3187
+ end
3188
+ return cached
3189
+ end
3190
+
3191
+ i0 = index
3192
+ if (match_len = has_terminal?("\n", false, index))
3193
+ r1 = true
3194
+ @index += match_len
3195
+ else
3196
+ terminal_parse_failure('"\\n"')
3197
+ r1 = nil
3198
+ end
3199
+ if r1
3200
+ r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
3201
+ r0 = r1
3202
+ else
3203
+ if (match_len = has_terminal?(" ", false, index))
3204
+ r2 = true
3205
+ @index += match_len
3206
+ else
3207
+ terminal_parse_failure('" "')
3208
+ r2 = nil
3209
+ end
3210
+ if r2
3211
+ r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
3212
+ r0 = r2
3213
+ else
3214
+ @index = i0
3215
+ r0 = nil
3216
+ end
3217
+ end
3218
+
3219
+ node_cache[:lblank][start_index] = r0
3220
+
3221
+ r0
3222
+ end
3223
+
3192
3224
  def _nt_non_slash
3193
3225
  start_index = index
3194
3226
  if node_cache[:non_slash].has_key?(index)
@@ -8009,63 +8041,51 @@ module EDNGRAMMAR
8009
8041
  end
8010
8042
 
8011
8043
  i0 = index
8012
- if (match_len = has_terminal?("\t", false, index))
8044
+ if (match_len = has_terminal?("\r", false, index))
8013
8045
  r1 = true
8014
8046
  @index += match_len
8015
8047
  else
8016
- terminal_parse_failure('"\\t"')
8048
+ terminal_parse_failure('"\\r"')
8017
8049
  r1 = nil
8018
8050
  end
8019
8051
  if r1
8020
8052
  r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
8021
8053
  r0 = r1
8022
8054
  else
8023
- if (match_len = has_terminal?("\r", false, index))
8055
+ if has_terminal?(@regexps[gr = '\A[\\ -_]'] ||= Regexp.new(gr), :regexp, index)
8024
8056
  r2 = true
8025
- @index += match_len
8057
+ @index += 1
8026
8058
  else
8027
- terminal_parse_failure('"\\r"')
8059
+ terminal_parse_failure('[\\ -_]')
8028
8060
  r2 = nil
8029
8061
  end
8030
8062
  if r2
8031
8063
  r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
8032
8064
  r0 = r2
8033
8065
  else
8034
- if has_terminal?(@regexps[gr = '\A[\\ -_]'] ||= Regexp.new(gr), :regexp, index)
8066
+ if has_terminal?(@regexps[gr = '\A[a-]'] ||= Regexp.new(gr), :regexp, index)
8035
8067
  r3 = true
8036
8068
  @index += 1
8037
8069
  else
8038
- terminal_parse_failure('[\\ -_]')
8070
+ terminal_parse_failure('[a-]')
8039
8071
  r3 = nil
8040
8072
  end
8041
8073
  if r3
8042
8074
  r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true
8043
8075
  r0 = r3
8044
8076
  else
8045
- if has_terminal?(@regexps[gr = '\A[a-]'] ||= Regexp.new(gr), :regexp, index)
8046
- r4 = true
8047
- @index += 1
8048
- else
8049
- terminal_parse_failure('[a-]')
8050
- r4 = nil
8051
- end
8077
+ r4 = _nt_NONASCII
8052
8078
  if r4
8053
8079
  r4 = SyntaxNode.new(input, (index-1)...index) if r4 == true
8054
8080
  r0 = r4
8055
8081
  else
8056
- r5 = _nt_NONASCII
8082
+ r5 = _nt_shortrawdelim
8057
8083
  if r5
8058
8084
  r5 = SyntaxNode.new(input, (index-1)...index) if r5 == true
8059
8085
  r0 = r5
8060
8086
  else
8061
- r6 = _nt_shortrawdelim
8062
- if r6
8063
- r6 = SyntaxNode.new(input, (index-1)...index) if r6 == true
8064
- r0 = r6
8065
- else
8066
- @index = i0
8067
- r0 = nil
8068
- end
8087
+ @index = i0
8088
+ r0 = nil
8069
8089
  end
8070
8090
  end
8071
8091
  end
@@ -8078,14 +8098,14 @@ module EDNGRAMMAR
8078
8098
  end
8079
8099
 
8080
8100
  module SqAppStringH0
8081
- def app_string_h
8101
+ def s_app_string_h
8082
8102
  elements[1]
8083
8103
  end
8084
8104
 
8085
8105
  end
8086
8106
 
8087
8107
  module SqAppStringH1
8088
- def ast; app_string_h.ast end
8108
+ def ast; s_app_string_h.ast end
8089
8109
  end
8090
8110
 
8091
8111
  def _nt_sq_app_string_h
@@ -8109,7 +8129,7 @@ module EDNGRAMMAR
8109
8129
  end
8110
8130
  s0 << r1
8111
8131
  if r1
8112
- r2 = _nt_app_string_h
8132
+ r2 = _nt_s_app_string_h
8113
8133
  s0 << r2
8114
8134
  if r2
8115
8135
  if (match_len = has_terminal?("'", false, index))
@@ -8136,7 +8156,7 @@ module EDNGRAMMAR
8136
8156
  r0
8137
8157
  end
8138
8158
 
8139
- module AppStringH0
8159
+ module SAppStringH0
8140
8160
  def HEXDIG1
8141
8161
  elements[0]
8142
8162
  end
@@ -8154,13 +8174,13 @@ module EDNGRAMMAR
8154
8174
  end
8155
8175
  end
8156
8176
 
8157
- module AppStringH1
8177
+ module SAppStringH1
8158
8178
  def ast
8159
8179
  Integer(elements[0].text_value + elements[2].text_value, 16).chr("BINARY")
8160
8180
  end
8161
8181
  end
8162
8182
 
8163
- module AppStringH2
8183
+ module SAppStringH2
8164
8184
  def ellipsis
8165
8185
  elements[0]
8166
8186
  end
@@ -8170,21 +8190,21 @@ module EDNGRAMMAR
8170
8190
  end
8171
8191
  end
8172
8192
 
8173
- module AppStringH3
8193
+ module SAppStringH3
8174
8194
  def ast; ellipsis.ast end
8175
8195
  end
8176
8196
 
8177
- module AppStringH4
8197
+ module SAppStringH4
8178
8198
  end
8179
8199
 
8180
- module AppStringH5
8200
+ module SAppStringH5
8181
8201
  def h_S
8182
8202
  elements[0]
8183
8203
  end
8184
8204
 
8185
8205
  end
8186
8206
 
8187
- module AppStringH6
8207
+ module SAppStringH6
8188
8208
  def unpack_thread(s)
8189
8209
  case s[0]
8190
8210
  when CBOR::Tagged
@@ -8215,12 +8235,12 @@ module EDNGRAMMAR
8215
8235
  end
8216
8236
  end
8217
8237
 
8218
- def _nt_app_string_h
8238
+ def _nt_s_app_string_h
8219
8239
  start_index = index
8220
- if node_cache[:app_string_h].has_key?(index)
8221
- cached = node_cache[:app_string_h][index]
8240
+ if node_cache[:s_app_string_h].has_key?(index)
8241
+ cached = node_cache[:s_app_string_h][index]
8222
8242
  if cached
8223
- node_cache[:app_string_h][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
8243
+ node_cache[:s_app_string_h][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
8224
8244
  @index = cached.interval.end
8225
8245
  end
8226
8246
  return cached
@@ -8250,8 +8270,8 @@ module EDNGRAMMAR
8250
8270
  end
8251
8271
  if s4.last
8252
8272
  r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
8253
- r4.extend(AppStringH0)
8254
- r4.extend(AppStringH1)
8273
+ r4.extend(SAppStringH0)
8274
+ r4.extend(SAppStringH1)
8255
8275
  else
8256
8276
  @index = i4
8257
8277
  r4 = nil
@@ -8269,8 +8289,8 @@ module EDNGRAMMAR
8269
8289
  end
8270
8290
  if s9.last
8271
8291
  r9 = instantiate_node(SyntaxNode,input, i9...index, s9)
8272
- r9.extend(AppStringH2)
8273
- r9.extend(AppStringH3)
8292
+ r9.extend(SAppStringH2)
8293
+ r9.extend(SAppStringH3)
8274
8294
  else
8275
8295
  @index = i9
8276
8296
  r9 = nil
@@ -8316,7 +8336,7 @@ module EDNGRAMMAR
8316
8336
  end
8317
8337
  if s13.last
8318
8338
  r13 = instantiate_node(SyntaxNode,input, i13...index, s13)
8319
- r13.extend(AppStringH4)
8339
+ r13.extend(SAppStringH4)
8320
8340
  else
8321
8341
  @index = i13
8322
8342
  r13 = nil
@@ -8331,14 +8351,14 @@ module EDNGRAMMAR
8331
8351
  end
8332
8352
  if s0.last
8333
8353
  r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
8334
- r0.extend(AppStringH5)
8335
- r0.extend(AppStringH6)
8354
+ r0.extend(SAppStringH5)
8355
+ r0.extend(SAppStringH6)
8336
8356
  else
8337
8357
  @index = i0
8338
8358
  r0 = nil
8339
8359
  end
8340
8360
 
8341
- node_cache[:app_string_h][start_index] = r0
8361
+ node_cache[:s_app_string_h][start_index] = r0
8342
8362
 
8343
8363
  r0
8344
8364
  end
@@ -8712,7 +8732,7 @@ module EDNGRAMMAR
8712
8732
  i0, s0 = index, []
8713
8733
  s1, i1 = [], index
8714
8734
  loop do
8715
- r2 = _nt_blank
8735
+ r2 = _nt_lblank
8716
8736
  if r2
8717
8737
  s1 << r2
8718
8738
  else
@@ -8730,7 +8750,7 @@ module EDNGRAMMAR
8730
8750
  if r5
8731
8751
  s6, i6 = [], index
8732
8752
  loop do
8733
- r7 = _nt_blank
8753
+ r7 = _nt_lblank
8734
8754
  if r7
8735
8755
  s6 << r7
8736
8756
  else
@@ -8781,7 +8801,7 @@ module EDNGRAMMAR
8781
8801
  end
8782
8802
 
8783
8803
  i0 = index
8784
- r1 = _nt_blank
8804
+ r1 = _nt_lblank
8785
8805
  if r1
8786
8806
  r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
8787
8807
  r0 = r1
@@ -9042,7 +9062,7 @@ module EDNGRAMMAR
9042
9062
  elements[0]
9043
9063
  end
9044
9064
 
9045
- def h_S
9065
+ def rh_S
9046
9066
  elements[1]
9047
9067
  end
9048
9068
  end
@@ -9144,7 +9164,7 @@ module EDNGRAMMAR
9144
9164
  r10 = _nt_ellipsis
9145
9165
  s9 << r10
9146
9166
  if r10
9147
- r11 = _nt_h_S
9167
+ r11 = _nt_rh_S
9148
9168
  s9 << r11
9149
9169
  end
9150
9170
  if s9.last
@@ -9237,14 +9257,14 @@ module EDNGRAMMAR
9237
9257
  end
9238
9258
 
9239
9259
  module SqAppStringB640
9240
- def app_string_b64
9260
+ def s_app_string_b64
9241
9261
  elements[1]
9242
9262
  end
9243
9263
 
9244
9264
  end
9245
9265
 
9246
9266
  module SqAppStringB641
9247
- def ast; app_string_b64.ast end
9267
+ def ast; s_app_string_b64.ast end
9248
9268
  end
9249
9269
 
9250
9270
  def _nt_sq_app_string_b64
@@ -9268,7 +9288,7 @@ module EDNGRAMMAR
9268
9288
  end
9269
9289
  s0 << r1
9270
9290
  if r1
9271
- r2 = _nt_app_string_b64
9291
+ r2 = _nt_s_app_string_b64
9272
9292
  s0 << r2
9273
9293
  if r2
9274
9294
  if (match_len = has_terminal?("'", false, index))
@@ -9295,7 +9315,7 @@ module EDNGRAMMAR
9295
9315
  r0
9296
9316
  end
9297
9317
 
9298
- module AppStringB640
9318
+ module SAppStringB640
9299
9319
  def b64dig
9300
9320
  elements[0]
9301
9321
  end
@@ -9305,14 +9325,14 @@ module EDNGRAMMAR
9305
9325
  end
9306
9326
  end
9307
9327
 
9308
- module AppStringB641
9328
+ module SAppStringB641
9309
9329
  def b64_S
9310
9330
  elements[1]
9311
9331
  end
9312
9332
 
9313
9333
  end
9314
9334
 
9315
- module AppStringB642
9335
+ module SAppStringB642
9316
9336
  def b64dig
9317
9337
  elements[0]
9318
9338
  end
@@ -9323,7 +9343,7 @@ module EDNGRAMMAR
9323
9343
 
9324
9344
  end
9325
9345
 
9326
- module AppStringB643
9346
+ module SAppStringB643
9327
9347
  def b64dig1
9328
9348
  elements[0]
9329
9349
  end
@@ -9345,17 +9365,17 @@ module EDNGRAMMAR
9345
9365
  end
9346
9366
  end
9347
9367
 
9348
- module AppStringB644
9368
+ module SAppStringB644
9349
9369
  end
9350
9370
 
9351
- module AppStringB645
9371
+ module SAppStringB645
9352
9372
  def b64_S
9353
9373
  elements[0]
9354
9374
  end
9355
9375
 
9356
9376
  end
9357
9377
 
9358
- module AppStringB646
9378
+ module SAppStringB646
9359
9379
  def ast
9360
9380
  t = text_value.gsub(/\s|#[^\n]*(?:\n|\z)/, '').chars.each_slice(4).map(&:join)
9361
9381
  if last = t[-1]
@@ -9370,12 +9390,12 @@ module EDNGRAMMAR
9370
9390
  end
9371
9391
  end
9372
9392
 
9373
- def _nt_app_string_b64
9393
+ def _nt_s_app_string_b64
9374
9394
  start_index = index
9375
- if node_cache[:app_string_b64].has_key?(index)
9376
- cached = node_cache[:app_string_b64][index]
9395
+ if node_cache[:s_app_string_b64].has_key?(index)
9396
+ cached = node_cache[:s_app_string_b64][index]
9377
9397
  if cached
9378
- node_cache[:app_string_b64][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
9398
+ node_cache[:s_app_string_b64][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
9379
9399
  @index = cached.interval.end
9380
9400
  end
9381
9401
  return cached
@@ -9398,7 +9418,7 @@ module EDNGRAMMAR
9398
9418
  end
9399
9419
  if s4.last
9400
9420
  r4 = instantiate_node(SyntaxNode,input, i4...index, s4)
9401
- r4.extend(AppStringB640)
9421
+ r4.extend(SAppStringB640)
9402
9422
  else
9403
9423
  @index = i4
9404
9424
  r4 = nil
@@ -9469,7 +9489,7 @@ module EDNGRAMMAR
9469
9489
  end
9470
9490
  if s15.last
9471
9491
  r15 = instantiate_node(SyntaxNode,input, i15...index, s15)
9472
- r15.extend(AppStringB641)
9492
+ r15.extend(SAppStringB641)
9473
9493
  else
9474
9494
  @index = i15
9475
9495
  r15 = nil
@@ -9502,7 +9522,7 @@ module EDNGRAMMAR
9502
9522
  end
9503
9523
  if s19.last
9504
9524
  r19 = instantiate_node(SyntaxNode,input, i19...index, s19)
9505
- r19.extend(AppStringB642)
9525
+ r19.extend(SAppStringB642)
9506
9526
  else
9507
9527
  @index = i19
9508
9528
  r19 = nil
@@ -9531,7 +9551,7 @@ module EDNGRAMMAR
9531
9551
  end
9532
9552
  if s8.last
9533
9553
  r8 = instantiate_node(SyntaxNode,input, i8...index, s8)
9534
- r8.extend(AppStringB643)
9554
+ r8.extend(SAppStringB643)
9535
9555
  else
9536
9556
  @index = i8
9537
9557
  r8 = nil
@@ -9567,7 +9587,7 @@ module EDNGRAMMAR
9567
9587
  end
9568
9588
  if s26.last
9569
9589
  r26 = instantiate_node(SyntaxNode,input, i26...index, s26)
9570
- r26.extend(AppStringB644)
9590
+ r26.extend(SAppStringB644)
9571
9591
  else
9572
9592
  @index = i26
9573
9593
  r26 = nil
@@ -9583,14 +9603,14 @@ module EDNGRAMMAR
9583
9603
  end
9584
9604
  if s0.last
9585
9605
  r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
9586
- r0.extend(AppStringB645)
9587
- r0.extend(AppStringB646)
9606
+ r0.extend(SAppStringB645)
9607
+ r0.extend(SAppStringB646)
9588
9608
  else
9589
9609
  @index = i0
9590
9610
  r0 = nil
9591
9611
  end
9592
9612
 
9593
- node_cache[:app_string_b64][start_index] = r0
9613
+ node_cache[:s_app_string_b64][start_index] = r0
9594
9614
 
9595
9615
  r0
9596
9616
  end
@@ -9876,7 +9896,7 @@ module EDNGRAMMAR
9876
9896
  elements[0]
9877
9897
  end
9878
9898
 
9879
- def b64_S
9899
+ def rb64_S
9880
9900
  elements[1]
9881
9901
  end
9882
9902
  end
@@ -9928,7 +9948,7 @@ module EDNGRAMMAR
9928
9948
  end
9929
9949
 
9930
9950
  module RAppStringB645
9931
- def b64_S
9951
+ def rb64_S
9932
9952
  elements[0]
9933
9953
  end
9934
9954
 
@@ -9961,7 +9981,7 @@ module EDNGRAMMAR
9961
9981
  end
9962
9982
 
9963
9983
  i0, s0 = index, []
9964
- r1 = _nt_b64_S
9984
+ r1 = _nt_rb64_S
9965
9985
  s0 << r1
9966
9986
  if r1
9967
9987
  s2, i2 = [], index
@@ -9972,7 +9992,7 @@ module EDNGRAMMAR
9972
9992
  r5 = _nt_b64dig
9973
9993
  s4 << r5
9974
9994
  if r5
9975
- r6 = _nt_b64_S
9995
+ r6 = _nt_rb64_S
9976
9996
  s4 << r6
9977
9997
  end
9978
9998
  if s4.last
@@ -10211,7 +10231,7 @@ module EDNGRAMMAR
10211
10231
  i0, s0 = index, []
10212
10232
  s1, i1 = [], index
10213
10233
  loop do
10214
- r2 = _nt_blank
10234
+ r2 = _nt_lblank
10215
10235
  if r2
10216
10236
  s1 << r2
10217
10237
  else
@@ -10229,7 +10249,7 @@ module EDNGRAMMAR
10229
10249
  if r5
10230
10250
  s6, i6 = [], index
10231
10251
  loop do
10232
- r7 = _nt_blank
10252
+ r7 = _nt_lblank
10233
10253
  if r7
10234
10254
  s6 << r7
10235
10255
  else
metadata CHANGED
@@ -1,7 +1,7 @@
1
1
  --- !ruby/object:Gem::Specification
2
2
  name: edn-abnf
3
3
  version: !ruby/object:Gem::Version
4
- version: 0.5.21
4
+ version: 0.5.23
5
5
  platform: ruby
6
6
  authors:
7
7
  - Carsten Bormann