- From: <bugzilla@wiggum.w3.org>
- Date: Fri, 29 Sep 2006 10:36:36 +0000
- To: public-qt-comments@w3.org
- CC:
http://www.w3.org/Bugs/Public/show_bug.cgi?id=2441 ------- Comment #20 from davidc@nag.co.uk 2006-09-29 10:36 ------- (In reply to comment #18) > Given these descriptions, one possible algorithm, for example, is to process a > string > by first applying all entity ref replacements, and then all the character > reference replacements on the resulting string. Which is what at least > one processors I tried appears to do. The spec does not explictly say that algorithm is not used, but it can not list all possible non-used algorithm. if such double parsing were to be used the string "&" would, like the string "&" be a syntax error (unterminated reference, element content of <a/> would generate an element node, etc. There is no way that the spec can be interepreted in that way. David
Received on Friday, 29 September 2006 10:36:38 UTC