Little algorithm clarification
authorMarkus Lanthaler <>
Sun, 11 Aug 2013 23:31:01 +0200
changeset 1862 2f45aa256b76
parent 1861 43d976915f22
child 1863 0e040d150f96
Little algorithm clarification

as suggested by @dlongley. I hope this is better!?
--- a/spec/latest/json-ld-api/index.html	Sun Aug 11 23:19:17 2013 +0200
+++ b/spec/latest/json-ld-api/index.html	Sun Aug 11 23:31:01 2013 +0200
@@ -3512,7 +3512,7 @@
                   of <i>usage</i>.</li>
                 <li>Initialize two empty <tref title="array">arrays</tref> <i>list</i>
                   and <i>list nodes</i>.</li>
-                <li id="find-list-head">If <i>property</i> equals <code>rdf:rest</code>, the value
+                <li>While <i>property</i> equals <code>rdf:rest</code>, the value
                   associated to the <code>usages</code> member of <i>node</i> has
                   exactly 1 entry, <i>node</i> has a <code>rdf:first</code> and
                   <code>rdf:rest</code> property, both of which have as value an
@@ -3520,7 +3520,8 @@
                   has no other members apart from an optional <code>@type</code>
                   member whose value is an array with a single item equal to
                   <code>rdf:List</code>, <i>node</i> represents a well-formed list
-                  node. Continue with the following steps:
+                  node. Perform the following steps to traverse the list backwards
+                  towards its head:
                   <ol class="algorithm">
                     <li>Append the only item of <code>rdf:first</code> member of
                       <i>node</i> to the <i>list</i> <tref>array</tref>.</li>
@@ -3533,10 +3534,9 @@
                       <code>property</code> member of <i>node usage</i>, and
                       <i>head</i> to the value of the <code>value</code> member
                       of <i>node usage</i>.</li>
-                    <li>If the <code>@id</code> member of <i>node</i> is a
-                      <tref>blank node identifier</tref>, continue to look for
-                      the head of the list by jumping to
-                      <a href="#find-list-head">step 4.3.3</a>.</li>
+                    <li>If the <code>@id</code> member of <i>node</i> is an
+                      <tref>IRI</tref> instead of a <tref>blank node identifier</tref>,
+                      exit the while loop.</li>
                 <li>If <i>property</i> equals <code>rdf:first</code>, i.e., the