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

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

Parent Directory Parent Directory | Revision Log Revision Log


Revision 1.14 - (show annotations) (download) (as text)
Mon Oct 22 10:46:10 2007 UTC (17 years, 1 month ago) by wakaba
Branch: MAIN
Changes since 1.13: +185 -184 lines
File MIME type: text/html
Subsections rearranged

1 <!DOCTYPE html>
2 <html lang="en" class="formal-specification status-work-in-progress">
3 <head>
4 <title>Selectors Serialization Format for Testing (SSFT) Specification</title>
5 <link rel="stylesheet" href="http://suika.fam.cx/www/style/html/spec">
6 <link rel="license" href="http://suika.fam.cx/c/gnu/fdl">
7 </head>
8 <body class="has-abstract">
9
10 <div class="header">
11 <h1>Selectors Serialization Format for Testing (<abbr>SSFT</abbr>)
12 Specification</h1>
13 <h2>Working Draft <time datetime=2007-10-22>22 October 2007</time></h2>
14
15 <dl class="versions-uri">
16 <dt>This Version</dt>
17 <dd><code class="URI">&lt;<a href="http://suika.fam.cx/www/markup/selectors/ssft/ssft"
18 >http://suika.fam.cx/www/markup/selectors/ssft/ssft</a>&gt;</code></dd>
19 <dt>Latest Version</dt>
20 <dd><code class="URI">&lt;<a href="http://suika.fam.cx/www/markup/selectors/ssft/ssft"
21 >http://suika.fam.cx/www/markup/selectors/ssft/ssft</a>&gt;</code></dd>
22 <!--
23 <dt>Latest Working Draft</dt>
24 -->
25 <!-- <dt>Previous Version</dt> -->
26 <dt>Version History</dt>
27 <dd><code class=URI>&lt;<a href="http://suika.fam.cx/gate/cvs/markup/selectors/ssft/ssft.en.html">http://suika.fam.cx/gate/cvs/markup/selectors/ssft/ssft.en.html</a>&gt;</code></dd>
28 </dl>
29 <dl class="authors" id="author">
30 <dt>Author</dt>
31 <dd><a href="http://suika.fam.cx/~wakaba/who?" rel="author"
32 lang=ja>Wakaba</a>
33 <code class="mail">&lt;<a href="mailto:w@suika.fam.cx" rel="author"
34 >w@suika.fam.cx</a>&gt;</code></dd>
35 </dl>
36
37 <p class="copyright" lang="en">&#xA9; <time>2007</time> <a
38 href="http://suika.fam.cx/~wakaba/who?" rel="author">Wakaba</a>.
39 Permission is granted to copy, distribute and/or modify this document
40 under the terms of the <a rel="license"
41 href="http://www.gnu.org/copyleft/fdl.html">GNU Free Documentation License</a>,
42 Version 1.2
43 or any later version published by the <a
44 href="http://www.fsf.org/">Free Software Foundation</a>;
45 with no Invariant Sections, no Front$B!>(BCover Texts, and no Back$B!>(BCover
46 Texts. A copy of the license is
47 available at <code class="URI">&lt;<a
48 href="http://www.gnu.org/copyleft/fdl.html"
49 rel="license">http://www.gnu.org/copyleft/fdl.html</a>&gt;</code>.</p>
50 </div>
51
52 <div id="abstract" class="section">
53 <h2>Abstract</h2>
54
55 <div class="ed issue">...</div>
56
57 </div>
58
59 <div id="status" class="section">
60 <h2>Status of This Document</h2>
61
62 <p class=section-info><em>This section describes the status of this document
63 at the time of its publication. Other documents
64 might supersede this document.</em></p>
65
66 <p>This document is a working draft, produced as part of the
67 <a href="http://suika.fam.cx/www/markup/html/whatpm/readme">Whatpm</a>
68 subproject
69 of the <a href="http://suika.fam.cx/www/manakai-core/doc/web/">manakai</a>
70 project. It might be updated, replaced, or obsoleted by
71 other documents at any time. It is inappropriate to
72 cite this document as other than <q>work in progress</q>.</p>
73
74 <p>Comments on this document are welcome and
75 may be sent to the <a href="#author">author</a>.</p>
76
77 <p>Translations of thie document might be available.
78 The English version of the document is the only
79 normative version.</p>
80 </div>
81
82 <div id="introduction" class="section">
83 <h2>Introduction</h2>
84
85 <p class=section-info>This section is <em>non$B!>(Bnormative</em>.</p>
86
87 <p>Selectors
88 <cite class="bibref normative">[<a href="#ref-SELECTORS">SELECTORS</a>]</cite>
89 are patterns that match against elements
90 in a tree structure and are used in Web technologies, including
91 <a href="http://www.w3.org/TR/CSS21"><abbr title="Cascading Style Sheets">CSS</abbr></a>
92 <cite class="bibref informative">[<a href="#ref-CSS">CSS</a>]</cite>,
93 <a href="http://whatwg.org/html5"><abbr title="Hypertext Markup Language">HTML</abbr>5</a>
94 <cite class="bibref informative">[<a href="#ref-HTML5">HTML5</a>]</cite>,
95 <a href="http://www.mozilla.org/projects/xbl/xbl2.html"><abbr title="XML Binding Language">XBL</abbr>2</a>
96 <cite class="bibref informative">[<a href="#ref-XBL2">XBL2</a>]</cite>, and
97 <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
98 <abbr>API</abbr></a>
99 <cite class="bibref informative">[<a href="#ref-SAPI">SAPI</a>]</cite>.</p>
100
101 <div class="issue ed">...</div>
102
103 <p><a href="http://dev.w3.org/cvsweb/csswg/cssom/Overview.html">The
104 <abbr title="Cascading Style Sheets Object Model">CSSOM</abbr>
105 specification</a>
106 <cite class="bibref informative">[<a href="#ref-CSSOM">CSSOM</a>]</cite>
107 is trying to define an algorithm to
108 <a href="http://dev.w3.org/cvsweb/~checkout~/csswg/cssom/Overview.html?rev=1.55&amp;content-type=text/html;%20charset=utf-8#serializing0">serialize
109 a group of selectors</a> for the purpose of <code>selectorText</code>
110 attribute. However, the algorithm is incomplete
111 <time datetime=2007-09-25>at the time of the writing</time>.
112 Note that current Web browser implementations
113 of the <code>selectorText</code> attribute are consistently broken
114 in not escaping unsafe identifiers.</p>
115
116 </div>
117
118 <div class="section" id="terminology">
119 <h2>Terminology</h2>
120
121 <p>The key words <q><dfn id=must><em class="rfc2119">MUST</em></dfn></q>,
122 <q><dfn id=must-not><em class="rfc2119">MUST NOT</em></dfn></q>,
123 <q><dfn id=should><em class="rfc2119">SHOULD</em></dfn></q>,
124 <q><dfn id=should-not><em class="rfc2119">SHOULD NOT</em></dfn></q>, and
125 <q><dfn id=may><em class=rfc2119>MAY</em></dfn></q> in this
126 document are to be interpreted as described in
127 <a href="urn:ietf:rfc:2119"><abbr title="Request for Comments">RFC</abbr>
128 2119</a>
129 <cite class="bibref normative">[<a href="#ref-KEYWORDS">KEYWORDS</a>]</cite>.</p>
130
131 <!-- Strictly speaking the paragraph below is not part of terminology. -->
132 <p>All examples and notes in this specification are non$B!>(Bnormative,
133 as are all sections explicitly marked non$B!>(Bnormative. Everything
134 else in this specification is normative.</p>
135
136 <p>For the purpose of this specification, pseudo$B!>(Belements are also
137 referred to as <dfn title="simple selector" id=simple-selector>simple
138 selectors</dfn> and are considered as part of the last sequence of
139 simple selector in a selector.</p>
140 </div>
141
142 <div class="section" id="serializing">
143 <h2>Serializing Selectors as
144 <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
145 Representation</h2>
146
147 <div class="issue ed">
148 <p><a href="http://suika.fam.cx/gate/cvs/*checkout*/markup/html/whatpm/Whatpm/CSS/SelectorsSerializer.pm">See the reference implementation</a>
149 for now.</p>
150 </div>
151
152 <div class=section id=serializing-tokens>
153 <h3>Serializing Tokens</h3>
154
155 <p>To <dfn id=algorithm-normalize-an-ident title="normalize an IDENT">normalize
156 an <code>IDENT</code> (<dfn id=var-n><var>n</var></dfn>)</dfn>:</p>
157 <ol>
158 <li>Replace the escape sequences (<code>\</code> and following
159 characters) in <var>n</var> by characters represented by them
160 respectively.</li>
161 <li>If there is any character that is <em>not</em> one of
162 <code class=char>U+002D</code> <code class=charname>HYPHEN-MINUS</code>
163 (<code class=char>-</code>), <code class=char>U+0030</code>
164 <code class=charname>DIGIT ZERO</code>
165 (<code class=char>0</code>) to <code class=char>U+0039</code>
166 <code class=charname>DIGIT NINE</code> (<code class=char>9</code>),
167 <code class=char>U+0041</code> <code class=charname>LATIN CAPITAL LETTER
168 A</code> (<code class=char>A</code>) to <code class=char>U+005A</code>
169 <code class=charname>LATIN CAPITAL LETTER Z</code> (<code class=char>Z</code>),
170 <code class=char>U+005F</code> <code class=charname>LOW LINE</code>
171 (<code class=char>_</code>), <code class=char>U+0061</code>
172 <code class=charname>LATIN SMALL LETTER A</code>
173 (<code class=char>a</code>) to <code class=char>U+006A</code>
174 <code class=charname>LATIN SMALL LETTER Z</code> (<code class=char>z</code>),
175 <code class=char>U+0080</code> to <code class=char>U+D7FF</code>, or
176 <code class=char>U+E000</code> to <code class=char>U+10FFFF</code> in
177 <var>n</var>, then replace it by string <code>\<var>HHHHHH</var></code>, where
178 <dfn id=var-HHHHHH><var>HHHHHH</var></dfn> is the upper$B!>(Bcase zero$B!>(Bpadded
179 hexadecimal representation of the character. If the character
180 is outside the range of <code>[<code class=char>U+0000</code>,
181 <code class=char>U+10FFFF</code>]</code>, <var>HHHHHH</var>
182 <em class=rfc2119>MUST</em> be <code>FFFFFF</code>.</li>
183 <li>If the first character in <var>n</var> is one of
184 <code class=char>U+0030</code> <code class=charname>DIGIT ZERO</code>
185 (<code class=char>0</code>) to <code class=char>U+0039</code>
186 <code class=charname>DIGIT NINE</code> (<code class=char>9</code>),
187 then prepend a string <code>\00003</code> at the beginning of
188 <var>n</var>.</li>
189 <li>If the first character in <var>n</var> is <code class=char>U+002D</code>
190 <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>) and
191 the second character, if any, is <em>not</em> one of
192 <code class=char>U+0041</code> <code class=charname>LATIN CAPITAL LETTER
193 A</code> (<code class=char>A</code>) to <code class=char>U+005A</code>
194 <code class=charname>LATIN CAPITAL LETTER Z</code> (<code class=char>Z</code>),
195 <code class=char>U+005F</code> <code class=charname>LOW LINE</code>
196 (<code class=char>_</code>), <code class=char>U+0061</code>
197 <code class=charname>LATIN SMALL LETTER A</code>
198 (<code class=char>a</code>) to <code class=char>U+006A</code>
199 <code class=charname>LATIN SMALL LETTER Z</code> (<code class=char>z</code>),
200 <code>U+0080</code> to <code>U+D7FF</code>, or
201 <code>U+E000</code> to <code>U+10FFFF</code>, or
202 <var>n</var> is equal to <code class=char>U+002D</code>
203 <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>), then
204 replace the <code class=char>U+002D</code>
205 <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>)
206 character by string <code>\00002D</code>.</li>
207 <li>Then, <var>n</var> is the result of the algorithm.</li>
208 </ol>
209
210 <p>To <dfn id=algorithm-normalize-a-string title="normalize a STRING">normalize
211 a <code>STRING</code> (<dfn id=var-s><var>s</var></dfn>)</dfn>:</p>
212 <ol>
213 <li><p>Replace the escape sequences (<code>\</code> and following
214 characters) in <var>s</var> by characters represented by them
215 (or an empty string if <code>\</code> is immediately followed by
216 newline character(s)) respectively.</p></li>
217 <li><p>Remove the quotation characters in <var>s</var>
218 if <var>s</var> is a <code>STRING</code>.</p>
219
220 <div class="note memo">
221 <p>The input <var>s</var> to this algorithm may be an
222 <code>IDENT</code>.</p>
223 </div></li>
224 <li><p>If there is any character that is <em>not</em> one of
225 <code class=char>U+0020</code> <code class=charname>SPACE</code>,
226 <code class=char>U+0021</code> <code class=charname>EXCLAMATION MARK</code>
227 (<code class=char>!</code>), <code class=char>U+0023</code>
228 <code class=charname>NUMBER SIGN</code> (<code class=char>#</code>) to
229 <code class=char>U+005B</code> <code class=charname>LEFT SQUARE
230 BRACKET</code>, <code class=char>U+005D</code> <code class=charname>RIGHT
231 SQUARE BRACKET</code> to <code class=char>U+D7FF</code>, or
232 <code class=char>U+E000</code> to <code class=char>U+10FFFF</code> in
233 <var>s</var>, then replace it by string <code>\<var>HHHHHH</var></code>, where
234 <dfn id=var-HHHHHH><var>HHHHHH</var></dfn> is the upper$B!>(Bcase zero$B!>(Bpadded
235 hexadecimal representation of the character. If the character
236 is outside the range of <code>[<code class=char>U+0000</code>,
237 <code class=char>U+10FFFF</code>]</code>, <var>HHHHHH</var>
238 <em class=rfc2119>MUST</em> be <code>FFFFFF</code>.</p></li>
239 <li><p>Insert a <code class=char>U+0022</code> <code class=charname>QUOTATION
240 MARK</code> (<code class=char>"</code>) at the beginning of
241 <var>s</var>.</p></li>
242 <li><p>Insert a <code class=char>U+0022</code> <code class=charname>QUOTATION
243 MARK</code> (<code class=char>"</code>) at the end of <var>s</var>.</p></li>
244 <li><p>Then, <var>s</var> is the result of the algorithm.</p></li>
245 </ol>
246
247 <p>A <dfn id=newline title=newline>newline</dfn>
248 <em class=rfc2119>SHOULD</em> be represented as a
249 <code class=char>U+000A</code> <code class=charname>LINE FEED</code>
250 character. However, depending on the context where
251 the <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
252 representation is in use, a sequence of
253 <code class=char>U+000D</code> <code class=charname>CARRIAGE RETURN</code>
254 followed by a <code class=char>U+000A</code>
255 <code class=charname>LINE FEED</code> (i.e. a
256 <code>CRLF</code> sequence) or a character
257 <code class=char>U+000D</code> <code class=charname>CARRIAGE RETURN</code>
258 <em class=rfc2119>MAY</em> be used as a <a href="#newline">newline</a> instead.
259 <a href="#newline">Newline</a> representations
260 <em class=rfc2119>SHOULD</em> be consistent in an
261 <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
262 representation.</p>
263
264 <div class="note memo">
265 <p>Therefore, newlines must be normalized before
266 <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
267 representations are literally compared.</p>
268 </div>
269
270 </div>
271
272
273 <div class=section id=serializing-simple-selectors>
274 <h3>Serializing Simple Selectors</h3>
275
276 <p>To
277 <dfn id=algorithm-serialize-a-simple-selector title="serialize a simple selector">serialize
278 a simple selector (<dfn><var id=var-ss>ss</var></dfn>)</dfn>:</p>
279 <dl class=switch>
280 <dt>If <var>ss</var> is a type or universal selector</dt>
281 <dd>
282 <ol>
283 <li>
284 <dl class=switch>
285 <dt>If a namespace URI is specified (via namespace prefix, or
286 by omitting namespace prefix where a default namespace is specified)</dt>
287 <dd class="ed">@@</dd>
288 <dt>If the null namespace is specified (by zero$B!>(Blength namespace
289 prefix)</dt>
290 <dd>Append a <code class=char>U+007C</code>
291 <code class=charname>VERTICAL BAR</code> (<code class=char>|</code>)
292 character to <var>result</var>.</dd>
293 <dt>If no namespace is specified (by namespace prefix <code>*</code>,
294 or by omitting namespace prefix where no default namespace is
295 specified)</dt>
296 <dd>Append a <code class=char>U+002A</code>
297 <code class=charname>ASTERISK</code> (<code class=char>*</code>)
298 character, followed by a <code class=char>U+007C</code>
299 <code class=charname>VERTICAL BAR</code> (<code class=char>|</code>)
300 character, to <var>result</var>.</dd>
301 </dl>
302 </li>
303 <li>If <var>ss</var> is a type selector, append the
304 <a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a>
305 local name to <var>result</var>.</li>
306 <li>If <var>ss</var> is a universal selector, append
307 a <code class=char>U+002A</code> <code class=charname>ASTERISK</code>
308 (<code class=char>*</code>) character to <var>result</var>.</li>
309 </ol>
310 </dd>
311 <dt>If <var>ss</var> is an attribute selector</dt>
312 <dd>
313 <ol>
314 <li>Append a <code class=char>U+005B</code> <code class=charname>LEFT
315 SQUARE BRACKET</code> (<code class=char>[</code>) to
316 <var>result</var>.</li>
317 <li>
318 Append a namespace prefix as following:
319 <dl>
320 <dt>If a namespace URI is specified</dt>
321 <dd class=ed>@@</dd>
322 <dd class=ed>@@ Current reference implementation is wrong,
323 since its result of sorting depends on namespace prefix.</dd>
324 <dt>If the null namespace is specified</dt>
325 <dd>Append a <code class=char>U+007C</code>
326 <code class=charname>VERTICAL BAR</code> character to
327 <var>result</var>.</dd>
328 <dt>If no namespace is specified</dt>
329 <dd>Append a <code class=char>U+002A</code>
330 <code class=charname>ASTERISK</code> (<code class=char>*</code>)
331 character, followed by a <code class=char>U+007C</code>
332 <code class=charname>VERTICAL BAR</code> (<code class=char>|</code>)
333 character, to <var>result</var>.</dd>
334 </dl>
335 </li>
336 <li>Append the
337 <a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a>
338 local name to <var>result</var>.</li>
339 <li>If a value is specified in <var>ss</var>:
340 <ol>
341 <li>Depending on the way to match, append <code>=</code>,
342 <code>~=</code>, <code>|=</code>, <code>^=</code>,
343 <code>$=</code>, or <code>*=</code> to <var>result</var>.</li>
344 <li>Append the
345 <a href="#algorithm-normalize-a-string" title="normalize a string">normalized</a>
346 value to <var>result</var>.</li>
347 </ol>
348 </li>
349 <li>Append a <code class=char>U+005D</code> <code class=charname>RIGHT
350 SQUARE BRACKET</code> (<code class=char>]</code>) to
351 <var>result</var>.</li>
352 </ol>
353 </dd>
354 <dt>If <var>ss</var> is a class selector</dt>
355 <dd>Append a <code class=char>U+002E</code> <code class=charname>FULL
356 STOP</code> (<code class=char>.</code>) character, followed
357 by <a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a>
358 class name, <var>result</var>.</dd>
359 <dt>If <var>ss</var> is an <abbr>ID</abbr> selector</dt>
360 <dd>Append a <code class=char>U+0023</code> <code class=charname>NUMBER
361 SIGN</code> (<code class=char>#</code>) character, followed
362 by <a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a>
363 <abbr>ID</abbr>, to <var>result</var>.</dd>
364 <dt>If <var>ss</var> is a pseudo$B!>(Bclass selector</dt>
365 <dd>
366 <ol>
367 <li>Append a <code class=char>U+003A</code>
368 <code class=charname>COLON</code> (<code class=char>:</code>) character
369 to <var>result</var>.</li>
370 <li>Append the
371 <a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a>
372 name of the pseudo$B!>(Bclass to <var>result</var>.</li>
373 <li>Append any arguments as following:
374 <dl class=switch>
375 <dt>If the name of the pseudo$B!>(Bclass is <code>lang</code></dt>
376 <dd>
377 <ol>
378 <li>Append a <code class=char>U+0028</code> <code class=charname>LEFT
379 PARENTHESIS</code> (<code class=char>(</code>) character
380 to <var>result</var>.</li>
381 <li>Append the
382 <a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a>
383 language tag (the argument) to <var>result</var>.</li>
384 <li>Append a <code class=char>U+0029</code>
385 <code class=charname>RIGHT PARENTHESIS</code>
386 (<code class=char>)</code>) character
387 to <var>result</var>.</li>
388 </ol>
389 </dd>
390 <dt>If the name of the pseudo$B!>(Bclass is
391 <code>-manakai-contains</code></dt>
392 <dd>
393 <ol>
394 <li>Append a <code class=char>U+0028</code> <code class=charname>LEFT
395 PARENTHESIS</code> (<code class=char>(</code>) character
396 to <var>result</var>.</li>
397 <li>Append the
398 <a href="#algorithm-normalize-a-string" title="normalize a string">normalized</a>
399 string (the argument) to <var>result</var>.</li>
400 <li>Append a <code class=char>U+0029</code>
401 <code class=charname>RIGHT PARENTHESIS</code>
402 (<code class=char>)</code>) character
403 to <var>result</var>.</li>
404 </ol>
405 </dd>
406 <dt>If name of the pseudo$B!>(Bclass is either <code>nth-child</code>,
407 <code>nth-last-child</code>, <code>nth-of-type</code>, or
408 <code>nth-last-of-type</code></dt>
409 <dd>
410 <ol>
411 <li>Append a <code class=char>U+0028</code> <code class=charname>LEFT
412 PARENTHESIS</code> (<code class=char>(</code>) character
413 to <var>result</var>.</li>
414 <li>Append <span class=ed>@@ normalized</span>
415 integer <var>a</var> to <var>result</var>.
416 If the argument is a keyword <code>odd</code> or <code>even</code>,
417 <var>a</var> is <code>2</code>. If <var>a</var> and
418 <code>n</code> is omitted, <var>a</var> is assumed as
419 <code>0</code>. Otherwise, if <var>a</var> is omitted,
420 it is assumed as <code>1</code> (or <code>-1</code>,
421 if there is a <code class=char>U+002D</code>
422 <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>)
423 character).</li>
424 <li>Append a <code class=char>U+006E</code>
425 <code class=charname>LATIN SMALL LETTER N</code>
426 (<code class=char>n</code>) character to <var>result</var>.</li>
427 <li>Append <span class=ed>@@ normalized</span>
428 integer <var>b</var> to <var>result</var>.
429 It <em class=rfc2119>MUST</em> be preceded by a sign,
430 either <code class=char>U+002B</code> <code class=charname>PLUS
431 SIGN</code> (<code class=char>+</code>) or
432 <code class=char>U+002D</code>
433 <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>)
434 character. If the argument is a keyword <code>odd</code>,
435 <var>b</var> is <code>1</code>. If the argument
436 is a keyword <code>even</code>, <var>b</var> is
437 <code>0</code>. If <var>b</var> is omitted, it is assumed as
438 <code>0</code>. The sign of <code>0</code>
439 <em class=rfc2119>MUST</em> be <code class=char>U+002B</code>
440 <code class=charname>PLUS SIGN</code>
441 (<code class=char>+</code>).</li>
442 <li>Append a <code class=char>U+0029</code>
443 <code class=charname>RIGHT PARENTHESIS</code>
444 (<code class=char>)</code>) character
445 to <var>result</var>.</li>
446 </ol>
447 </dd>
448 <dt>If the name of the pseudo$B!>(Bclass is <code>not</code></dt>
449 <dd>
450 <ol>
451 <li>Append a string of <code class=char>U+003A</code>
452 <code class=charname>COLON</code>, <code class=char>U+006E</code>
453 <code class=charname>LATIN SMALL LETTER N</code>,
454 <code class=char>U+006F</code> <code class=charname>LATIN
455 SMALL LETTER O</code>, <code class=char>U+0074</code>
456 <code class=charname>LATIN SMALL LETTER T</code>, and
457 <code class=char>U+0028</code> <code class=charname>LEFT
458 PARENTHESIS</code> (<code>:not(</code>), followed by a
459 <a href="#newline">newline</a>, to <var>result</var>.</li>
460 <li>Append four <code class=char>U+0020</code>
461 <code class=charname>SPACE</code> characters to
462 <var>result</var>.</li>
463 <li>Append four <code class=char>U+0020</code>
464 <code class=charname>SPACE</code> characters to
465 <var>result</var> again.</li>
466 <li><a href="#algorithm-serialize-a-simple-selector">Serialize
467 the simple selector specified as the argument to the
468 <code>not</code> pseudo$B!>(Bclass</a>.</li>
469 <li>Append a <a href="#newline">newline</a> to
470 <var>result</var>.</li>
471 <li>Append four <code class=char>U+0020</code>
472 <code class=charname>SPACE</code> characters to
473 <var>result</var>.</li>
474 <li>Append a <code class=char>U+0029</code>
475 <code class=charname>RIGHT PARENTHESIS</code>
476 (<code class=char>)</code>) character
477 to <var>result</var>.</li>
478 </ol>
479 </dd>
480 </dl>
481 </li>
482 </ol>
483 </dd>
484 <dt>If <var>ss</var> is a pseudo$B!>(Belement</dt>
485 <dd>
486 <ol>
487 <li>Append two <code class=char>U+003A</code>
488 <code class=charname>COLON</code> characters (<code>::</code>)
489 to <var>result</var>.</li>
490 <li>Append the
491 <a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a>
492 name of the pseudo$B!>(Belement to <var>result</var>.</li>
493 <!-- For future version: append "(", arguments, ")", if any. -->
494 </ol>
495 </dd>
496 </dl>
497
498 </div>
499
500 <div class=section id=serializing-groups-of-selectors>
501 <h3>Serializing Groups of Selectors</h3>
502
503 <p>No <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
504 representation is defined for an invalid group of selectors.</p>
505
506 <div class="note memo">
507 <p>The serialized representation will not contain any comment.</p>
508 </div>
509
510 <!-- TODO: link terms to Selectors -->
511
512 <p>To
513 <dfn id=algorithm-serialize-a-group-of-selectors title="serialize a group of selectors">serialize
514 a group of selectors (<dfn id=var-gs><var>gs</var></dfn>)</dfn>:</p>
515 <ol>
516 <li>Let <dfn id=var-result><var>result</var></dfn> an empty string.</li>
517 <li>For each selector (<dfn id=var-selector><var>selector</var></dfn>) in
518 <var>gs</var>:
519 <ol>
520 <li>If <var>selector</var> is <em>not</em> the first selector
521 in the group of selectors, then append a <code class=char>U+002C</code>
522 <code class=charname>COMMA</code> (<code class=char>,</code>) followed by a
523 <a href="#newline">newline</a> to <var>result</var>.</li>
524 <li>Append four <code class=char>U+0020</code>
525 <code class=charname>SPACE</code> characters to <var>result</var>.</li>
526 <li>Process each sequence of simple selectors or
527 combinator in <var>selector</var> by following algorithm:
528 <dl class=switch>
529 <dt>If it is a sequence of simle selector
530 (<dfn id=var-sss><var>sss</var></dfn>)</dt>
531 <dd>
532 <ol>
533 <li class=ed><a href="#algorithm-serialize-a-simple-selector">Serialize
534 each simple selector</a> in <var>sss</var>.</li>
535 <li class=ed>sort</li>
536 <li>Append a <a href="#newline">newline</a> to <var>result</var>.</li>
537 </ol>
538 </dd>
539 <dt>If it is a combinator (<dfn id=var-c><var>c</var></dfn>)</dt>
540 <dd>
541 <ol>
542 <li>Append two <code class=char>U+0020</code>
543 <code class=charname>SPACE</code> characters to <var>result</var>.</li>
544 <li>
545 <dl class=switch>
546 <dt>If <var>c</var> is descendant combinator (white space)</dt>
547 <dd>Append a <code class=char>U+0020</code>
548 <code class=charname>SPACE</code> character to
549 <var>result</var>.</dd>
550 <dt>If <var>c</var> is child combinator
551 (<code class=char>></code>)</dt>
552 <dd>Append a <code class=char>U+003E</code>
553 <code class=charname>GREATER-THAN SIGN</code>
554 (<code class=char>></code>) character to <var>result</var>.</dd>
555 <dt>If <var>c</var> is adjacent sibling combinator
556 (<code class=char>+</code>)</dt>
557 <dd>Append a <code class=char>U+002B</code>
558 <code class=charname>PLUS SIGN</code> (<code class=char>+</code>)
559 character to <var>result</var>.</dd>
560 <dt>If <var>c</var> is general sibling combinator
561 (<code class=char>~</code>)</dt>
562 <dd>Append a <code class=char>U+007E</code>
563 <code class=charname>TILDE</code> (<code class=char>~</code>)
564 character to <var>result</var>.</dd>
565 </dl>
566 </li>
567 <li>Append a <code class=char>U+0020</code>
568 <code class=charname>SPACE</code> character to
569 <var>result</var>.</li>
570 </ol>
571 </dd>
572 </dl>
573 </ol>
574 </li>
575 <li>Then, <var>result</var> is the
576 <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
577 representation of <var>gs</var>.</li>
578 </ol>
579
580 </div>
581
582 </div>
583
584 <div class="section" id="parsing">
585 <h2>Parsing
586 <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
587 Groups of Selectors</h2>
588
589 <p>Since <a href="#serializing">the serializing algorithm</a> is
590 so designed that it always output a valid
591 <a href="http://www.w3.org/TR/css3-selectors/#grouping">group of
592 selectors</a>, no special parser for the
593 <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
594 representation is necessary. Any conforming parser for
595 <a href="http://www.w3.org/TR/css3-selectors/#grouping">groups of
596 selectors</a> <em class=rfc2119>MAY</em> be used
597 to parse <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
598 representations of groups of selectors.</p>
599 </div>
600
601 <div class="section" id="examples">
602 <h2>Examples</h2>
603
604 <p class=section-info>This section is <em>non$B!>(Bnormative</em>.</p>
605
606 <div class="ed issue">
607 <p><a href="http://suika.fam.cx/gate/2007/css/parser-interface">Try demo</a>,
608 by choosing <q>Selectors</q> radio button.</p>
609
610 <div class="example figure block">
611 <div class="caption">...</div>
612
613 <pre><code>...</code></pre>
614 </div>
615
616 </div>
617
618 </div>
619
620 <div id="references" class="section reference">
621 <h2>References</h2>
622
623 <div id="normative-references" class="section normative reference">
624 <h3>Normative References</h3>
625
626 <dl>
627 <dt id="ref-KEYWORDS">KEYWORDS</dt>
628 <dd><cite><a href="urn:ietf:rfc:2119">Key words for use in
629 <abbr>RFCs</abbr> to Indicate Requirement Levels</a></cite>,
630 <abbr title="Internet Engineering Task Force">IETF</abbr>
631 <a href="urn:ietf:bcp:14"><abbr title="Best Current Practice">BCP</abbr>
632 14</a>, <abbr title="Request for Comments">RFC</abbr> 2119,
633 <time datetime=1997-03>March 1997</time>.
634 This version of the specification is referenced</dd>
635 <dt id=ref-SELECTORS>SELECTORS</dt>
636 <dd><a href="http://www.w3.org/TR/2005/WD-css3-selectors-20051215"><cite>Selectors</cite></a>,
637 <abbr title="World Wide Web Consortium">W3C</abbr> Working Draft,
638 <time datetime=2005-12-15>15 December 2005</time>. Work in progress.
639 <a href="http://www.w3.org/TR/css3-selectors">The latest version</a>
640 of the specification is referenced.</dd>
641 </dl>
642 </div>
643
644 <div id="informative-references" class="section informative reference">
645 <h3>Non$B!>(Bnormative References</h3>
646
647 <dl>
648 <dt id=ref-CSS>CSS</dt>
649 <dd><cite><a href="http://www.w3.org/TR/2007/CR-CSS21-20070719">Cascading
650 Style Sheets Level 2 Revision 1 (<abbr>CSS</abbr> 2.1)
651 Specification</a></cite>,
652 <abbr title="World Wide Web Consortium">W3C</abbr> Candidate
653 Recommendation, <time datetime=2007-07-19>19 July 2007</time>.
654 Work in progress. The latest version of the specification is
655 available at
656 <code class=URI>&lt;<a href="http://www.w3.org/TR/CSS21">http://www.w3.org/TR/CSS21</a>></code>.</dd>
657 <dt id=ref-CSSOM>CSSOM</dt>
658 <dd><cite><a href="http://dev.w3.org/cvsweb/~checkout~/csswg/cssom/Overview.html?rev=1.55&amp;content-type=text/html;%20charset=utf-8">Cascading
659 Style Sheets Object Model (<abbr>CSSOM</abbr>)</a></cite>,
660 <abbr title="World Wide Web Consortium">W3C</abbr> Editor's Draft,
661 <time datetime=2007-06-18>18 June 2007</time>. Work in progress.
662 The latest Editor's Draft of the specification is available at
663 <code class=URI>&lt;<a href="http://dev.w3.org/csswg/cssom/Overview.html">http://dev.w3.org/csswg/cssom/Overview.html</a>></code>.</dd>
664 <dt id=ref-HTML5>HTML5</dt>
665 <dd><cite><a href="http://whatwg.org/html5"><abbr>HTML</abbr> 5</a></cite>,
666 <abbr title="Web Hypertext Application Technology Working Group">WHATWG</abbr>
667 Working Draft. Work in progress.</dd>
668 <dt id=ref-SAPI>SAPI</dt>
669 <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>,
670 <abbr title="World Wide Web Consortium">W3C</abbr> Editor's Draft,
671 <time datetime=2007-08-29>29 August 2007</time>. Work in progress.
672 The latest Editor's Draft of the specification is available at
673 <code class=URI>&lt;<a href="http://dev.w3.org/2006/webapi/selectors-api/Overview.html">http://dev.w3.org/2006/webapi/selectors-api/Overview.html</a>></code>.
674 The latest published version of the specification is available at
675 <code class=URI>&lt;<a href="http://www.w3.org/TR/selectors-api/">http://www.w3.org/TR/selectors-api/</a>></code>.</dd>
676 <dt id=ref-XBL2>XBL2</dt>
677 <dd><cite><a href="http://www.mozilla.org/projects/xbl/xbl2.html"><abbr>XBL</abbr>
678 2.0</a></cite>, Mozilla.org, <time datetime=2007-03-15>15 Mar 2007</time>.
679 Work in progress. The latest
680 <abbr title="World Wide Web Consortium">W3C</abbr>$B!>(Bpublished
681 version of the specification is available at
682 <code class=URI>&lt;<a href="http://www.w3.org/TR/xbl/">http://www.w3.org/TR/xbl/</a>></code>.</dd>
683 </dl>
684 </div>
685
686 </div>
687
688 </body>
689 </html>

admin@suikawiki.org
ViewVC Help
Powered by ViewVC 1.1.24