Bugzilla – Bug 188
Clarify that non-automated conformance checkers could exist and that scripts can cause non-conforming states to occur while they execute.
Last modified: 2008-05-22 14:28:14 CEST
Index: source =================================================================== --- source (revision 1645) +++ source (revision 1646) @@ -316,12 +316,13 @@ <p>Conformance checkers must verify that a document conforms to the applicable conformance criteria described in this - specification. Conformance checkers are exempt from detecting - errors that require interpretation of the author's intent (for - example, while a document is non-conforming if the content of a - <code>blockquote</code> element is not a quote, conformance - checkers do not have to check that <code>blockquote</code> - elements only contain quoted material).</p> + specification. Automated conformance checkers are exempt from + detecting errors that require interpretation of the author's + intent (for example, while a document is non-conforming if the + content of a <code>blockquote</code> element is not a quote, + conformance checkers running without the input of human judgement + do not have to check that <code>blockquote</code> elements only + contain quoted material).</p> <p>Conformance checkers must check that the input document conforms when parsed without a <span>browsing context</span> @@ -329,9 +330,9 @@ <span>scripting flag</span> is disabled), and should also check that the input document conforms when parsed with a <span>browsing context</span> in which scripts execute, and that the scripts - never cause non-conforming states to occur. (This is only a - "SHOULD" and not a "MUST" requirement because it has been proven - to be impossible. <a + 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