[html5] r3243 - [e] (0) begin collecting references

[whatwg at whatwg.org]

Author: ianh
Date: 2009-06-13 13:08:33 -0700 (Sat, 13 Jun 2009)
New Revision: 3243

Modified:
   index
   source
Log:
[e] (0) begin collecting references

Modified: index
===================================================================
--- index	2009-06-13 06:53:39 UTC (rev 3242)
+++ index	2009-06-13 20:08:33 UTC (rev 3243)
@@ -1639,7 +1639,7 @@
   the set 0x09, 0x0A, 0x0C, 0x0D, 0x20 - 0x22, 0x26, 0x27, 0x2C -
   0x3F, 0x41 - 0x5A, and 0x61 - 0x7A<!-- is that list ok? do any
   character sets we want to support do things outside that range?
-  -->. <!-- XXX #refs RFC1345 ? --></p>
+  -->. <a href=#refsRFC1345>[RFC1345]</a></p>
 
 
   <h4 id=resources><span class=secno>2.1.6 </span>Resources</h4>
@@ -1795,13 +1795,7 @@
     context</a> in which scripts execute, and that the scripts
     never cause non-conforming states to occur other than transiently
     during script execution itself. (This is only a "SHOULD" and not a
-    "MUST" requirement because it has been proven to be impossible. <a href=#refsHALTINGPROBLEM>[HALTINGPROBLEM]</a>)</p> <!-- XXX
-    [Computable] On computable numbers, with an application to the
-    Entscheidungsproblem. Alan M. Turing. In Proceedings of the London
-    Mathematical Society, series 2, volume 42, pages 230-265. London
-    Mathematical Society,
-    1937. http://www.turingarchive.org/browse.php/B/12 (referenced:
-    2007-03-03) -->
+    "MUST" requirement because it has been proven to be impossible. <a href=#refsCOMPUTABLE>[COMPUTABLE]</a>)</p>
 
     <p>The term "HTML5 validator" can be used to refer to a
     conformance checker that itself conforms to the applicable
@@ -2111,8 +2105,7 @@
 
   <p>Comparing two strings in a <dfn id=compatibility-caseless>compatibility caseless</dfn>
   manner means using the Unicode <i>compatibility caseless match</i>
-  operation to compare the two strings. <a href=#refsUNICODECASE>[UNICODECASE]</a></p> <!-- XXX refs to
-  Unicode Standard Annex #21, Case Mappings -->
+  operation to compare the two strings. <a href=#refsUNICODECASE>[UNICODECASE]</a></p>
 
 
   <div class=impl>
@@ -70295,7 +70288,20 @@
 
   <!-- XXX check that #refsRFC([0-9]+) is always for [RFC\1] -->
 
+  <!--
 
+  [COMPUTABLE] On computable numbers, with an application to the
+  Entscheidungsproblem. Alan M. Turing. In Proceedings of the London
+  Mathematical Society, series 2, volume 42, pages 230-265. London
+  Mathematical Society,
+  1937. http://www.turingarchive.org/browse.php/B/12 (referenced:
+  2007-03-03)
+
+  [UNICODECASE] Unicode Standard Annex #21, Case Mappings
+
+  -->
+
+
   <h2 class=no-num id=acknowledgements>Acknowledgements</h2> <!-- ACKS -->
 
   <p>Thanks to

Modified: source
===================================================================
--- source	2009-06-13 06:53:39 UTC (rev 3242)
+++ source	2009-06-13 20:08:33 UTC (rev 3243)
@@ -613,7 +613,7 @@
   the set 0x09, 0x0A, 0x0C, 0x0D, 0x20 - 0x22, 0x26, 0x27, 0x2C -
   0x3F, 0x41 - 0x5A, and 0x61 - 0x7A<!-- is that list ok? do any
   character sets we want to support do things outside that range?
-  -->. <!-- XXX #refs RFC1345 ? --></p>
+  -->. <a href="#refsRFC1345">[RFC1345]</a></p>
 
 
   <h4>Resources</h4>
@@ -776,13 +776,7 @@
     never cause non-conforming states to occur other than transiently
     during script execution itself. (This is only a "SHOULD" and not a
     "MUST" requirement because it has been proven to be impossible. <a
-    href="#refsHALTINGPROBLEM">[HALTINGPROBLEM]</a>)</p> <!-- XXX
-    [Computable] On computable numbers, with an application to the
-    Entscheidungsproblem. Alan M. Turing. In Proceedings of the London
-    Mathematical Society, series 2, volume 42, pages 230-265. London
-    Mathematical Society,
-    1937. http://www.turingarchive.org/browse.php/B/12 (referenced:
-    2007-03-03) -->
+    href="#refsCOMPUTABLE">[COMPUTABLE]</a>)</p>
 
     <p>The term "HTML5 validator" can be used to refer to a
     conformance checker that itself conforms to the applicable
@@ -1113,8 +1107,7 @@
   <p>Comparing two strings in a <dfn>compatibility caseless</dfn>
   manner means using the Unicode <i>compatibility caseless match</i>
   operation to compare the two strings. <a
-  href="#refsUNICODECASE">[UNICODECASE]</a></p> <!-- XXX refs to
-  Unicode Standard Annex #21, Case Mappings -->
+  href="#refsUNICODECASE">[UNICODECASE]</a></p>
 
 
   <div class="impl">
@@ -82899,7 +82892,20 @@
 
   <!-- XXX check that #refsRFC([0-9]+) is always for [RFC\1] -->
 
+  <!--
 
+  [COMPUTABLE] On computable numbers, with an application to the
+  Entscheidungsproblem. Alan M. Turing. In Proceedings of the London
+  Mathematical Society, series 2, volume 42, pages 230-265. London
+  Mathematical Society,
+  1937. http://www.turingarchive.org/browse.php/B/12 (referenced:
+  2007-03-03)
+
+  [UNICODECASE] Unicode Standard Annex #21, Case Mappings
+
+  -->
+
+
   <h2 class="no-num">Acknowledgements</h2> <!-- ACKS -->
 
   <p>Thanks to