W3C home > Mailing lists > Public > public-html@w3.org > July 2007

Re: Foster parenting characters (detailed review of parsing algorithm)

From: Henri Sivonen <hsivonen@iki.fi>
Date: Tue, 10 Jul 2007 21:47:49 +0300
Message-Id: <EFDC5142-B2E6-4D0F-B4B4-ED9FD03CC136@iki.fi>
To: "public-html@w3.org WG" <public-html@w3.org>

On Jul 10, 2007, at 21:35, Henri Sivonen wrote:

> Since space characters are unconditionally not foster parented

A possible solution:

Perhaps text node coalescing needs to be handled by making the  
buffering of character tokens and explicit part of the tree  
construction algorithm. This isn't a big deal in practice for  
implementations that promise coalesced text nodes anyway.

Whether the buffer should be flushed upon a non-character token or  
upon tree mutation (i.e. the token was not ignored) would need  
research. Either way, the buffer could be checked for non-space  
character content upon flush.

-- 
Henri Sivonen
hsivonen@iki.fi
http://hsivonen.iki.fi/
Received on Tuesday, 10 July 2007 18:48:01 UTC

This archive was generated by hypermail 2.3.1 : Monday, 29 September 2014 09:38:46 UTC