/[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.21 by wakaba, Mon Nov 5 11:08:05 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 98  in a tree structure and are used in Web Line 98  in a tree structure and are used in Web
98  <abbr>API</abbr></a>  <abbr>API</abbr></a>
99  <cite class="bibref informative">[<a href="#ref-SAPI">SAPI</a>]</cite>.</p>  <cite class="bibref informative">[<a href="#ref-SAPI">SAPI</a>]</cite>.</p>
100    
101  <div class="issue ed">...</div>  <p>It is so flexible language that a conceptually same pattern
102    can be represented in inifnite numbers of instances of selectors.
103    It might be convinient for e.g. validation of a test result to
104    define a subset of the language, in which no semantically equivalent
105    selectors are contained.</p>
106    
107  <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
108  <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 115  attribute.  However, the algorithm is in
115  <time datetime=2007-09-25>at the time of the writing</time>.    <time datetime=2007-09-25>at the time of the writing</time>.  
116  Note that current Web browser implementations  Note that current Web browser implementations
117  of the <code>selectorText</code> attribute are consistently broken  of the <code>selectorText</code> attribute are consistently broken
118  in not escaping unsafe identifiers.</p>  in not escaping unsafe identifiers and therefore it is not wise
119    to deploy that format for testing.</p>
120    
121  </div>  </div>
122    
# Line 120  in not escaping unsafe identifiers.</p> Line 125  in not escaping unsafe identifiers.</p>
125    
126  <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>,
127  <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>,
128  <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  
129  <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
130  document are to be interpreted as described in  document are to be interpreted as described in
131  <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 152  simple selector in a selector.</p>
152  </div>  </div>
153    
154  <div class="section" id="serializing">  <div class="section" id="serializing">
155  <h2>Serializing Selectors as  <h2>Serializing Selectors in
156  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
157  Representation</h2>  Representation</h2>
158    
# Line 157  to <a href="#algorithm-serialize-a-simpl Line 161  to <a href="#algorithm-serialize-a-simpl
161  selector</a> or <a href="#algorithm-serialize-a-group-of-selectors">serialize  selector</a> or <a href="#algorithm-serialize-a-group-of-selectors">serialize
162  a group of selectors</a>.</p>  a group of selectors</a>.</p>
163    
 <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>  
   
164  <div class="note memo">  <div class="note memo">
165  <p>The serialized representation will not contain any comment.</p>  <p>The serialized representation will not contain any comment.</p>
166  </div>  </div>
167  <!-- TODO: link terms to Selectors -->  
168    <div class="ed issue"><p>TODO: link terms to Selectors</p></div>
169    
170  <div class=section id=serializing-tokens>  <div class=section id=serializing-tokens>
171  <h3>Serializing Tokens</h3>  <h3>Serializing Tokens</h3>
172    
173  <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
174  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>,
175  the following algorithm <em class=rfc2119>MUST</em> be used:</p>  the following algorithm <em class=rfc2119>MUST</em> be used:</p>
176  <ol>  <ol>
177  <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>,
178  characters) in <var>n</var> by characters represented by them  replace the escape sequences (<code>\</code> and following characters) in
179  respectively.</li>  <var>n</var> by characters represented by them respectively.</li>
180    <li>If <var>n</var> is a <code>HASH</code>, remove the leading
181    <code class=char>U+0023</code> <code class=charname>NUMBER SIGN</code>
182    (<code class=char>#</code>) character from <var>n</var>.</li>
183  <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
184  <code class=char>U+002D</code> <code class=charname>HYPHEN-MINUS</code>  <code class=char>U+002D</code> <code class=charname>HYPHEN-MINUS</code>
185  (<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 197  A</code> (<code class=char>A</code>) to
197  <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
198  <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
199  <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
200  <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 upper$B!>(Bcase
201  hexadecimal representation of the character.  If the character  zero$B!>(Bpadded hexadecimal representation of the character.  If the character
202  is outside the range of <code>[<code class=char>U+0000</code>,  is outside the range of <code>[<code class=char>U+0000</code>,
203  <code class=char>U+10FFFF</code>]</code>, <var>HHHHHH</var>  <code class=char>U+10FFFF</code>]</code>, <var>HHHHHH</var>
204  <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 229  character by string <code>\00002D</code>
229  <li>Then, <var>n</var> is the result of the algorithm.</li>  <li>Then, <var>n</var> is the result of the algorithm.</li>
230  </ol>  </ol>
231    
232  <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
233  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>,
234  the following algorithm <em class=rfc2119>MUST</em> be used:</p>  the following algorithm <em class=rfc2119>MUST</em> be used:</p>
235  <ol>  <ol>
236  <li><p>Replace the escape sequences (<code>\</code> and following  <li>If <var>s</var> is either an <code>IDENT</code> or a
237  characters) in <var>s</var> by characters represented by them  <code>STRING</code>, replace the escape sequences (<code>\</code> and
238    following characters) in <var>s</var> by characters represented by them
239  (or an empty string if <code>\</code> is immediately followed by  (or an empty string if <code>\</code> is immediately followed by
240  newline character(s)) respectively.</p></li>  newline character(s)) respectively.</li>
241  <li><p>Remove the quotation characters in <var>s</var>  <li>If <var>s</var> is a <code>STRING</code>, remove the quotation marks
242  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>  
243  <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
244  <code class=char>U+0020</code> <code class=charname>SPACE</code>,  <code class=char>U+0020</code> <code class=charname>SPACE</code>,
245  <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 250  BRACKET</code>, <code class=char>U+005D<
250  SQUARE BRACKET</code> to <code class=char>U+D7FF</code>, or  SQUARE BRACKET</code> to <code class=char>U+D7FF</code>, or
251  <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
252  <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
253  <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 upper$B!>(Bcase
254  hexadecimal representation of the character.  If the character  zero$B!>(Bpadded hexadecimal representation of the character.  If the character
255  is outside the range of <code>[<code class=char>U+0000</code>,  is outside the range of <code>[<code class=char>U+0000</code>,
256  <code class=char>U+10FFFF</code>]</code>, <var>HHHHHH</var>  <code class=char>U+10FFFF</code>]</code>, <var>HHHHHH</var>
257  <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 286  representation.</p>
286  representations are literally compared.</p>  representations are literally compared.</p>
287  </div>  </div>
288    
289    <div class="issue ed">
290    <p>Need to define <dfn id=lower-case>lower$B!>(Bcase</dfn>.
291    It is tr/A-Z/a-z/ for now.</p>
292    </div>
293    
294    <p>To
295    <dfn id=algorithm-normalize-an-integer title="normalize an integer">normalize
296    an integer (<dfn id=var-int-i><var>i</var></dfn>)</dfn>, the following
297    algorithm <em class=rfc2119>MUST</em> be run:</p>
298    <ol class=algorithm>
299    <li>If <var>i</var> is equal to zero (0), return a string with only a
300    character: <code class=char>U+0030</code>
301    <code class=charname>DIGIT ZERO</code> (<code class=char>0</code>).
302    Stop the algorithm.</li>
303    <li>Let <dfn id=var-int-result><var>result</var></dfn> be an empty string.</li>
304    <li>If <var>i</var> is less than zero (0), append a
305    <code class=char>U+002D</code> <code class=charname>HYPHEN-MINUS</code>
306    (<code class=char>-</code>) character to <var>result</var>.</li>
307    <li>Append the decimal representation of the absolute value of
308    <var>i</var> to <var>result</var>.  The decimal (base$B!>(Bten) representation
309    <em class=rfc2119>MUST NOT</em> begin with a <code class=char>U+0030</code>
310    <code class=charname>DIGIT ZERO</code> (<code class=char>0</code>)
311    character.</li>
312    <li>Return <var>result</var>.</li>
313    </ol>
314    
315  </div>  </div>
316    
317    
# Line 309  the following algorithm <em class=rfc211 Line 334  the following algorithm <em class=rfc211
334  <dt>If <var>ss</var> is a type or universal selector</dt>  <dt>If <var>ss</var> is a type or universal selector</dt>
335    <dd>    <dd>
336      <ol>      <ol>
337      <li>      <li>Append a namespace prefix as following:
338    
339        <dl class=switch>        <dl class=switch>
340        <dt>If a namespace URI is specified (via namespace prefix, or        <dt>If a namespace URI is specified (via namespace prefix, or
341        by omitting namespace prefix where a default namespace is specified)</dt>        by omitting namespace prefix where a default namespace is specified)</dt>
342          <dd class="ed">@@</dd>          <dd>Append the namespace URI as a
343            <a href="#algorithm-normalize-an-ident" title="normalize a string as an IDENT">normalized
344            <code>IDENT</code></a> to <var>r</var>.  Then, append a
345            <code class=char>U+007C</code>
346            <code class=charname>VERTICAL BAR</code> (<code class=char>|</code>)
347            character to <var>r</var>.</dd>
348        <dt>If the null namespace is specified (by zero$B!>(Blength namespace        <dt>If the null namespace is specified (by zero$B!>(Blength namespace
349        prefix)</dt>        prefix)</dt>
350          <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 361  the following algorithm <em class=rfc211
361        </dl>        </dl>
362      </li>      </li>
363      <li>If <var>ss</var> is a type selector, append the      <li>If <var>ss</var> is a type selector, append the
364      <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>
365      local name to <var>r</var>.</li>      local name to <var>r</var>.</li>
366      <li>If <var>ss</var> is a universal selector, append      <li>If <var>ss</var> is a universal selector, append
367      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 378  the following algorithm <em class=rfc211
378        Append a namespace prefix as following:        Append a namespace prefix as following:
379        <dl>        <dl>
380        <dt>If a namespace URI is specified</dt>        <dt>If a namespace URI is specified</dt>
381          <dd class=ed>@@</dd>          <dd>Append the namespace URI as a
382          <dd class=ed>@@ Current reference implementation is wrong,          <a href="#algorithm-normalize-an-ident" title="normalize a string as an IDENT">normalized
383          since its result of sorting depends on namespace prefix.</dd>          <code>IDENT</code></a> to <var>r</var>.  Then, append a
384            <code class=char>U+007C</code>
385            <code class=charname>VERTICAL BAR</code> (<code class=char>|</code>)
386            character to <var>r</var>.</dd>
387        <dt>If the null namespace is specified</dt>        <dt>If the null namespace is specified</dt>
388          <dd>Append a <code class=char>U+007C</code>          <dd>Append a <code class=char>U+007C</code>
389          <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 397  the following algorithm <em class=rfc211
397        </dl>        </dl>
398      </li>      </li>
399      <li>Append the      <li>Append the
400      <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>
401      local name to <var>r</var>.</li>      local name to <var>r</var>.</li>
402      <li>If a value is specified in <var>ss</var>:      <li>If a value is specified in <var>ss</var>:
403        <ol>        <ol>
# Line 383  the following algorithm <em class=rfc211 Line 417  the following algorithm <em class=rfc211
417  <dt>If <var>ss</var> is a class selector</dt>  <dt>If <var>ss</var> is a class selector</dt>
418    <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
419    STOP</code> (<code class=char>.</code>) character, followed    STOP</code> (<code class=char>.</code>) character, followed
420    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>
421    class name, to <var>r</var>.</dd>    class name, to <var>r</var>.</dd>
422  <dt>If <var>ss</var> is an <abbr>ID</abbr> selector</dt>  <dt>If <var>ss</var> is an <abbr>ID</abbr> selector</dt>
423    <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
424    SIGN</code> (<code class=char>#</code>) character, followed    SIGN</code> (<code class=char>#</code>) character, followed
425    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>
426    <abbr>ID</abbr>, to <var>r</var>.</dd>    <abbr>ID</abbr>, to <var>r</var>.</dd>
427  <dt>If <var>ss</var> is a pseudo$B!>(Bclass selector</dt>  <dt>If <var>ss</var> is a pseudo$B!>(Bclass selector</dt>
428    <dd>    <dd>
# Line 397  the following algorithm <em class=rfc211 Line 431  the following algorithm <em class=rfc211
431      <code class=charname>COLON</code> (<code class=char>:</code>) character      <code class=charname>COLON</code> (<code class=char>:</code>) character
432      to <var>r</var>.</li>      to <var>r</var>.</li>
433      <li>Append the      <li>Append the
434      <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>
435      name of the pseudo$B!>(Bclass to <var>r</var>.</li>      name (in <a href="#lower-case">lower$B!>(Bcase</a>) of the pseudo$B!>(Bclass to
436        <var>r</var>.</li>
437      <li>Append any arguments as following:      <li>Append any arguments as following:
438        <dl class=switch>        <dl class=switch>
439        <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 443  the following algorithm <em class=rfc211
443            PARENTHESIS</code> (<code class=char>(</code>) character            PARENTHESIS</code> (<code class=char>(</code>) character
444            to <var>r</var>.</li>            to <var>r</var>.</li>
445            <li>Append the            <li>Append the
446            <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>
447            language tag (the argument) to <var>r</var>.</li>            language tag (the argument) to <var>r</var>.
448              <span class="issue ed">Should we normalize cases?</span></li>
449            <li>Append a <code class=char>U+0029</code>            <li>Append a <code class=char>U+0029</code>
450            <code class=charname>RIGHT PARENTHESIS</code>            <code class=charname>RIGHT PARENTHESIS</code>
451            (<code class=char>)</code>) character            (<code class=char>)</code>) character
# Line 440  the following algorithm <em class=rfc211 Line 476  the following algorithm <em class=rfc211
476            <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
477            PARENTHESIS</code> (<code class=char>(</code>) character            PARENTHESIS</code> (<code class=char>(</code>) character
478            to <var>r</var>.</li>            to <var>r</var>.</li>
479            <li>Append <span class=ed>@@ normalized</span>            <li>Let <dfn id=var-a><var>a</var></dfn> be the <var>a</var>
480            integer <var>a</var> to <var>r</var>.            part of the argument.  If the argument is a keyword <code>odd</code>
481            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>.
482            <var>a</var> is <code>2</code>.  If <var>a</var> and            If the <var>a</var> part with following <code>n</code> character
483            <code>n</code> is omitted, <var>a</var> is assumed as            is omitted, then let <var>a</var> be <code>0</code>.
484            <code>0</code>.  Otherwise, if <var>a</var> is omitted,            Otherwise, if only the <var>a</var> part is omitted, then
485            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>
486            if there is a <code class=char>U+002D</code>            part is <code>-</code>, then let <var>a</var> be
487            <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>)            <code>-1</code>.</li>
488            character).</li>            <li>Let <var>a</var> be the
489              <a href="#algorithm-normalize-an-integer" title="normalize an integer">normalized
490              string representation</a> of integer <var>a</var>.</li>
491              <li>Append <var>a</var> to <var>result</var>.</li>
492            <li>Append a <code class=char>U+006E</code>            <li>Append a <code class=char>U+006E</code>
493            <code class=charname>LATIN SMALL LETTER N</code>            <code class=charname>LATIN SMALL LETTER N</code>
494            (<code class=char>n</code>) character to <var>r</var>.</li>            (<code class=char>n</code>) character to <var>r</var>.</li>
495            <li>Append <span class=ed>@@ normalized</span>            <li>Let <dfn id=var-b><var>b</var></dfn> be the <var>b</var>
496            integer <var>b</var> to <var>r</var>.            part of the argument.  If the argument is a keyword <code>odd</code>,
497            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
498            either <code class=char>U+002B</code> <code class=charname>PLUS            keyword <code>even</code>, then let <var>b</var> be <code>0</code>.
499            SIGN</code> (<code class=char>+</code>) or            If the <var>b</var> part is omitted, then let <var>b</var> be
500            <code class=char>U+002D</code>            <code>0</code>.</li>
501              <li>Let <var>b</var> be the
502              <a href="#algorithm-normalize-an-integer" title="normalize an integer">normalized
503              string representation</a> of integer <var>b</var>.</li>
504              <li>If <var>b</var> does <em>not</em> start with a
505              <code class=char>U+002D</code>
506            <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>)            <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>)
507            character.  If the argument is a keyword <code>odd</code>,            character, then append <code class=char>U+002B</code>
508            <var>b</var> is <code>1</code>.  If the argument            <code class=charname>PLUS SIGN</code>
509            is a keyword <code>even</code>, <var>b</var> is            (<code class=char>+</code>) to <var>result</var>.</li>
510            <code>0</code>.  If <var>b</var> is omitted, it is assumed as            <li>Append <var>b</var> to <var>result</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>  
511            <li>Append a <code class=char>U+0029</code>            <li>Append a <code class=char>U+0029</code>
512            <code class=charname>RIGHT PARENTHESIS</code>            <code class=charname>RIGHT PARENTHESIS</code>
513            (<code class=char>)</code>) character            (<code class=char>)</code>) character
# Line 523  the following algorithm <em class=rfc211 Line 563  the following algorithm <em class=rfc211
563      <code class=charname>COLON</code> characters (<code>::</code>)      <code class=charname>COLON</code> characters (<code>::</code>)
564      to <var>r</var>.</li>      to <var>r</var>.</li>
565      <li>Append the      <li>Append the
566      <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>
567      name of the pseudo$B!>(Belement to <var>r</var>.</li>      name (in <a href="#lower-case">lower$B!>(Bcase</a>) of the pseudo$B!>(Belement
568        to <var>r</var>.</li>
569      <li>If the pseudo$B!>(Belement has any arguments:      <li>If the pseudo$B!>(Belement has any arguments:
570          The pseudo$B!>(Belement is not supported by this version of          The pseudo$B!>(Belement is not supported by this version of
571          <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 588  representation of <var>ss</var>.</li>
588  <h3>Serializing Groups of Selectors</h3>  <h3>Serializing Groups of Selectors</h3>
589    
590  <p>No <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>  <p>No <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
591  representation is defined for an invalid group of selectors.</p>  representation is defined for an invalid
592    <a href="http://www.w3.org/TR/css3-selectors/#grouping">group of
593    selectors</a>.</p>
594    
595  <p>To  <p>To
596  <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 602  the following algorithm <em class=rfc211
602  <var>gs</var>:  <var>gs</var>:
603    <ol>    <ol>
604    <li>If <var>selector</var> is <em>not</em> the first selector    <li>If <var>selector</var> is <em>not</em> the first selector
605    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>
606    <code class=charname>COMMA</code> (<code class=char>,</code>) followed by a    <code class=charname>COMMA</code> (<code class=char>,</code>) followed by a
607    <a href="#newline">newline</a> to <var>result</var>.</li>    <a href="#newline">newline</a> to <var>result</var>.</li>
608    <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 614  the following algorithm <em class=rfc211
614      (<dfn id=var-sss><var>sss</var></dfn>)</dt>      (<dfn id=var-sss><var>sss</var></dfn>)</dt>
615        <dd>        <dd>
616          <ol>          <ol>
617          <li class=ed><a href="#algorithm-serialize-a-simple-selector">Serialize          <li>If <var>sss</var> contains a universal or type selector, then
618          each simple selector</a> in <var>sss</var>.</li>          <a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">serialize
619          <li class=ed>sort</li>          that simple selector</a> and append the result to
620            <var>result</var>.</li>
621            <li>Otherwise, i.e. if <var>sss</var> does not contain a universal or
622            type selector, then
623            <a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">serialize
624            a simple selector <code>*</code></a> and append the result to
625            <var>result</var>.</li>
626            <li><a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">Serialize
627            any attribute selectors</a> in <var>sss</var>, sort the results,
628            then append them to <var>result</var> in order.</li>
629            <li><a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">Serialize
630            any class selectors</a> in <var>sss</var>, sort the results,
631            then append them to <var>result</var> in order.</li>
632            <li><a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">Serialize
633            any <abbr>ID</abbr> selectors</a> in <var>sss</var>, sort the results,
634            then append them to <var>result</var> in order.</li>
635            <li><a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">Serialize
636            any pseudo$B!>(Bclass selectors</a> in <var>sss</var>, sort the results,
637            then append them to <var>result</var> in order.</li>
638            <li><a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">Serialize
639            any pseudo elements</a> in <var>sss</var>, sort the results,
640            then append them to <var>result</var> in order.</li>
641          <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>
642          </ol>          </ol>
643        </dd>        </dd>
# Line 626  representation of <var>gs</var>.</li> Line 690  representation of <var>gs</var>.</li>
690  <div class="section" id="parsing">  <div class="section" id="parsing">
691  <h2>Parsing  <h2>Parsing
692  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
693  Groups of Selectors</h2>  Representations of Selectors</h2>
694    
695  <p>Since <a href="#serializing">the serializing algorithm</a> is  <p>Since <a href="#algorithm-serialize-a-group-of-selectors">the serializing
696  so designed that it always output a valid  algorithm for groups of selectors</a> is so designed that it always outputs a
697  <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
698  selectors</a>, no special parser for the  selectors</a>, no special parser for the
699  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
700  representation is necessary.  Any conforming parser for  representation is necessary.  Any conforming parser for
701  <a href="http://www.w3.org/TR/css3-selectors/#grouping">groups of  <a href="http://www.w3.org/TR/css3-selectors/#grouping">groups of
702  selectors</a> <em class=rfc2119>MAY</em> be used  selectors</a> <em class=rfc2119>MAY</em> be used
703  to parse <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>  to parse <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
704  representations of groups of selectors.</p>  representations of
705    <a href="http://www.w3.org/TR/css3-selectors/#grouping">groups of
706    selectors</a>.</p>
707    
708    <p>Likewise, <a href="#algorithm-serialize-a-simple-selector">the serializing
709    algorithm for simple selectors</a> always outputs a valid
710    <a href="#simple-selector">simple selector</a> and therefore any
711    conforming parser for <a href="#simple-selector">simple selector</a>
712    <em class=rfc2119>MAY</em> be used to parse
713    <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
714    representations of <a href="#simple-selector">simple selectors</a>.</p>
715  </div>  </div>
716    
717  <div class="section" id="examples">  <div class="section" id="examples">
# Line 673  by choosing <q>Selectors</q> radio butto Line 747  by choosing <q>Selectors</q> radio butto
747    <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>
748    14</a>, <abbr title="Request for Comments">RFC</abbr> 2119,    14</a>, <abbr title="Request for Comments">RFC</abbr> 2119,
749    <time datetime=1997-03>March 1997</time>.    <time datetime=1997-03>March 1997</time>.
750    This version of the specification is referenced</dd>    This version of the specification is referenced.</dd>
751  <dt id=ref-SELECTORS>SELECTORS</dt>  <dt id=ref-SELECTORS>SELECTORS</dt>
752    <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>,
753    <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 780  by choosing <q>Selectors</q> radio butto
780  <dt id=ref-HTML5>HTML5</dt>  <dt id=ref-HTML5>HTML5</dt>
781    <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>,
782    <abbr title="Web Hypertext Application Technology Working Group">WHATWG</abbr>    <abbr title="Web Hypertext Application Technology Working Group">WHATWG</abbr>
783    Working Draft.  Work in progress.</dd>    Working Draft, <time datetime="2007-11-03">3 November 2007</time>.
784      Work in progress.</dd>
785  <dt id=ref-SAPI>SAPI</dt>  <dt id=ref-SAPI>SAPI</dt>
786    <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>,
787    <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.21
admin@suikawiki.org
 ViewVC Help
Powered by ViewVC 1.1.24