- From: Yvette Hoitink <y.p.hoitink@heritas.nl>
- Date: Thu, 09 Feb 2006 22:31:11 +0100
- To: public-wcag-teamb@w3.org
Hi group, I will not try to write this in an understandable manner yet but focus on mathimatical exactness (I've defined the heading level of H1 as lower than the heading level of H2): For each header H, determine the heading number (X). For each heading level lower than X, determine the last occurrence (L) of that heading that preceedes X. H should be a logical child of L. This algorithm should allow the following case: H1 - H2 - H4 - H2 as long as both the H2s are childs of the H1 and the H4 is a child of H2 and H1. It does not allow H1 - H2 - H2 - H4 where H4 is the heading for a set of related links that are about the whole page (h1) and not the second subsection (h2). Yvette Hoitink Heritas, Alphen aan den Rijn, the Netherlands E-mail: y.p.hoitink@heritas.nl WWW: http://www.heritas.nl
Received on Thursday, 9 February 2006 21:31:30 UTC