diff --git a/spec.html b/spec.html
index 8ce2b03a7d..250c2f7f70 100644
--- a/spec.html
+++ b/spec.html
@@ -36479,8 +36479,7 @@ <h1>
           <dl class="header">
           </dl>
           <emu-alg>
-            1. Assert: _match_.[[StartIndex]] is a non-negative integer less than or equal to the length of _S_.
-            1. Assert: _match_.[[EndIndex]] is an integer between _match_.[[StartIndex]] and the length of _S_, inclusive.
+            1. Assert: _match_.[[StartIndex]] &le; _match_.[[EndIndex]] &le; the length of _S_.
             1. Return the substring of _S_ from _match_.[[StartIndex]] to _match_.[[EndIndex]].
           </emu-alg>
         </emu-clause>
@@ -36495,8 +36494,7 @@ <h1>
           <dl class="header">
           </dl>
           <emu-alg>
-            1. Assert: _match_.[[StartIndex]] is a non-negative integer less than or equal to the length of _S_.
-            1. Assert: _match_.[[EndIndex]] is an integer between _match_.[[StartIndex]] and the length of _S_, inclusive.
+            1. Assert: _match_.[[StartIndex]] &le; _match_.[[EndIndex]] &le; the length of _S_.
             1. Return CreateArrayFromList(&laquo; 𝔽(_match_.[[StartIndex]]), 𝔽(_match_.[[EndIndex]]) &raquo;).
           </emu-alg>
         </emu-clause>
@@ -36826,13 +36824,13 @@ <h1>RegExp.prototype [ @@split ] ( _string_, _limit_ )</h1>
           1. Let _A_ be ! ArrayCreate(0).
           1. Let _lengthA_ be 0.
           1. If _limit_ is *undefined*, let _lim_ be 2<sup>32</sup> - 1; else let _lim_ be ℝ(? ToUint32(_limit_)).
-          1. If _lim_ is 0, return _A_.
-          1. Let _size_ be the length of _S_.
-          1. If _size_ is 0, then
+          1. If _lim_ = 0, return _A_.
+          1. If _S_ is the empty String, then
             1. Let _z_ be ? RegExpExec(_splitter_, _S_).
             1. If _z_ is not *null*, return _A_.
             1. Perform ! CreateDataPropertyOrThrow(_A_, *"0"*, _S_).
             1. Return _A_.
+          1. Let _size_ be the length of _S_.
           1. Let _p_ be 0.
           1. Let _q_ be _p_.
           1. Repeat, while _q_ &lt; _size_,