/[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.12 by wakaba, Mon Oct 22 10:38:19 2007 UTC revision 1.19 by wakaba, Mon Nov 5 10:59:48 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 128  document are to be interpreted as descri Line 133  document are to be interpreted as descri
133  2119</a>  2119</a>
134  <cite class="bibref normative">[<a href="#ref-KEYWORDS">KEYWORDS</a>]</cite>.</p>  <cite class="bibref normative">[<a href="#ref-KEYWORDS">KEYWORDS</a>]</cite>.</p>
135    
136    <p>Requirements phrased in the imperative as part of algorithms are to be
137    interpreted with the meaning of the key word (<em class=rfc2119>MUST</em>)
138    used in introducing the algorithm.</p>
139    
140    <p>Conformance requirements phrased as algorithms or specific steps
141    <em class=rfc2119>MAY</em> be implemented in any manner, so long as the end
142    result is equivalent.</p>
143    
144  <!-- Strictly speaking the paragraph below is not part of terminology. -->  <!-- Strictly speaking the paragraph below is not part of terminology. -->
145  <p>All examples and notes in this specification are non$B!>(Bnormative,  <p>All examples and notes in this specification are non$B!>(Bnormative,
146  as are all sections explicitly marked non$B!>(Bnormative.  Everything  as are all sections explicitly marked non$B!>(Bnormative.  Everything
# Line 140  simple selector in a selector.</p> Line 153  simple selector in a selector.</p>
153  </div>  </div>
154    
155  <div class="section" id="serializing">  <div class="section" id="serializing">
156  <h2>Serializing in  <h2>Serializing Selectors in
157  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
158  Representation</h2>  Representation</h2>
159    
160  <div class="issue ed">  <p>Subsections of this section define algorithms
161  <p><a href="http://suika.fam.cx/gate/cvs/*checkout*/markup/html/whatpm/Whatpm/CSS/SelectorsSerializer.pm">See the reference implementation</a>  to <a href="#algorithm-serialize-a-simple-selector">serialize a simple
162  for now.</p>  selector</a> or <a href="#algorithm-serialize-a-group-of-selectors">serialize
163    a group of selectors</a>.</p>
164    
165    <div class="note memo">
166    <p>The serialized representation will not contain any comment.</p>
167  </div>  </div>
168    
169  <div class=section id=serializing-groups-of-selectors>  <div class="ed issue"><p>TODO: link terms to Selectors</p></div>
 <h3>Serializing Groups of Selectors</h3>  
170    
171  <p>No <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>  <div class=section id=serializing-tokens>
172  representation is defined for an invalid group of selectors.</p>  <h3>Serializing Tokens</h3>
173    
174    <p>To <dfn id=algorithm-normalize-an-ident title="normalize a string as an IDENT">normalize
175    a string (<dfn id=var-n><var>n</var></dfn>) as an <code>IDENT</code></dfn>,
176    the following algorithm <em class=rfc2119>MUST</em> be used:</p>
177    <ol>
178    <li>If <var>n</var> is either an <code>IDENT</code> or a <code>HASH</code>,
179    replace the escape sequences (<code>\</code> and following characters) in
180    <var>n</var> by characters represented by them respectively.</li>
181    <li>If <var>n</var> is a <code>HASH</code>, remove the leading
182    <code class=char>U+0023</code> <code class=charname>NUMBER SIGN</code>
183    (<code class=char>#</code>) character from <var>n</var>.</li>
184    <li>If there is any character that is <em>not</em> one of
185    <code class=char>U+002D</code> <code class=charname>HYPHEN-MINUS</code>
186    (<code class=char>-</code>), <code class=char>U+0030</code>
187    <code class=charname>DIGIT ZERO</code>
188    (<code class=char>0</code>) to <code class=char>U+0039</code>
189    <code class=charname>DIGIT NINE</code> (<code class=char>9</code>),
190    <code class=char>U+0041</code> <code class=charname>LATIN CAPITAL LETTER
191    A</code> (<code class=char>A</code>) to <code class=char>U+005A</code>
192    <code class=charname>LATIN CAPITAL LETTER Z</code> (<code class=char>Z</code>),
193    <code class=char>U+005F</code> <code class=charname>LOW LINE</code>
194    (<code class=char>_</code>), <code class=char>U+0061</code>
195    <code class=charname>LATIN SMALL LETTER A</code>
196    (<code class=char>a</code>) to <code class=char>U+006A</code>
197    <code class=charname>LATIN SMALL LETTER Z</code> (<code class=char>z</code>),
198    <code class=char>U+0080</code> to <code class=char>U+D7FF</code>, or
199    <code class=char>U+E000</code> to <code class=char>U+10FFFF</code> in
200    <var>n</var>, then replace it by string <code>\<var>HHHHHH</var></code>, where
201    <dfn id=var-HHHHHH><var>HHHHHH</var></dfn> is the upper$B!>(Bcase zero$B!>(Bpadded
202    hexadecimal representation of the character.  If the character
203    is outside the range of <code>[<code class=char>U+0000</code>,
204    <code class=char>U+10FFFF</code>]</code>, <var>HHHHHH</var>
205    <em class=rfc2119>MUST</em> be <code>FFFFFF</code>.</li>
206    <li>If the first character in <var>n</var> is one of
207    <code class=char>U+0030</code> <code class=charname>DIGIT ZERO</code>
208    (<code class=char>0</code>) to <code class=char>U+0039</code>
209    <code class=charname>DIGIT NINE</code> (<code class=char>9</code>),
210    then prepend a string <code>\00003</code> at the beginning of
211    <var>n</var>.</li>
212    <li>If the first character in <var>n</var> is <code class=char>U+002D</code>
213    <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>) and
214    the second character, if any, is <em>not</em> one of
215    <code class=char>U+0041</code> <code class=charname>LATIN CAPITAL LETTER
216    A</code> (<code class=char>A</code>) to <code class=char>U+005A</code>
217    <code class=charname>LATIN CAPITAL LETTER Z</code> (<code class=char>Z</code>),
218    <code class=char>U+005F</code> <code class=charname>LOW LINE</code>
219    (<code class=char>_</code>), <code class=char>U+0061</code>
220    <code class=charname>LATIN SMALL LETTER A</code>
221    (<code class=char>a</code>) to <code class=char>U+006A</code>
222    <code class=charname>LATIN SMALL LETTER Z</code> (<code class=char>z</code>),
223    <code>U+0080</code> to <code>U+D7FF</code>, or
224    <code>U+E000</code> to <code>U+10FFFF</code>, or
225    <var>n</var> is equal to <code class=char>U+002D</code>
226    <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>), then
227    replace the <code class=char>U+002D</code>
228    <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>)
229    character by string <code>\00002D</code>.</li>
230    <li>Then, <var>n</var> is the result of the algorithm.</li>
231    </ol>
232    
233    <p>To <dfn id=algorithm-normalize-a-string title="normalize a string (STRING or IDENT) as a STRING">normalize
234    a string (<dfn id=var-s><var>s</var></dfn>) as a <code>STRING</code></dfn>,
235    the following algorithm <em class=rfc2119>MUST</em> be used:</p>
236    <ol>
237    <li>If <var>s</var> is either an <code>IDENT</code> or a
238    <code>STRING</code>, replace the escape sequences (<code>\</code> and
239    following characters) in <var>s</var> by characters represented by them
240    (or an empty string if <code>\</code> is immediately followed by
241    newline character(s)) respectively.</li>
242    <li>If <var>s</var> is a <code>STRING</code>, remove the quotation marks
243    enclosing <var>s</var>.</li>
244    <li><p>If there is any character that is <em>not</em> one of
245    <code class=char>U+0020</code> <code class=charname>SPACE</code>,
246    <code class=char>U+0021</code> <code class=charname>EXCLAMATION MARK</code>
247    (<code class=char>!</code>), <code class=char>U+0023</code>
248    <code class=charname>NUMBER SIGN</code> (<code class=char>#</code>) to
249    <code class=char>U+005B</code> <code class=charname>LEFT SQUARE
250    BRACKET</code>, <code class=char>U+005D</code> <code class=charname>RIGHT
251    SQUARE BRACKET</code> to <code class=char>U+D7FF</code>, or
252    <code class=char>U+E000</code> to <code class=char>U+10FFFF</code> in
253    <var>s</var>, then replace it by string <code>\<var>HHHHHH</var></code>, where
254    <dfn id=var-HHHHHH><var>HHHHHH</var></dfn> is the upper$B!>(Bcase zero$B!>(Bpadded
255    hexadecimal representation of the character.  If the character
256    is outside the range of <code>[<code class=char>U+0000</code>,
257    <code class=char>U+10FFFF</code>]</code>, <var>HHHHHH</var>
258    <em class=rfc2119>MUST</em> be <code>FFFFFF</code>.</p></li>
259    <li><p>Insert a <code class=char>U+0022</code> <code class=charname>QUOTATION
260    MARK</code> (<code class=char>"</code>) at the beginning of
261    <var>s</var>.</p></li>
262    <li><p>Insert a <code class=char>U+0022</code> <code class=charname>QUOTATION
263    MARK</code> (<code class=char>"</code>) at the end of <var>s</var>.</p></li>
264    <li><p>Then, <var>s</var> is the result of the algorithm.</p></li>
265    </ol>
266    
267    <p>A <dfn id=newline title=newline>newline</dfn>
268    <em class=rfc2119>SHOULD</em> be represented as a
269    <code class=char>U+000A</code> <code class=charname>LINE FEED</code>
270    character.  However, depending on the context where
271    the <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
272    representation is in use, a sequence of
273    <code class=char>U+000D</code> <code class=charname>CARRIAGE RETURN</code>
274    followed by a <code class=char>U+000A</code>
275    <code class=charname>LINE FEED</code> (i.e. a
276    <code>CRLF</code> sequence) or a character
277    <code class=char>U+000D</code> <code class=charname>CARRIAGE RETURN</code>
278    <em class=rfc2119>MAY</em> be used as a <a href="#newline">newline</a> instead.
279    <a href="#newline">Newline</a> representations
280    <em class=rfc2119>SHOULD</em> be consistent in an
281    <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
282    representation.</p>
283    
284  <div class="note memo">  <div class="note memo">
285  <p>The serialized representation will not contain any comment.</p>  <p>Therefore, newlines must be normalized before
286    <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
287    representations are literally compared.</p>
288  </div>  </div>
289    
290  <!-- TODO: link terms to Selectors -->  <div class="issue ed">
291    <p>Need to define <dfn id=lower-case>lower$B!>(Bcase</dfn>.
292    It is tr/A-Z/a-z/ for now.</p>
293    </div>
294    
295  <p>To  <p>To
296  <dfn id=algorithm-serialize-a-group-of-selectors title="serialize a group of selectors">serialize  <dfn id=algorithm-normalize-an-integer title="normalize an integer">normalize
297  a group of selectors (<dfn id=var-gs><var>gs</var></dfn>)</dfn>:</p>  an integer (<dfn id=var-int-i><var>i</var></dfn>)</dfn>, the following
298  <ol>  algorithm <em class=rfc2119>MUST</em> be run:</p>
299  <li>Let <dfn id=var-result><var>result</var></dfn> an empty string.</li>  <ol class=algorithm>
300  <li>For each selector (<dfn id=var-selector><var>selector</var></dfn>) in  <li>If <var>i</var> is equal to zero (0), return a string with only a
301  <var>gs</var>:  character: <code class=char>U+0030</code>
302    <ol>  <code class=charname>DIGIT ZERO</code> (<code class=char>0</code>).
303    <li>If <var>selector</var> is <em>not</em> the first selector  Stop the algorithm.</li>
304    in the group of selectors, then append a <code class=char>U+002C</code>  <li>Let <dfn id=var-int-result><var>result</var></dfn> be an empty string.</li>
305    <code class=charname>COMMA</code> (<code class=char>,</code>) followed by a  <li>If <var>i</var> is less than zero (0), append a
306    <a href="#newline">newline</a> to <var>result</var>.</li>  <code class=char>U+002D</code> <code class=charname>HYPHEN-MINUS</code>
307    <li>Append four <code class=char>U+0020</code>  (<code class=char>-</code>) character to <var>result</var>.</li>
308    <code class=charname>SPACE</code> characters to <var>result</var>.</li>  <li>Append the decimal representation of the absolute value of
309    <li>Process each sequence of simple selectors or  <var>i</var> to <var>result</var>.  The decimal (base$B!>(Bten) representation
310    combinator in <var>selector</var> by following algorithm:  <em class=rfc2119>MUST NOT</em> begin with a <code class=char>U+0030</code>
311      <dl class=switch>  <code class=charname>DIGIT ZERO</code> (<code class=char>0</code>)
312      <dt>If it is a sequence of simle selector  character.</li>
313      (<dfn id=var-sss><var>sss</var></dfn>)</dt>  <li>Return <var>result</var>.</li>
       <dd>  
         <ol>  
         <li class=ed><a href="#algorithm-serialize-a-simple-selector">Serialize  
         each simple selector</a> in <var>sss</var>.</li>  
         <li class=ed>sort</li>  
         <li>Append a <a href="#newline">newline</a> to <var>result</var>.</li>  
         </ol>  
       </dd>  
     <dt>If it is a combinator (<dfn id=var-c><var>c</var></dfn>)</dt>  
       <dd>  
         <ol>  
         <li>Append two <code class=char>U+0020</code>  
         <code class=charname>SPACE</code> characters to <var>result</var>.</li>  
         <li>  
           <dl class=switch>  
           <dt>If <var>c</var> is descendant combinator (white space)</dt>  
             <dd>Append a <code class=char>U+0020</code>  
             <code class=charname>SPACE</code> character to  
             <var>result</var>.</dd>  
           <dt>If <var>c</var> is child combinator  
           (<code class=char>></code>)</dt>  
             <dd>Append a <code class=char>U+003E</code>  
             <code class=charname>GREATER-THAN SIGN</code>  
             (<code class=char>></code>) character to <var>result</var>.</dd>  
           <dt>If <var>c</var> is adjacent sibling combinator  
           (<code class=char>+</code>)</dt>  
             <dd>Append a <code class=char>U+002B</code>  
             <code class=charname>PLUS SIGN</code> (<code class=char>+</code>)  
             character to <var>result</var>.</dd>  
           <dt>If <var>c</var> is general sibling combinator  
           (<code class=char>~</code>)</dt>  
             <dd>Append a <code class=char>U+007E</code>  
             <code class=charname>TILDE</code> (<code class=char>~</code>)  
             character to <var>result</var>.</dd>  
           </dl>  
         </li>  
         <li>Append a <code class=char>U+0020</code>  
         <code class=charname>SPACE</code> character to  
         <var>result</var>.</li>  
         </ol>  
       </dd>  
     </dl>  
   </ol>  
 </li>  
 <li>Then, <var>result</var> is the  
 <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>  
 representation of <var>gs</var>.</li>  
314  </ol>  </ol>
315    
316  </div>  </div>
317    
318    
319  <div class=section id=serializing-simple-selectors>  <div class=section id=serializing-simple-selectors>
320  <h3>Serializing Simple Selectors</h3>  <h3>Serializing Simple Selectors</h3>
321    
322    <p>No <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
323    representation is defined for an invalid <a href="#simple-selector">simple
324    selector</a>.</p>
325    
326  <p>To  <p>To
327  <dfn id=algorithm-serialize-a-simple-selector title="serialize a simple selector">serialize  <dfn id=algorithm-serialize-a-simple-selector title="serialize a simple selector">serialize
328  a simple selector (<dfn><var id=var-ss>ss</var></dfn>)</dfn>:</p>  a simple selector (<dfn><var id=var-ss>ss</var></dfn>)</dfn>,
329    the following algorithm <em class=rfc2119>MUST</em> be used:</p>
330    <ol>
331    <li>Let <dfn id=var-r><var>r</var></dfn> an empty string.</li>
332    <li>Process <var>ss</var> as following:
333    
334  <dl class=switch>  <dl class=switch>
335  <dt>If <var>ss</var> is a type or universal selector</dt>  <dt>If <var>ss</var> is a type or universal selector</dt>
336    <dd>    <dd>
337      <ol>      <ol>
338      <li>      <li>Append a namespace prefix as following:
339    
340        <dl class=switch>        <dl class=switch>
341        <dt>If a namespace URI is specified (via namespace prefix, or        <dt>If a namespace URI is specified (via namespace prefix, or
342        by omitting namespace prefix where a default namespace is specified)</dt>        by omitting namespace prefix where a default namespace is specified)</dt>
343          <dd class="ed">@@</dd>          <dd>Append the namespace URI as a
344            <a href="#algorithm-normalize-an-ident" title="normalize a string as an IDENT">normalized
345            <code>IDENT</code></a> to <var>r</var>.  Then, append a
346            <code class=char>U+007C</code>
347            <code class=charname>VERTICAL BAR</code> (<code class=char>|</code>)
348            character to <var>r</var>.</dd>
349        <dt>If the null namespace is specified (by zero$B!>(Blength namespace        <dt>If the null namespace is specified (by zero$B!>(Blength namespace
350        prefix)</dt>        prefix)</dt>
351          <dd>Append a <code class=char>U+007C</code>          <dd>Append a <code class=char>U+007C</code>
352          <code class=charname>VERTICAL BAR</code> (<code class=char>|</code>)          <code class=charname>VERTICAL BAR</code> (<code class=char>|</code>)
353          character to <var>result</var>.</dd>          character to <var>r</var>.</dd>
354        <dt>If no namespace is specified (by namespace prefix <code>*</code>,        <dt>If no namespace is specified (by namespace prefix <code>*</code>,
355        or by omitting namespace prefix where no default namespace is        or by omitting namespace prefix where no default namespace is
356        specified)</dt>        specified)</dt>
# Line 258  a simple selector (<dfn><var id=var-ss>s Line 358  a simple selector (<dfn><var id=var-ss>s
358          <code class=charname>ASTERISK</code> (<code class=char>*</code>)          <code class=charname>ASTERISK</code> (<code class=char>*</code>)
359          character, followed by a <code class=char>U+007C</code>          character, followed by a <code class=char>U+007C</code>
360          <code class=charname>VERTICAL BAR</code> (<code class=char>|</code>)          <code class=charname>VERTICAL BAR</code> (<code class=char>|</code>)
361          character, to <var>result</var>.</dd>          character, to <var>r</var>.</dd>
362        </dl>        </dl>
363      </li>      </li>
364      <li>If <var>ss</var> is a type selector, append the      <li>If <var>ss</var> is a type selector, append the
365      <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>
366      local name to <var>result</var>.</li>      local name to <var>r</var>.</li>
367      <li>If <var>ss</var> is a universal selector, append      <li>If <var>ss</var> is a universal selector, append
368      a <code class=char>U+002A</code> <code class=charname>ASTERISK</code>      a <code class=char>U+002A</code> <code class=charname>ASTERISK</code>
369      (<code class=char>*</code>) character to <var>result</var>.</li>      (<code class=char>*</code>) character to <var>r</var>.</li>
370      </ol>      </ol>
371    </dd>    </dd>
372  <dt>If <var>ss</var> is an attribute selector</dt>  <dt>If <var>ss</var> is an attribute selector</dt>
# Line 274  a simple selector (<dfn><var id=var-ss>s Line 374  a simple selector (<dfn><var id=var-ss>s
374      <ol>      <ol>
375      <li>Append a <code class=char>U+005B</code> <code class=charname>LEFT      <li>Append a <code class=char>U+005B</code> <code class=charname>LEFT
376      SQUARE BRACKET</code> (<code class=char>[</code>) to      SQUARE BRACKET</code> (<code class=char>[</code>) to
377      <var>result</var>.</li>      <var>r</var>.</li>
378      <li>      <li>
379        Append a namespace prefix as following:        Append a namespace prefix as following:
380        <dl>        <dl>
381        <dt>If a namespace URI is specified</dt>        <dt>If a namespace URI is specified</dt>
382          <dd class=ed>@@</dd>          <dd>Append the namespace URI as a
383          <dd class=ed>@@ Current reference implementation is wrong,          <a href="#algorithm-normalize-an-ident" title="normalize a string as an IDENT">normalized
384          since its result of sorting depends on namespace prefix.</dd>          <code>IDENT</code></a> to <var>r</var>.  Then, append a
385            <code class=char>U+007C</code>
386            <code class=charname>VERTICAL BAR</code> (<code class=char>|</code>)
387            character to <var>r</var>.</dd>
388        <dt>If the null namespace is specified</dt>        <dt>If the null namespace is specified</dt>
389          <dd>Append a <code class=char>U+007C</code>          <dd>Append a <code class=char>U+007C</code>
390          <code class=charname>VERTICAL BAR</code> character to          <code class=charname>VERTICAL BAR</code> character to
391          <var>result</var>.</dd>          <var>r</var>.</dd>
392        <dt>If no namespace is specified</dt>        <dt>If no namespace is specified</dt>
393          <dd>Append a <code class=char>U+002A</code>          <dd>Append a <code class=char>U+002A</code>
394          <code class=charname>ASTERISK</code> (<code class=char>*</code>)          <code class=charname>ASTERISK</code> (<code class=char>*</code>)
395          character, followed by a <code class=char>U+007C</code>          character, followed by a <code class=char>U+007C</code>
396          <code class=charname>VERTICAL BAR</code> (<code class=char>|</code>)          <code class=charname>VERTICAL BAR</code> (<code class=char>|</code>)
397          character, to <var>result</var>.</dd>          character, to <var>r</var>.</dd>
398        </dl>        </dl>
399      </li>      </li>
400      <li>Append the      <li>Append the
401      <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>
402      local name to <var>result</var>.</li>      local name to <var>r</var>.</li>
403      <li>If a value is specified in <var>ss</var>:      <li>If a value is specified in <var>ss</var>:
404        <ol>        <ol>
405        <li>Depending on the way to match, append <code>=</code>,        <li>Depending on the way to match, append <code>=</code>,
406        <code>~=</code>, <code>|=</code>, <code>^=</code>,        <code>~=</code>, <code>|=</code>, <code>^=</code>,
407        <code>$=</code>, or <code>*=</code> to <var>result</var>.</li>        <code>$=</code>, or <code>*=</code> to <var>r</var>.</li>
408        <li>Append the        <li>Append the
409        <a href="#algorithm-normalize-a-string" title="normalize a string">normalized</a>        <a href="#algorithm-normalize-a-string" title="normalize a string">normalized</a>
410        value to <var>result</var>.</li>        value to <var>r</var>.</li>
411        </ol>        </ol>
412      </li>      </li>
413      <li>Append a <code class=char>U+005D</code> <code class=charname>RIGHT      <li>Append a <code class=char>U+005D</code> <code class=charname>RIGHT
414      SQUARE BRACKET</code> (<code class=char>]</code>) to      SQUARE BRACKET</code> (<code class=char>]</code>) to
415      <var>result</var>.</li>      <var>r</var>.</li>
416      </ol>      </ol>
417    </dd>    </dd>
418  <dt>If <var>ss</var> is a class selector</dt>  <dt>If <var>ss</var> is a class selector</dt>
419    <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
420    STOP</code> (<code class=char>.</code>) character, followed    STOP</code> (<code class=char>.</code>) character, followed
421    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>
422    class name, <var>result</var>.</dd>    class name, to <var>r</var>.</dd>
423  <dt>If <var>ss</var> is an <abbr>ID</abbr> selector</dt>  <dt>If <var>ss</var> is an <abbr>ID</abbr> selector</dt>
424    <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
425    SIGN</code> (<code class=char>#</code>) character, followed    SIGN</code> (<code class=char>#</code>) character, followed
426    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>
427    <abbr>ID</abbr>, to <var>result</var>.</dd>    <abbr>ID</abbr>, to <var>r</var>.</dd>
428  <dt>If <var>ss</var> is a pseudo$B!>(Bclass selector</dt>  <dt>If <var>ss</var> is a pseudo$B!>(Bclass selector</dt>
429    <dd>    <dd>
430      <ol>      <ol>
431      <li>Append a <code class=char>U+003A</code>      <li>Append a <code class=char>U+003A</code>
432      <code class=charname>COLON</code> (<code class=char>:</code>) character      <code class=charname>COLON</code> (<code class=char>:</code>) character
433      to <var>result</var>.</li>      to <var>r</var>.</li>
434      <li>Append the      <li>Append the
435      <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>
436      name of the pseudo$B!>(Bclass to <var>result</var>.</li>      name (in <a href="#lower-case">lower$B!>(Bcase</a>) of the pseudo$B!>(Bclass to
437        <var>r</var>.</li>
438      <li>Append any arguments as following:      <li>Append any arguments as following:
439        <dl class=switch>        <dl class=switch>
440        <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 338  a simple selector (<dfn><var id=var-ss>s Line 442  a simple selector (<dfn><var id=var-ss>s
442            <ol>            <ol>
443            <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
444            PARENTHESIS</code> (<code class=char>(</code>) character            PARENTHESIS</code> (<code class=char>(</code>) character
445            to <var>result</var>.</li>            to <var>r</var>.</li>
446            <li>Append the            <li>Append the
447            <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>
448            language tag (the argument) to <var>result</var>.</li>            language tag (the argument) to <var>r</var>.
449              <span class="issue ed">Should we normalize cases?</span></li>
450            <li>Append a <code class=char>U+0029</code>            <li>Append a <code class=char>U+0029</code>
451            <code class=charname>RIGHT PARENTHESIS</code>            <code class=charname>RIGHT PARENTHESIS</code>
452            (<code class=char>)</code>) character            (<code class=char>)</code>) character
453            to <var>result</var>.</li>            to <var>r</var>.</li>
454            </ol>            </ol>
455          </dd>          </dd>
456        <dt>If the name of the pseudo$B!>(Bclass is        <dt>If the name of the pseudo$B!>(Bclass is
# Line 354  a simple selector (<dfn><var id=var-ss>s Line 459  a simple selector (<dfn><var id=var-ss>s
459            <ol>            <ol>
460            <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
461            PARENTHESIS</code> (<code class=char>(</code>) character            PARENTHESIS</code> (<code class=char>(</code>) character
462            to <var>result</var>.</li>            to <var>r</var>.</li>
463            <li>Append the            <li>Append the
464            <a href="#algorithm-normalize-a-string" title="normalize a string">normalized</a>            <a href="#algorithm-normalize-a-string" title="normalize a string">normalized</a>
465            string (the argument) to <var>result</var>.</li>            string (the argument) to <var>r</var>.</li>
466            <li>Append a <code class=char>U+0029</code>            <li>Append a <code class=char>U+0029</code>
467            <code class=charname>RIGHT PARENTHESIS</code>            <code class=charname>RIGHT PARENTHESIS</code>
468            (<code class=char>)</code>) character            (<code class=char>)</code>) character
469            to <var>result</var>.</li>            to <var>r</var>.</li>
470            </ol>            </ol>
471          </dd>          </dd>
472        <dt>If name of the pseudo$B!>(Bclass is either <code>nth-child</code>,        <dt>If name of the pseudo$B!>(Bclass is either <code>nth-child</code>,
# Line 371  a simple selector (<dfn><var id=var-ss>s Line 476  a simple selector (<dfn><var id=var-ss>s
476            <ol>            <ol>
477            <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
478            PARENTHESIS</code> (<code class=char>(</code>) character            PARENTHESIS</code> (<code class=char>(</code>) character
479            to <var>result</var>.</li>            to <var>r</var>.</li>
480            <li>Append <span class=ed>@@ normalized</span>            <li>Let <dfn id=var-a><var>a</var></dfn> be the <var>a</var>
481            integer <var>a</var> to <var>result</var>.            part of the argument.  If the argument is a keyword <code>odd</code>
482            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>.
483            <var>a</var> is <code>2</code>.  If <var>a</var> and            If the <var>a</var> part with following <code>n</code> character
484            <code>n</code> is omitted, <var>a</var> is assumed as            is omitted, then let <var>a</var> be <code>0</code>.
485            <code>0</code>.  Otherwise, if <var>a</var> is omitted,            Otherwise, if only the <var>a</var> part is omitted, then
486            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>
487            if there is a <code class=char>U+002D</code>            part is <code>-</code>, then let <var>a</var> be
488            <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>)            <code>-1</code>.</li>
489            character).</li>            <li>Let <var>a</var> be the
490              <a href="#algorithm-normalize-an-integer" title="normalize an integer">normalized
491              string representation</a> of integer <var>a</var>.</li>
492              <li>Append <var>a</var> to <var>result</var>.</li>
493            <li>Append a <code class=char>U+006E</code>            <li>Append a <code class=char>U+006E</code>
494            <code class=charname>LATIN SMALL LETTER N</code>            <code class=charname>LATIN SMALL LETTER N</code>
495            (<code class=char>n</code>) character to <var>result</var>.</li>            (<code class=char>n</code>) character to <var>r</var>.</li>
496            <li>Append <span class=ed>@@ normalized</span>            <li>Let <dfn id=var-b><var>b</var></dfn> be the <var>b</var>
497            integer <var>b</var> to <var>result</var>.            part of the argument.  If the argument is a keyword <code>odd</code>,
498            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
499            either <code class=char>U+002B</code> <code class=charname>PLUS            keyword <code>even</code>, then let <var>b</var> be <code>0</code>.
500            SIGN</code> (<code class=char>+</code>) or            If the <var>b</var> part is omitted, then let <var>b</var> be
501            <code class=char>U+002D</code>            <code>0</code>.</li>
502              <li>Let <var>b</var> be the
503              <a href="#algorithm-normalize-an-integer" title="normalize an integer">normalized
504              string representation</a> of integer <var>b</var>.</li>
505              <li>If <var>b</var> does <em>not</em> start with a
506              <code class=char>U+002D</code>
507            <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>)            <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>)
508            character.  If the argument is a keyword <code>odd</code>,            character, then append <code class=char>U+002B</code>
509            <var>b</var> is <code>1</code>.  If the argument            <code class=charname>PLUS SIGN</code>
510            is a keyword <code>even</code>, <var>b</var> is            (<code class=char>+</code>) to <var>result</var>.</li>
511            <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>  
512            <li>Append a <code class=char>U+0029</code>            <li>Append a <code class=char>U+0029</code>
513            <code class=charname>RIGHT PARENTHESIS</code>            <code class=charname>RIGHT PARENTHESIS</code>
514            (<code class=char>)</code>) character            (<code class=char>)</code>) character
515            to <var>result</var>.</li>            to <var>r</var>.</li>
516            </ol>            </ol>
517          </dd>          </dd>
518        <dt>If the name of the pseudo$B!>(Bclass is <code>not</code></dt>        <dt>If the name of the pseudo$B!>(Bclass is <code>not</code></dt>
# Line 417  a simple selector (<dfn><var id=var-ss>s Line 526  a simple selector (<dfn><var id=var-ss>s
526              <code class=charname>LATIN SMALL LETTER T</code>, and              <code class=charname>LATIN SMALL LETTER T</code>, and
527              <code class=char>U+0028</code> <code class=charname>LEFT              <code class=char>U+0028</code> <code class=charname>LEFT
528              PARENTHESIS</code> (<code>:not(</code>), followed by a              PARENTHESIS</code> (<code>:not(</code>), followed by a
529              <a href="#newline">newline</a>, to <var>result</var>.</li>              <a href="#newline">newline</a>, to <var>r</var>.</li>
530              <li>Append four <code class=char>U+0020</code>              <li>Append four <code class=char>U+0020</code>
531              <code class=charname>SPACE</code> characters to              <code class=charname>SPACE</code> characters to
532              <var>result</var>.</li>              <var>r</var>.</li>
533              <li>Append four <code class=char>U+0020</code>              <li>Append four <code class=char>U+0020</code>
534              <code class=charname>SPACE</code> characters to              <code class=charname>SPACE</code> characters to
535              <var>result</var> again.</li>              <var>r</var> again.</li>
536              <li><a href="#algorithm-serialize-a-simple-selector">Serialize              <li><a href="#algorithm-serialize-a-simple-selector">Serialize
537              the simple selector specified as the argument to the              the simple selector specified as the argument to the
538              <code>not</code> pseudo$B!>(Bclass</a>.</li>              <code>not</code> pseudo$B!>(Bclass</a>.</li>
539              <li>Append a <a href="#newline">newline</a> to              <li>Append a <a href="#newline">newline</a> to
540              <var>result</var>.</li>              <var>r</var>.</li>
541              <li>Append four <code class=char>U+0020</code>              <li>Append four <code class=char>U+0020</code>
542              <code class=charname>SPACE</code> characters to              <code class=charname>SPACE</code> characters to
543              <var>result</var>.</li>              <var>r</var>.</li>
544              <li>Append a <code class=char>U+0029</code>              <li>Append a <code class=char>U+0029</code>
545              <code class=charname>RIGHT PARENTHESIS</code>              <code class=charname>RIGHT PARENTHESIS</code>
546              (<code class=char>)</code>) character              (<code class=char>)</code>) character
547              to <var>result</var>.</li>              to <var>r</var>.</li>
548            </ol>            </ol>
549          </dd>          </dd>
550          <dt>Otherwise</dt>
551            <dd>The pseudo$B!>(Bclass is not supported by this version of
552            <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
553            and therefore no
554            <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
555            representation is defined for <var>ss</var>.  Stop the algorithm.</dd>
556        </dl>        </dl>
557      </li>      </li>
558      </ol>      </ol>
# Line 447  a simple selector (<dfn><var id=var-ss>s Line 562  a simple selector (<dfn><var id=var-ss>s
562      <ol>      <ol>
563      <li>Append two <code class=char>U+003A</code>      <li>Append two <code class=char>U+003A</code>
564      <code class=charname>COLON</code> characters (<code>::</code>)      <code class=charname>COLON</code> characters (<code>::</code>)
565      to <var>result</var>.</li>      to <var>r</var>.</li>
566      <li>Append the      <li>Append the
567      <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>
568      name of the pseudo$B!>(Belement to <var>result</var>.</li>      name (in <a href="#lower-case">lower$B!>(Bcase</a>) of the pseudo$B!>(Belement
569      <!-- For future version: append "(", arguments, ")", if any. -->      to <var>r</var>.</li>
570        <li>If the pseudo$B!>(Belement has any arguments:
571            The pseudo$B!>(Belement is not supported by this version of
572            <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
573            and therefore no
574            <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
575            representation is defined for <var>ss</var>.  Stop the algorithm.
576        </li>
577      </ol>      </ol>
578    </dd>    </dd>
579  </dl>  </dl>
580    </li>
581    <li>Then, <var>r</var> is the
582    <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
583    representation of <var>ss</var>.</li>
584    </ol>
585    
586  </div>  </div>
587    
588  <div class=section id=serializing-tokens>  <div class=section id=serializing-groups-of-selectors>
589  <h3>Serializing Tokens</h3>  <h3>Serializing Groups of Selectors</h3>
590    
591  <p>To <dfn id=algorithm-normalize-an-ident title="normalize an IDENT">normalize  <p>No <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
592  an <code>IDENT</code> (<dfn id=var-n><var>n</var></dfn>)</dfn>:</p>  representation is defined for an invalid
593  <ol>  <a href="http://www.w3.org/TR/css3-selectors/#grouping">group of
594  <li>Replace the escape sequences (<code>\</code> and following  selectors</a>.</p>
 characters) in <var>n</var> by characters represented by them  
 respectively.</li>  
 <li>If there is any character that is <em>not</em> one of  
 <code class=char>U+002D</code> <code class=charname>HYPHEN-MINUS</code>  
 (<code class=char>-</code>), <code class=char>U+0030</code>  
 <code class=charname>DIGIT ZERO</code>  
 (<code class=char>0</code>) to <code class=char>U+0039</code>  
 <code class=charname>DIGIT NINE</code> (<code class=char>9</code>),  
 <code class=char>U+0041</code> <code class=charname>LATIN CAPITAL LETTER  
 A</code> (<code class=char>A</code>) to <code class=char>U+005A</code>  
 <code class=charname>LATIN CAPITAL LETTER Z</code> (<code class=char>Z</code>),  
 <code class=char>U+005F</code> <code class=charname>LOW LINE</code>  
 (<code class=char>_</code>), <code class=char>U+0061</code>  
 <code class=charname>LATIN SMALL LETTER A</code>  
 (<code class=char>a</code>) to <code class=char>U+006A</code>  
 <code class=charname>LATIN SMALL LETTER Z</code> (<code class=char>z</code>),  
 <code class=char>U+0080</code> to <code class=char>U+D7FF</code>, or  
 <code class=char>U+E000</code> to <code class=char>U+10FFFF</code> in  
 <var>n</var>, then replace it by string <code>\<var>HHHHHH</var></code>, where  
 <dfn id=var-HHHHHH><var>HHHHHH</var></dfn> is the upper$B!>(Bcase zero$B!>(Bpadded  
 hexadecimal representation of the character.  If the character  
 is outside the range of <code>[<code class=char>U+0000</code>,  
 <code class=char>U+10FFFF</code>]</code>, <var>HHHHHH</var>  
 <em class=rfc2119>MUST</em> be <code>FFFFFF</code>.</li>  
 <li>If the first character in <var>n</var> is one of  
 <code class=char>U+0030</code> <code class=charname>DIGIT ZERO</code>  
 (<code class=char>0</code>) to <code class=char>U+0039</code>  
 <code class=charname>DIGIT NINE</code> (<code class=char>9</code>),  
 then prepend a string <code>\00003</code> at the beginning of  
 <var>n</var>.</li>  
 <li>If the first character in <var>n</var> is <code class=char>U+002D</code>  
 <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>) and  
 the second character, if any, is <em>not</em> one of  
 <code class=char>U+0041</code> <code class=charname>LATIN CAPITAL LETTER  
 A</code> (<code class=char>A</code>) to <code class=char>U+005A</code>  
 <code class=charname>LATIN CAPITAL LETTER Z</code> (<code class=char>Z</code>),  
 <code class=char>U+005F</code> <code class=charname>LOW LINE</code>  
 (<code class=char>_</code>), <code class=char>U+0061</code>  
 <code class=charname>LATIN SMALL LETTER A</code>  
 (<code class=char>a</code>) to <code class=char>U+006A</code>  
 <code class=charname>LATIN SMALL LETTER Z</code> (<code class=char>z</code>),  
 <code>U+0080</code> to <code>U+D7FF</code>, or  
 <code>U+E000</code> to <code>U+10FFFF</code>, or  
 <var>n</var> is equal to <code class=char>U+002D</code>  
 <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>), then  
 replace the <code class=char>U+002D</code>  
 <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>)  
 character by string <code>\00002D</code>.</li>  
 <li>Then, <var>n</var> is the result of the algorithm.</li>  
 </ol>  
595    
596  <p>To <dfn id=algorithm-normalize-a-string title="normalize a STRING">normalize  <p>To
597  a <code>STRING</code> (<dfn id=var-s><var>s</var></dfn>)</dfn>:</p>  <dfn id=algorithm-serialize-a-group-of-selectors title="serialize a group of selectors">serialize
598    a group of selectors (<dfn id=var-gs><var>gs</var></dfn>)</dfn>,
599    the following algorithm <em class=rfc2119>MUST</em> be used:</p>
600  <ol>  <ol>
601  <li>Replace the escape sequences (<code>\</code> and following  <li>Let <dfn id=var-result><var>result</var></dfn> an empty string.</li>
602  characters) in <var>s</var> by characters represented by them  <li>For each selector (<dfn id=var-selector><var>selector</var></dfn>) in
603  (or an empty string if <code>\</code> is immediately followed by  <var>gs</var>:
604  newline character(s)) respectively.</li>    <ol>
605  <li>Remove the quotation characters in <var>s</var>    <li>If <var>selector</var> is <em>not</em> the first selector
606  if <var>s</var> is a <code>STRING</code>.</li>    in the <var>gs</var>, then append a <code class=char>U+002C</code>
607  <li>If there is any character that is <em>not</em> one of    <code class=charname>COMMA</code> (<code class=char>,</code>) followed by a
608  <code class=char>U+0020</code> <code class=charname>SPACE</code>,    <a href="#newline">newline</a> to <var>result</var>.</li>
609  <code class=char>U+0021</code> <code class=charname>EXCLAMATION MARK</code>    <li>Append four <code class=char>U+0020</code>
610  (<code class=char>!</code>), <code class=char>U+0023</code>    <code class=charname>SPACE</code> characters to <var>result</var>.</li>
611  <code class=charname>NUMBER SIGN</code> (<code class=char>#</code>) to    <li>Process each sequence of simple selectors or
612  <code class=char>U+005B</code> <code class=charname>LEFT SQUARE    combinator in <var>selector</var> as following:
613  BRACKET</code>, <code class=char>U+005D</code> <code class=charname>RIGHT      <dl class=switch>
614  SQUARE BRACKET</code> to <code class=char>U+D7FF</code>, or      <dt>If it is a sequence of simle selector
615  <code class=char>U+E000</code> to <code class=char>U+10FFFF</code> in      (<dfn id=var-sss><var>sss</var></dfn>)</dt>
616  <var>s</var>, then replace it by string <code>\<var>HHHHHH</var></code>, where        <dd>
617  <dfn id=var-HHHHHH><var>HHHHHH</var></dfn> is the upper$B!>(Bcase zero$B!>(Bpadded          <ol>
618  hexadecimal representation of the character.  If the character          <li>If <var>sss</var> contains a universal or type selector, then
619  is outside the range of <code>[<code class=char>U+0000</code>,          <a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">serialize
620  <code class=char>U+10FFFF</code>]</code>, <var>HHHHHH</var>          that simple selector</a> and append the result to
621  <em class=rfc2119>MUST</em> be <code>FFFFFF</code>.</li>          <var>result</var>.</li>
622  <li>Insert a <code class=char>U+0022</code> <code class=charname>QUOTATION          <li>Otherwise, i.e. if <var>sss</var> does not contain a universal or
623  MARK</code> (<code class=char>"</code>) at the beginning of <var>s</var>.</li>          type selector, then
624  <li>Insert a <code class=char>U+0022</code> <code class=charname>QUOTATION          <a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">serialize
625  MARK</code> (<code class=char>"</code>) at the end of <var>s</var>.</li>          a simple selector <code>*</code></a> and append the result to
626  <li>Then, <var>s</var> is the result of the algorithm.</li>          <var>result</var>.</li>
627  </ol>          <li><a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">Serialize
628            any attribute selectors</a> in <var>sss</var>, sort the results,
629  <p>A <dfn id=newline title=newline>newline</dfn>          then append them to <var>result</var> in order.</li>
630  <em class=rfc2119>SHOULD</em> be represented as a          <li><a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">Serialize
631  <code class=char>U+000A</code> <code class=charname>LINE FEED</code>          any class selectors</a> in <var>sss</var>, sort the results,
632  character.  However, depending on the context where          then append them to <var>result</var> in order.</li>
633  the <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>          <li><a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">Serialize
634  representation is in use, a sequence of          any <abbr>ID</abbr> selectors</a> in <var>sss</var>, sort the results,
635  <code class=char>U+000D</code> <code class=charname>CARRIAGE RETURN</code>          then append them to <var>result</var> in order.</li>
636  followed by a <code class=char>U+000A</code>          <li><a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">Serialize
637  <code class=charname>LINE FEED</code> (i.e. a          any pseudo$B!>(Bclass selectors</a> in <var>sss</var>, sort the results,
638  <code>CRLF</code> sequence) or a character          then append them to <var>result</var> in order.</li>
639  <code class=char>U+000D</code> <code class=charname>CARRIAGE RETURN</code>          <li><a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">Serialize
640  <em class=rfc2119>MAY</em> be used as a <a href="#newline">newline</a> instead.          any pseudo elements</a> in <var>sss</var>, sort the results,
641  <a href="#newline">Newline</a> representations          then append them to <var>result</var> in order.</li>
642  <em class=rfc2119>SHOULD</em> be consistent in an          <li>Append a <a href="#newline">newline</a> to <var>result</var>.</li>
643  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>          </ol>
644  representation.</p>        </dd>
645        <dt>If it is a combinator (<dfn id=var-c><var>c</var></dfn>)</dt>
646          <dd>
647            <ol>
648            <li>Append two <code class=char>U+0020</code>
649            <code class=charname>SPACE</code> characters to <var>result</var>.</li>
650            <li>Process <var>c</var> as following:
651    
652  <div class="note memo">            <dl class=switch>
653  <p>Therefore, newlines must be normalized before            <dt>If <var>c</var> is descendant combinator (white space)</dt>
654                <dd>Append a <code class=char>U+0020</code>
655                <code class=charname>SPACE</code> character to
656                <var>result</var>.</dd>
657              <dt>If <var>c</var> is child combinator
658              (<code class=char>></code>)</dt>
659                <dd>Append a <code class=char>U+003E</code>
660                <code class=charname>GREATER-THAN SIGN</code>
661                (<code class=char>></code>) character to <var>result</var>.</dd>
662              <dt>If <var>c</var> is adjacent sibling combinator
663              (<code class=char>+</code>)</dt>
664                <dd>Append a <code class=char>U+002B</code>
665                <code class=charname>PLUS SIGN</code> (<code class=char>+</code>)
666                character to <var>result</var>.</dd>
667              <dt>If <var>c</var> is general sibling combinator
668              (<code class=char>~</code>)</dt>
669                <dd>Append a <code class=char>U+007E</code>
670                <code class=charname>TILDE</code> (<code class=char>~</code>)
671                character to <var>result</var>.</dd>
672              </dl>
673            </li>
674            <li>Append a <code class=char>U+0020</code>
675            <code class=charname>SPACE</code> character to
676            <var>result</var>.</li>
677            </ol>
678          </dd>
679        </dl>
680      </ol>
681    </li>
682    <li>Then, <var>result</var> is the
683  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
684  representations are literally compared.</p>  representation of <var>gs</var>.</li>
685  </div>  </ol>
686    
687  </div>  </div>
688    
# Line 577  representations are literally compared.< Line 691  representations are literally compared.<
691  <div class="section" id="parsing">  <div class="section" id="parsing">
692  <h2>Parsing  <h2>Parsing
693  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
694  Groups of Selectors</h2>  Representations of Selectors</h2>
695    
696  <p>Since <a href="#serializing">the serializing algorithm</a> is  <p>Since <a href="#algorithm-serialize-a-group-of-selectors">the serializing
697  so designed that it always output a valid  algorithm for groups of selectors</a> is so designed that it always outputs a
698  <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
699  selectors</a>, no special parser for the  selectors</a>, no special parser for the
700  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
701  representation is necessary.  Any conforming parser for  representation is necessary.  Any conforming parser for
702  <a href="http://www.w3.org/TR/css3-selectors/#grouping">groups of  <a href="http://www.w3.org/TR/css3-selectors/#grouping">groups of
703  selectors</a> <em class=rfc2119>MAY</em> be used  selectors</a> <em class=rfc2119>MAY</em> be used
704  to parse <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>  to parse <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
705  representations of groups of selectors.</p>  representations of
706    <a href="http://www.w3.org/TR/css3-selectors/#grouping">groups of
707    selectors</a>.</p>
708    
709    <p>Likewise, <a href="#algorithm-serialize-a-simple-selector">the serializing
710    algorithm for simple selectors</a> always outputs a valid
711    <a href="#simple-selector">simple selector</a> and therefore any
712    conforming parser for <a href="#simple-selector">simple selector</a>
713    <em class=rfc2119>MAY</em> be used to parse
714    <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
715    representations of <a href="#simple-selector">simple selectors</a>.</p>
716  </div>  </div>
717    
718  <div class="section" id="examples">  <div class="section" id="examples">
# Line 624  by choosing <q>Selectors</q> radio butto Line 748  by choosing <q>Selectors</q> radio butto
748    <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>
749    14</a>, <abbr title="Request for Comments">RFC</abbr> 2119,    14</a>, <abbr title="Request for Comments">RFC</abbr> 2119,
750    <time datetime=1997-03>March 1997</time>.    <time datetime=1997-03>March 1997</time>.
751    This version of the specification is referenced</dd>    This version of the specification is referenced.</dd>
752  <dt id=ref-SELECTORS>SELECTORS</dt>  <dt id=ref-SELECTORS>SELECTORS</dt>
753    <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>,
754    <abbr title="World Wide Web Consortium">W3C</abbr> Working Draft,    <abbr title="World Wide Web Consortium">W3C</abbr> Working Draft,
Legend:
Removed from v.1.12  
changed lines
  Added in v.1.19
admin@suikawiki.org
 ViewVC Help
Powered by ViewVC 1.1.24