In editor's draft, 2011-08-29, Common infrastructure / Common microsyntaxes / Common parser idioms, the algorithm "to strictly split a string on a particular delimiter character" is incorrectly described.  As described, it creates an infinite loop at the first delimiter.

This is based on an interpretation that the call in step 4.1 to the algorithm to "Collect a sequence of characters", specifically step 3 of that algorithm, returns with position at the next location after the last character collected, i.e. pointing at a delimiter if one was encountered.

Suggested resolution:

Add a step 4.3 to advance position, so that step 4 reads:

  4. While position is not past the end of input:
      1. Collect a sequence of characters that are not the delimiter character.
      2. Add the string collected in the previous step to tokens.
      3. Advance position to the next character in input.
           [italicize "position" and "input"]