/[suikacvs]/markup/selectors/ssft/ssft-work.en.html
Suika

Diff of /markup/selectors/ssft/ssft-work.en.html

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1.16 by wakaba, Mon Oct 22 11:16:27 2007 UTC revision 1.24 by wakaba, Mon Nov 5 11:29:14 2007 UTC
# Line 10  Line 10 
10  <div class="header">  <div class="header">
11  <h1>Selectors Serialization Format for Testing (<abbr>SSFT</abbr>)  <h1>Selectors Serialization Format for Testing (<abbr>SSFT</abbr>)
12  Specification</h1>  Specification</h1>
13  <h2>Working Draft <time datetime=2007-10-22>22 October 2007</time></h2>  <h2>Working Draft <time datetime=2007-11-05>5 November 2007</time></h2>
14    
15  <dl class="versions-uri">  <dl class="versions-uri">
16  <dt>This Version</dt>  <dt>This Version</dt>
# Line 52  available at <code class="URI">&lt;<a Line 52  available at <code class="URI">&lt;<a
52  <div id="abstract" class="section">  <div id="abstract" class="section">
53  <h2>Abstract</h2>  <h2>Abstract</h2>
54    
55  <div class="ed issue">...</div>  <p>This document defines
56    <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>,
57    a subset of Selectors language which is suitable for describing results
58    of Selectors parsing tests.</p>
59    
60  </div>  </div>
61    
# Line 98  in a tree structure and are used in Web Line 101  in a tree structure and are used in Web
101  <abbr>API</abbr></a>  <abbr>API</abbr></a>
102  <cite class="bibref informative">[<a href="#ref-SAPI">SAPI</a>]</cite>.</p>  <cite class="bibref informative">[<a href="#ref-SAPI">SAPI</a>]</cite>.</p>
103    
104  <div class="issue ed">...</div>  <p>It is so flexible language that a conceptually same pattern
105    can be represented in inifnite numbers of instances of selectors.
106    It might be convinient for e.g. validation of a test result to
107    define a subset of the language, in which no semantically equivalent
108    selectors are contained.</p>
109    
110  <p><a href="http://dev.w3.org/cvsweb/csswg/cssom/Overview.html">The  <p><a href="http://dev.w3.org/cvsweb/csswg/cssom/Overview.html">The
111  <abbr title="Cascading Style Sheets Object Model">CSSOM</abbr>  <abbr title="Cascading Style Sheets Object Model">CSSOM</abbr>
# Line 111  attribute.  However, the algorithm is in Line 118  attribute.  However, the algorithm is in
118  <time datetime=2007-09-25>at the time of the writing</time>.    <time datetime=2007-09-25>at the time of the writing</time>.  
119  Note that current Web browser implementations  Note that current Web browser implementations
120  of the <code>selectorText</code> attribute are consistently broken  of the <code>selectorText</code> attribute are consistently broken
121  in not escaping unsafe identifiers.</p>  in not escaping unsafe identifiers and therefore it is not wise
122    to deploy that format for testing.</p>
123    
124  </div>  </div>
125    
# Line 120  in not escaping unsafe identifiers.</p> Line 128  in not escaping unsafe identifiers.</p>
128    
129  <p>The key words <q><dfn id=must><em class="rfc2119">MUST</em></dfn></q>,  <p>The key words <q><dfn id=must><em class="rfc2119">MUST</em></dfn></q>,
130  <q><dfn id=must-not><em class="rfc2119">MUST NOT</em></dfn></q>,  <q><dfn id=must-not><em class="rfc2119">MUST NOT</em></dfn></q>,
131  <q><dfn id=should><em class="rfc2119">SHOULD</em></dfn></q>,  <q><dfn id=should><em class="rfc2119">SHOULD</em></dfn></q>, and
 <q><dfn id=should-not><em class="rfc2119">SHOULD NOT</em></dfn></q>, and  
132  <q><dfn id=may><em class=rfc2119>MAY</em></dfn></q> in this  <q><dfn id=may><em class=rfc2119>MAY</em></dfn></q> in this
133  document are to be interpreted as described in  document are to be interpreted as described in
134  <a href="urn:ietf:rfc:2119"><abbr title="Request for Comments">RFC</abbr>  <a href="urn:ietf:rfc:2119"><abbr title="Request for Comments">RFC</abbr>
# Line 148  simple selector in a selector.</p> Line 155  simple selector in a selector.</p>
155  </div>  </div>
156    
157  <div class="section" id="serializing">  <div class="section" id="serializing">
158  <h2>Serializing Selectors as  <h2>Serializing Selectors in
159  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
160  Representation</h2>  Representation</h2>
161    
# Line 157  to <a href="#algorithm-serialize-a-simpl Line 164  to <a href="#algorithm-serialize-a-simpl
164  selector</a> or <a href="#algorithm-serialize-a-group-of-selectors">serialize  selector</a> or <a href="#algorithm-serialize-a-group-of-selectors">serialize
165  a group of selectors</a>.</p>  a group of selectors</a>.</p>
166    
 <div class="issue ed">  
 <p><a href="http://suika.fam.cx/gate/cvs/*checkout*/markup/html/whatpm/Whatpm/CSS/SelectorsSerializer.pm">See  
 also the reference implementation</a> for now.</p>  
 </div>  
   
167  <div class="note memo">  <div class="note memo">
168  <p>The serialized representation will not contain any comment.</p>  <p>The serialized representation will not contain any comment.</p>
169  </div>  </div>
170  <!-- TODO: link terms to Selectors -->  
171    <div class="ed issue"><p>TODO: link terms to Selectors</p></div>
172    
173  <div class=section id=serializing-tokens>  <div class=section id=serializing-tokens>
174  <h3>Serializing Tokens</h3>  <h3>Serializing Tokens</h3>
175    
176  <p>To <dfn id=algorithm-normalize-an-ident title="normalize an IDENT">normalize  <p>To <dfn id=algorithm-normalize-an-ident title="normalize a string as an IDENT">normalize
177  an <code>IDENT</code> (<dfn id=var-n><var>n</var></dfn>)</dfn>,  a string (<dfn id=var-n><var>n</var></dfn>) as an <code>IDENT</code></dfn>,
178  the following algorithm <em class=rfc2119>MUST</em> be used:</p>  the following algorithm <em class=rfc2119>MUST</em> be used:</p>
179  <ol>  <ol>
180  <li>Replace the escape sequences (<code>\</code> and following  <li>If <var>n</var> is either an <code>IDENT</code> or a <code>HASH</code>,
181  characters) in <var>n</var> by characters represented by them  replace the escape sequences (<code>\</code> and following characters) in
182  respectively.</li>  <var>n</var> by characters represented by them respectively.</li>
183    <li>If <var>n</var> is a <code>HASH</code>, remove the leading
184    <code class=char>U+0023</code> <code class=charname>NUMBER SIGN</code>
185    (<code class=char>#</code>) character from <var>n</var>.</li>
186  <li>If there is any character that is <em>not</em> one of  <li>If there is any character that is <em>not</em> one of
187  <code class=char>U+002D</code> <code class=charname>HYPHEN-MINUS</code>  <code class=char>U+002D</code> <code class=charname>HYPHEN-MINUS</code>
188  (<code class=char>-</code>), <code class=char>U+0030</code>  (<code class=char>-</code>), <code class=char>U+0030</code>
# Line 194  A</code> (<code class=char>A</code>) to Line 200  A</code> (<code class=char>A</code>) to
200  <code class=char>U+0080</code> to <code class=char>U+D7FF</code>, or  <code class=char>U+0080</code> to <code class=char>U+D7FF</code>, or
201  <code class=char>U+E000</code> to <code class=char>U+10FFFF</code> in  <code class=char>U+E000</code> to <code class=char>U+10FFFF</code> in
202  <var>n</var>, then replace it by string <code>\<var>HHHHHH</var></code>, where  <var>n</var>, then replace it by string <code>\<var>HHHHHH</var></code>, where
203  <dfn id=var-HHHHHH><var>HHHHHH</var></dfn> is the upper$B!>(Bcase zero$B!>(Bpadded  <dfn id=var-ident-HHHHHH><var>HHHHHH</var></dfn> is the uppercase
204  hexadecimal representation of the character.  If the character  zero$B!>(Bpadded hexadecimal representation of the character.  If the character
205  is outside the range of <code>[<code class=char>U+0000</code>,  is outside the range of <code>[<code class=char>U+0000</code>,
206  <code class=char>U+10FFFF</code>]</code>, <var>HHHHHH</var>  <code class=char>U+10FFFF</code>]</code>, <var>HHHHHH</var>
207  <em class=rfc2119>MUST</em> be <code>FFFFFF</code>.</li>  <em class=rfc2119>MUST</em> be <code>FFFFFF</code>.</li>
# Line 226  character by string <code>\00002D</code> Line 232  character by string <code>\00002D</code>
232  <li>Then, <var>n</var> is the result of the algorithm.</li>  <li>Then, <var>n</var> is the result of the algorithm.</li>
233  </ol>  </ol>
234    
235  <p>To <dfn id=algorithm-normalize-a-string title="normalize a STRING">normalize  <p>To <dfn id=algorithm-normalize-a-string title="normalize a string (STRING or IDENT) as a STRING">normalize
236  a <code>STRING</code> (<dfn id=var-s><var>s</var></dfn>)</dfn>,  a string (<dfn id=var-s><var>s</var></dfn>) as a <code>STRING</code></dfn>,
237  the following algorithm <em class=rfc2119>MUST</em> be used:</p>  the following algorithm <em class=rfc2119>MUST</em> be used:</p>
238  <ol>  <ol>
239  <li><p>Replace the escape sequences (<code>\</code> and following  <li>If <var>s</var> is either an <code>IDENT</code> or a
240  characters) in <var>s</var> by characters represented by them  <code>STRING</code>, replace the escape sequences (<code>\</code> and
241    following characters) in <var>s</var> by characters represented by them
242  (or an empty string if <code>\</code> is immediately followed by  (or an empty string if <code>\</code> is immediately followed by
243  newline character(s)) respectively.</p></li>  newline character(s)) respectively.</li>
244  <li><p>Remove the quotation characters in <var>s</var>  <li>If <var>s</var> is a <code>STRING</code>, remove the quotation marks
245  if <var>s</var> is a <code>STRING</code>.</p>  enclosing <var>s</var>.</li>
   
 <div class="note memo">  
 <p>The input <var>s</var> to this algorithm may be an  
 <code>IDENT</code>.</p>  
 </div></li>  
246  <li><p>If there is any character that is <em>not</em> one of  <li><p>If there is any character that is <em>not</em> one of
247  <code class=char>U+0020</code> <code class=charname>SPACE</code>,  <code class=char>U+0020</code> <code class=charname>SPACE</code>,
248  <code class=char>U+0021</code> <code class=charname>EXCLAMATION MARK</code>  <code class=char>U+0021</code> <code class=charname>EXCLAMATION MARK</code>
# Line 251  BRACKET</code>, <code class=char>U+005D< Line 253  BRACKET</code>, <code class=char>U+005D<
253  SQUARE BRACKET</code> to <code class=char>U+D7FF</code>, or  SQUARE BRACKET</code> to <code class=char>U+D7FF</code>, or
254  <code class=char>U+E000</code> to <code class=char>U+10FFFF</code> in  <code class=char>U+E000</code> to <code class=char>U+10FFFF</code> in
255  <var>s</var>, then replace it by string <code>\<var>HHHHHH</var></code>, where  <var>s</var>, then replace it by string <code>\<var>HHHHHH</var></code>, where
256  <dfn id=var-HHHHHH><var>HHHHHH</var></dfn> is the upper$B!>(Bcase zero$B!>(Bpadded  <dfn id=var-string-HHHHHH><var>HHHHHH</var></dfn> is the uppercase
257  hexadecimal representation of the character.  If the character  zero$B!>(Bpadded hexadecimal representation of the character.  If the character
258  is outside the range of <code>[<code class=char>U+0000</code>,  is outside the range of <code>[<code class=char>U+0000</code>,
259  <code class=char>U+10FFFF</code>]</code>, <var>HHHHHH</var>  <code class=char>U+10FFFF</code>]</code>, <var>HHHHHH</var>
260  <em class=rfc2119>MUST</em> be <code>FFFFFF</code>.</p></li>  <em class=rfc2119>MUST</em> be <code>FFFFFF</code>.</p></li>
# Line 287  representation.</p> Line 289  representation.</p>
289  representations are literally compared.</p>  representations are literally compared.</p>
290  </div>  </div>
291    
292    <div class="issue ed">
293    <p>In a future version of the specification, we need to define
294    <dfn id=lowercase>lowercase</dfn> (maybe by referencing some version of
295    some module of <abbr>CSS</abbr>).  It is <code>tr/A-Z/a-z/</code> for now.</p>
296    </div>
297    
298    <p>To
299    <dfn id=algorithm-normalize-an-integer title="normalize an integer">normalize
300    an integer (<dfn id=var-int-i><var>i</var></dfn>)</dfn>, the following
301    algorithm <em class=rfc2119>MUST</em> be used:</p>
302    <ol class=algorithm>
303    <li>If <var>i</var> is equal to zero (0), return a string with only a
304    character: <code class=char>U+0030</code>
305    <code class=charname>DIGIT ZERO</code> (<code class=char>0</code>).
306    Stop the algorithm.</li>
307    <li>Let <dfn id=var-int-result><var>result</var></dfn> be an empty string.</li>
308    <li>If <var>i</var> is less than zero (0), append a
309    <code class=char>U+002D</code> <code class=charname>HYPHEN-MINUS</code>
310    (<code class=char>-</code>) character to <var>result</var>.</li>
311    <li>Append the decimal representation of the absolute value of
312    <var>i</var> to <var>result</var>.  The decimal (base$B!>(Bten) representation
313    <em class=rfc2119>MUST NOT</em> begin with a <code class=char>U+0030</code>
314    <code class=charname>DIGIT ZERO</code> (<code class=char>0</code>)
315    character.</li>
316    <li>Return <var>result</var>.</li>
317    </ol>
318    
319  </div>  </div>
320    
321    
# Line 309  the following algorithm <em class=rfc211 Line 338  the following algorithm <em class=rfc211
338  <dt>If <var>ss</var> is a type or universal selector</dt>  <dt>If <var>ss</var> is a type or universal selector</dt>
339    <dd>    <dd>
340      <ol>      <ol>
341      <li>      <li>Append a namespace prefix as following:
342    
343        <dl class=switch>        <dl class=switch>
344        <dt>If a namespace URI is specified (via namespace prefix, or        <dt>If a namespace URI is specified (via namespace prefix, or
345        by omitting namespace prefix where a default namespace is specified)</dt>        by omitting namespace prefix where a default namespace is specified)</dt>
346          <dd class="ed">@@</dd>          <dd>Append the namespace URI as a
347            <a href="#algorithm-normalize-an-ident" title="normalize a string as an IDENT">normalized
348            <code>IDENT</code></a> to <var>r</var>.  Then, append a
349            <code class=char>U+007C</code>
350            <code class=charname>VERTICAL BAR</code> (<code class=char>|</code>)
351            character to <var>r</var>.</dd>
352        <dt>If the null namespace is specified (by zero$B!>(Blength namespace        <dt>If the null namespace is specified (by zero$B!>(Blength namespace
353        prefix)</dt>        prefix)</dt>
354          <dd>Append a <code class=char>U+007C</code>          <dd>Append a <code class=char>U+007C</code>
# Line 330  the following algorithm <em class=rfc211 Line 365  the following algorithm <em class=rfc211
365        </dl>        </dl>
366      </li>      </li>
367      <li>If <var>ss</var> is a type selector, append the      <li>If <var>ss</var> is a type selector, append the
368      <a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a>      <a href="#algorithm-normalize-an-ident" title="normalize a string (IDENT) an IDENT">normalized</a>
369      local name to <var>r</var>.</li>      local name to <var>r</var>.</li>
370      <li>If <var>ss</var> is a universal selector, append      <li>If <var>ss</var> is a universal selector, append
371      a <code class=char>U+002A</code> <code class=charname>ASTERISK</code>      a <code class=char>U+002A</code> <code class=charname>ASTERISK</code>
# Line 347  the following algorithm <em class=rfc211 Line 382  the following algorithm <em class=rfc211
382        Append a namespace prefix as following:        Append a namespace prefix as following:
383        <dl>        <dl>
384        <dt>If a namespace URI is specified</dt>        <dt>If a namespace URI is specified</dt>
385          <dd class=ed>@@</dd>          <dd>Append the namespace URI as a
386          <dd class=ed>@@ Current reference implementation is wrong,          <a href="#algorithm-normalize-an-ident" title="normalize a string as an IDENT">normalized
387          since its result of sorting depends on namespace prefix.</dd>          <code>IDENT</code></a> to <var>r</var>.  Then, append a
388            <code class=char>U+007C</code>
389            <code class=charname>VERTICAL BAR</code> (<code class=char>|</code>)
390            character to <var>r</var>.</dd>
391        <dt>If the null namespace is specified</dt>        <dt>If the null namespace is specified</dt>
392          <dd>Append a <code class=char>U+007C</code>          <dd>Append a <code class=char>U+007C</code>
393          <code class=charname>VERTICAL BAR</code> character to          <code class=charname>VERTICAL BAR</code> character to
# Line 363  the following algorithm <em class=rfc211 Line 401  the following algorithm <em class=rfc211
401        </dl>        </dl>
402      </li>      </li>
403      <li>Append the      <li>Append the
404      <a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a>      <a href="#algorithm-normalize-an-ident" title="normalize a string (IDENT) as an IDENT">normalized</a>
405      local name to <var>r</var>.</li>      local name to <var>r</var>.</li>
406      <li>If a value is specified in <var>ss</var>:      <li>If a value is specified in <var>ss</var>:
407        <ol>        <ol>
# Line 383  the following algorithm <em class=rfc211 Line 421  the following algorithm <em class=rfc211
421  <dt>If <var>ss</var> is a class selector</dt>  <dt>If <var>ss</var> is a class selector</dt>
422    <dd>Append a <code class=char>U+002E</code> <code class=charname>FULL    <dd>Append a <code class=char>U+002E</code> <code class=charname>FULL
423    STOP</code> (<code class=char>.</code>) character, followed    STOP</code> (<code class=char>.</code>) character, followed
424    by <a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a>    by <a href="#algorithm-normalize-an-ident" title="normalize a string (IDENT) as an IDENT">normalized</a>
425    class name, to <var>r</var>.</dd>    class name, to <var>r</var>.</dd>
426  <dt>If <var>ss</var> is an <abbr>ID</abbr> selector</dt>  <dt>If <var>ss</var> is an <abbr>ID</abbr> selector</dt>
427    <dd>Append a <code class=char>U+0023</code> <code class=charname>NUMBER    <dd>Append a <code class=char>U+0023</code> <code class=charname>NUMBER
428    SIGN</code> (<code class=char>#</code>) character, followed    SIGN</code> (<code class=char>#</code>) character, followed
429    by <a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a>    by <a href="#algorithm-normalize-an-ident" title="normalize a string (HASH except for the leading #) as an IDENT">normalized</a>
430    <abbr>ID</abbr>, to <var>r</var>.</dd>    <abbr>ID</abbr>, to <var>r</var>.</dd>
431  <dt>If <var>ss</var> is a pseudo$B!>(Bclass selector</dt>  <dt>If <var>ss</var> is a pseudo$B!>(Bclass selector</dt>
432    <dd>    <dd>
# Line 397  the following algorithm <em class=rfc211 Line 435  the following algorithm <em class=rfc211
435      <code class=charname>COLON</code> (<code class=char>:</code>) character      <code class=charname>COLON</code> (<code class=char>:</code>) character
436      to <var>r</var>.</li>      to <var>r</var>.</li>
437      <li>Append the      <li>Append the
438      <a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a>      <a href="#algorithm-normalize-an-ident" title="normalize a string (IDENT) as an IDENT">normalized</a>
439      name of the pseudo$B!>(Bclass to <var>r</var>.</li>      name (in <a href="#lowercase">lowercase</a>) of the pseudo$B!>(Bclass to
440        <var>r</var>.</li>
441      <li>Append any arguments as following:      <li>Append any arguments as following:
442        <dl class=switch>        <dl class=switch>
443        <dt>If the name of the pseudo$B!>(Bclass is <code>lang</code></dt>        <dt>If the name of the pseudo$B!>(Bclass is <code>lang</code></dt>
# Line 408  the following algorithm <em class=rfc211 Line 447  the following algorithm <em class=rfc211
447            PARENTHESIS</code> (<code class=char>(</code>) character            PARENTHESIS</code> (<code class=char>(</code>) character
448            to <var>r</var>.</li>            to <var>r</var>.</li>
449            <li>Append the            <li>Append the
450            <a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a>            <a href="#algorithm-normalize-an-ident" title="normalize a string (IDENT) as an IDENT">normalized</a>
451            language tag (the argument) to <var>r</var>.</li>            language tag (the argument) to <var>r</var>.
452              <span class="issue ed">Should we normalize cases?</span></li>
453            <li>Append a <code class=char>U+0029</code>            <li>Append a <code class=char>U+0029</code>
454            <code class=charname>RIGHT PARENTHESIS</code>            <code class=charname>RIGHT PARENTHESIS</code>
455            (<code class=char>)</code>) character            (<code class=char>)</code>) character
# Line 440  the following algorithm <em class=rfc211 Line 480  the following algorithm <em class=rfc211
480            <li>Append a <code class=char>U+0028</code> <code class=charname>LEFT            <li>Append a <code class=char>U+0028</code> <code class=charname>LEFT
481            PARENTHESIS</code> (<code class=char>(</code>) character            PARENTHESIS</code> (<code class=char>(</code>) character
482            to <var>r</var>.</li>            to <var>r</var>.</li>
483            <li>Append <span class=ed>@@ normalized</span>            <li>Let <dfn id=var-a><var>a</var></dfn> be the <var>a</var>
484            integer <var>a</var> to <var>r</var>.            part of the argument.  If the argument is a keyword <code>odd</code>
485            If the argument is a keyword <code>odd</code> or <code>even</code>,            or <code>even</code>, then let <var>a</var> be <code>2</code>.
486            <var>a</var> is <code>2</code>.  If <var>a</var> and            If the <var>a</var> part with following <code>n</code> character
487            <code>n</code> is omitted, <var>a</var> is assumed as            is omitted, then let <var>a</var> be <code>0</code>.
488            <code>0</code>.  Otherwise, if <var>a</var> is omitted,            Otherwise, if only the <var>a</var> part is omitted, then
489            it is assumed as <code>1</code> (or <code>-1</code>,            let <var>a</var> be <code>1</code>.  Otherwise, if the <var>a</var>
490            if there is a <code class=char>U+002D</code>            part is <code>-</code>, then let <var>a</var> be
491            <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>)            <code>-1</code>.</li>
492            character).</li>            <li>Let <var>a</var> be the
493              <a href="#algorithm-normalize-an-integer" title="normalize an integer">normalized
494              string representation</a> of integer <var>a</var>.</li>
495              <li>Append <var>a</var> to <var>r</var>.</li>
496            <li>Append a <code class=char>U+006E</code>            <li>Append a <code class=char>U+006E</code>
497            <code class=charname>LATIN SMALL LETTER N</code>            <code class=charname>LATIN SMALL LETTER N</code>
498            (<code class=char>n</code>) character to <var>r</var>.</li>            (<code class=char>n</code>) character to <var>r</var>.</li>
499            <li>Append <span class=ed>@@ normalized</span>            <li>Let <dfn id=var-b><var>b</var></dfn> be the <var>b</var>
500            integer <var>b</var> to <var>r</var>.            part of the argument.  If the argument is a keyword <code>odd</code>,
501            It <em class=rfc2119>MUST</em> be preceded by a sign,            then let <var>b</var> be <code>1</code>.  If the argument is a
502            either <code class=char>U+002B</code> <code class=charname>PLUS            keyword <code>even</code>, then let <var>b</var> be <code>0</code>.
503            SIGN</code> (<code class=char>+</code>) or            If the <var>b</var> part is omitted, then let <var>b</var> be
504            <code class=char>U+002D</code>            <code>0</code>.</li>
505              <li>Let <var>b</var> be the
506              <a href="#algorithm-normalize-an-integer" title="normalize an integer">normalized
507              string representation</a> of integer <var>b</var>.</li>
508              <li>If <var>b</var> does <em>not</em> start with a
509              <code class=char>U+002D</code>
510            <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>)            <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>)
511            character.  If the argument is a keyword <code>odd</code>,            character, then append <code class=char>U+002B</code>
512            <var>b</var> is <code>1</code>.  If the argument            <code class=charname>PLUS SIGN</code>
513            is a keyword <code>even</code>, <var>b</var> is            (<code class=char>+</code>) to <var>r</var>.</li>
514            <code>0</code>.  If <var>b</var> is omitted, it is assumed as            <li>Append <var>b</var> to <var>r</var>.</li>
           <code>0</code>.  The sign of <code>0</code>  
           <em class=rfc2119>MUST</em> be <code class=char>U+002B</code>  
           <code class=charname>PLUS SIGN</code>  
           (<code class=char>+</code>).</li>  
515            <li>Append a <code class=char>U+0029</code>            <li>Append a <code class=char>U+0029</code>
516            <code class=charname>RIGHT PARENTHESIS</code>            <code class=charname>RIGHT PARENTHESIS</code>
517            (<code class=char>)</code>) character            (<code class=char>)</code>) character
# Line 523  the following algorithm <em class=rfc211 Line 567  the following algorithm <em class=rfc211
567      <code class=charname>COLON</code> characters (<code>::</code>)      <code class=charname>COLON</code> characters (<code>::</code>)
568      to <var>r</var>.</li>      to <var>r</var>.</li>
569      <li>Append the      <li>Append the
570      <a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a>      <a href="#algorithm-normalize-an-ident" title="normalize a string (IDENT) as an IDENT">normalized</a>
571      name of the pseudo$B!>(Belement to <var>r</var>.</li>      name (in <a href="#lowercase">lowercase</a>) of the pseudo$B!>(Belement
572        to <var>r</var>.</li>
573      <li>If the pseudo$B!>(Belement has any arguments:      <li>If the pseudo$B!>(Belement has any arguments:
574          The pseudo$B!>(Belement is not supported by this version of          The pseudo$B!>(Belement is not supported by this version of
575          <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>          <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
# Line 547  representation of <var>ss</var>.</li> Line 592  representation of <var>ss</var>.</li>
592  <h3>Serializing Groups of Selectors</h3>  <h3>Serializing Groups of Selectors</h3>
593    
594  <p>No <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>  <p>No <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
595  representation is defined for an invalid group of selectors.</p>  representation is defined for an invalid
596    <a href="http://www.w3.org/TR/css3-selectors/#grouping">group of
597    selectors</a>.</p>
598    
599  <p>To  <p>To
600  <dfn id=algorithm-serialize-a-group-of-selectors title="serialize a group of selectors">serialize  <dfn id=algorithm-serialize-a-group-of-selectors title="serialize a group of selectors">serialize
# Line 559  the following algorithm <em class=rfc211 Line 606  the following algorithm <em class=rfc211
606  <var>gs</var>:  <var>gs</var>:
607    <ol>    <ol>
608    <li>If <var>selector</var> is <em>not</em> the first selector    <li>If <var>selector</var> is <em>not</em> the first selector
609    in the group of selectors, then append a <code class=char>U+002C</code>    in the <var>gs</var>, then append a <code class=char>U+002C</code>
610    <code class=charname>COMMA</code> (<code class=char>,</code>) followed by a    <code class=charname>COMMA</code> (<code class=char>,</code>) followed by a
611    <a href="#newline">newline</a> to <var>result</var>.</li>    <a href="#newline">newline</a> to <var>result</var>.</li>
612    <li>Append four <code class=char>U+0020</code>    <li>Append four <code class=char>U+0020</code>
# Line 571  the following algorithm <em class=rfc211 Line 618  the following algorithm <em class=rfc211
618      (<dfn id=var-sss><var>sss</var></dfn>)</dt>      (<dfn id=var-sss><var>sss</var></dfn>)</dt>
619        <dd>        <dd>
620          <ol>          <ol>
621          <li class=ed><a href="#algorithm-serialize-a-simple-selector">Serialize          <li>If <var>sss</var> contains a universal or type selector, then
622          each simple selector</a> in <var>sss</var>.</li>          <a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">serialize
623          <li class=ed>sort</li>          that simple selector</a> and append the result to
624            <var>result</var>.</li>
625            <li>Otherwise, i.e. if <var>sss</var> does not contain a universal or
626            type selector, then
627            <a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">serialize
628            a simple selector <code>*</code></a> and append the result to
629            <var>result</var>.</li>
630            <li><a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">Serialize
631            any attribute selectors</a> in <var>sss</var>, sort the results,
632            then append them to <var>result</var> in order.</li>
633            <li><a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">Serialize
634            any class selectors</a> in <var>sss</var>, sort the results,
635            then append them to <var>result</var> in order.</li>
636            <li><a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">Serialize
637            any <abbr>ID</abbr> selectors</a> in <var>sss</var>, sort the results,
638            then append them to <var>result</var> in order.</li>
639            <li><a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">Serialize
640            any pseudo$B!>(Bclass selectors</a> in <var>sss</var>, sort the results,
641            then append them to <var>result</var> in order.</li>
642            <li><a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">Serialize
643            any pseudo elements</a> in <var>sss</var>, sort the results,
644            then append them to <var>result</var> in order.</li>
645          <li>Append a <a href="#newline">newline</a> to <var>result</var>.</li>          <li>Append a <a href="#newline">newline</a> to <var>result</var>.</li>
646          </ol>          </ol>
647        </dd>        </dd>
# Line 626  representation of <var>gs</var>.</li> Line 694  representation of <var>gs</var>.</li>
694  <div class="section" id="parsing">  <div class="section" id="parsing">
695  <h2>Parsing  <h2>Parsing
696  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
697  Groups of Selectors</h2>  Representations of Selectors</h2>
698    
699  <p>Since <a href="#serializing">the serializing algorithm</a> is  <p>Since <a href="#algorithm-serialize-a-group-of-selectors">the serializing
700  so designed that it always output a valid  algorithm for groups of selectors</a> is so designed that it always outputs a
701  <a href="http://www.w3.org/TR/css3-selectors/#grouping">group of  valid <a href="http://www.w3.org/TR/css3-selectors/#grouping">group of
702  selectors</a>, no special parser for the  selectors</a>, no special parser for the
703  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
704  representation is necessary.  Any conforming parser for  representation is necessary.  Any conforming parser for
705  <a href="http://www.w3.org/TR/css3-selectors/#grouping">groups of  <a href="http://www.w3.org/TR/css3-selectors/#grouping">groups of
706  selectors</a> <em class=rfc2119>MAY</em> be used  selectors</a> <em class=rfc2119>MAY</em> be used
707  to parse <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>  to parse <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
708  representations of groups of selectors.</p>  representations of
709    <a href="http://www.w3.org/TR/css3-selectors/#grouping">groups of
710    selectors</a>.</p>
711    
712    <p>Likewise, <a href="#algorithm-serialize-a-simple-selector">the serializing
713    algorithm for simple selectors</a> always outputs a valid
714    <a href="#simple-selector">simple selector</a> and therefore any
715    conforming parser for <a href="#simple-selector">simple selector</a>
716    <em class=rfc2119>MAY</em> be used to parse
717    <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
718    representations of <a href="#simple-selector">simple selectors</a>.</p>
719  </div>  </div>
720    
721  <div class="section" id="examples">  <div class="section" id="examples">
# Line 645  representations of groups of selectors.< Line 723  representations of groups of selectors.<
723    
724  <p class=section-info>This section is <em>non$B!>(Bnormative</em>.</p>  <p class=section-info>This section is <em>non$B!>(Bnormative</em>.</p>
725    
 <div class="ed issue">  
 <p><a href="http://suika.fam.cx/gate/2007/css/parser-interface">Try demo</a>,  
 by choosing <q>Selectors</q> radio button.</p>  
   
726  <div class="example figure block">  <div class="example figure block">
727  <div class="caption">...</div>  <p>The <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
728    representation of a selector <code>p + q</code> is:</p>
729    
730  <pre><code>...</code></pre>  <pre><code>    *|p
731      + *|q
732    </code></pre>
733  </div>  </div>
734    
735    <div class="example figure block">
736    <p>The <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
737    representation of a selector <code>a#id.class1:n\ot(:Active)/*
738     comment
739    */.class2</code> is:</p>
740    
741    <pre><code>    *|a.class1.class2#id:not(
742            :active
743        )
744    </code></pre>
745    </div>
746    
747    <div class="example figure block">
748    <p>The <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
749    representation of a
750    <a href="http://www.w3.org/TR/css3-selectors/#grouping">group of selectors</a>
751    <code>a, #b, C[d^=e], .\31 23</code> is:</p>
752    
753    <pre><code>    *|a
754    ,
755        *|*#b
756    ,
757        *|C[|d^="e"]
758    ,
759        *|*.\00003123
760    </code></pre>
761  </div>  </div>
762    
763  </div>  </div>
# Line 673  by choosing <q>Selectors</q> radio butto Line 776  by choosing <q>Selectors</q> radio butto
776    <a href="urn:ietf:bcp:14"><abbr title="Best Current Practice">BCP</abbr>    <a href="urn:ietf:bcp:14"><abbr title="Best Current Practice">BCP</abbr>
777    14</a>, <abbr title="Request for Comments">RFC</abbr> 2119,    14</a>, <abbr title="Request for Comments">RFC</abbr> 2119,
778    <time datetime=1997-03>March 1997</time>.    <time datetime=1997-03>March 1997</time>.
779    This version of the specification is referenced</dd>    This version of the specification is referenced.</dd>
780  <dt id=ref-SELECTORS>SELECTORS</dt>  <dt id=ref-SELECTORS>SELECTORS</dt>
781    <dd><a href="http://www.w3.org/TR/2005/WD-css3-selectors-20051215"><cite>Selectors</cite></a>,    <dd><a href="http://www.w3.org/TR/2005/WD-css3-selectors-20051215"><cite>Selectors</cite></a>,
782    <abbr title="World Wide Web Consortium">W3C</abbr> Working Draft,    <abbr title="World Wide Web Consortium">W3C</abbr> Working Draft,
# Line 706  by choosing <q>Selectors</q> radio butto Line 809  by choosing <q>Selectors</q> radio butto
809  <dt id=ref-HTML5>HTML5</dt>  <dt id=ref-HTML5>HTML5</dt>
810    <dd><cite><a href="http://whatwg.org/html5"><abbr>HTML</abbr> 5</a></cite>,    <dd><cite><a href="http://whatwg.org/html5"><abbr>HTML</abbr> 5</a></cite>,
811    <abbr title="Web Hypertext Application Technology Working Group">WHATWG</abbr>    <abbr title="Web Hypertext Application Technology Working Group">WHATWG</abbr>
812    Working Draft.  Work in progress.</dd>    Working Draft, <time datetime="2007-11-03">3 November 2007</time>.
813      Work in progress.</dd>
814  <dt id=ref-SAPI>SAPI</dt>  <dt id=ref-SAPI>SAPI</dt>
815    <dd><cite><a href="http://dev.w3.org/cvsweb/~checkout~/2006/webapi/selectors-api/Overview.html?rev=1.28&amp;content-type=text/html;%20charset=utf-8">Selectors <abbr>API</abbr></a></cite>,    <dd><cite><a href="http://dev.w3.org/cvsweb/~checkout~/2006/webapi/selectors-api/Overview.html?rev=1.28&amp;content-type=text/html;%20charset=utf-8">Selectors <abbr>API</abbr></a></cite>,
816    <abbr title="World Wide Web Consortium">W3C</abbr> Editor's Draft,    <abbr title="World Wide Web Consortium">W3C</abbr> Editor's Draft,
Legend:
Removed from v.1.16  
changed lines
  Added in v.1.24
admin@suikawiki.org
 ViewVC Help
Powered by ViewVC 1.1.24