128 |
2119</a> |
2119</a> |
129 |
<cite class="bibref normative">[<a href="#ref-KEYWORDS">KEYWORDS</a>]</cite>.</p> |
<cite class="bibref normative">[<a href="#ref-KEYWORDS">KEYWORDS</a>]</cite>.</p> |
130 |
|
|
131 |
|
<p>Requirements phrased in the imperative as part of algorithms are to be |
132 |
|
interpreted with the meaning of the key word (<em class=rfc2119>MUST</em>) |
133 |
|
used in introducing the algorithm.</p> |
134 |
|
|
135 |
|
<p>Conformance requirements phrased as algorithms or specific steps |
136 |
|
<em class=rfc2119>MAY</em> be implemented in any manner, so long as the end |
137 |
|
result is equivalent.</p> |
138 |
|
|
139 |
<!-- Strictly speaking the paragraph below is not part of terminology. --> |
<!-- Strictly speaking the paragraph below is not part of terminology. --> |
140 |
<p>All examples and notes in this specification are non$B!>(Bnormative, |
<p>All examples and notes in this specification are non$B!>(Bnormative, |
141 |
as are all sections explicitly marked non$B!>(Bnormative. Everything |
as are all sections explicitly marked non$B!>(Bnormative. Everything |
148 |
</div> |
</div> |
149 |
|
|
150 |
<div class="section" id="serializing"> |
<div class="section" id="serializing"> |
151 |
<h2>Serializing in |
<h2>Serializing Selectors in |
152 |
<abbr title="Selectors Serialization Format for Testing">SSFT</abbr> |
<abbr title="Selectors Serialization Format for Testing">SSFT</abbr> |
153 |
Representation</h2> |
Representation</h2> |
154 |
|
|
155 |
|
<p>Subsections of this section define algorithms |
156 |
|
to <a href="#algorithm-serialize-a-simple-selector">serialize a simple |
157 |
|
selector</a> or <a href="#algorithm-serialize-a-group-of-selectors">serialize |
158 |
|
a group of selectors</a>.</p> |
159 |
|
|
160 |
<div class="issue ed"> |
<div class="issue ed"> |
161 |
<p><a href="http://suika.fam.cx/gate/cvs/*checkout*/markup/html/whatpm/Whatpm/CSS/SelectorsSerializer.pm">See the reference implementation</a> |
<p><a href="http://suika.fam.cx/gate/cvs/*checkout*/markup/html/whatpm/Whatpm/CSS/SelectorsSerializer.pm">See |
162 |
for now.</p> |
also the reference implementation</a> for now.</p> |
163 |
</div> |
</div> |
164 |
|
|
|
<div class=section id=serializing-groups-of-selectors> |
|
|
<h3>Serializing Groups of Selectors</h3> |
|
|
|
|
|
<p>No <abbr title="Selectors Serialization Format for Testing">SSFT</abbr> |
|
|
representation is defined for an invalid group of selectors.</p> |
|
|
|
|
165 |
<div class="note memo"> |
<div class="note memo"> |
166 |
<p>The serialized representation will not contain any comment.</p> |
<p>The serialized representation will not contain any comment.</p> |
167 |
</div> |
</div> |
|
|
|
168 |
<!-- TODO: link terms to Selectors --> |
<!-- TODO: link terms to Selectors --> |
169 |
|
|
170 |
<p>To |
<div class=section id=serializing-tokens> |
171 |
<dfn id=algorithm-serialize-a-group-of-selectors title="serialize a group of selectors">serialize |
<h3>Serializing Tokens</h3> |
172 |
a group of selectors (<dfn id=var-gs><var>gs</var></dfn>)</dfn>:</p> |
|
173 |
|
<p>To <dfn id=algorithm-normalize-an-ident title="normalize an IDENT">normalize |
174 |
|
an <code>IDENT</code> (<dfn id=var-n><var>n</var></dfn>)</dfn>, |
175 |
|
the following algorithm <em class=rfc2119>MUST</em> be used:</p> |
176 |
<ol> |
<ol> |
177 |
<li>Let <dfn id=var-result><var>result</var></dfn> an empty string.</li> |
<li>Replace the escape sequences (<code>\</code> and following |
178 |
<li>For each selector (<dfn id=var-selector><var>selector</var></dfn>) in |
characters) in <var>n</var> by characters represented by them |
179 |
<var>gs</var>: |
respectively.</li> |
180 |
<ol> |
<li>If there is any character that is <em>not</em> one of |
181 |
<li>If <var>selector</var> is <em>not</em> the first selector |
<code class=char>U+002D</code> <code class=charname>HYPHEN-MINUS</code> |
182 |
in the group of selectors, then append a <code class=char>U+002C</code> |
(<code class=char>-</code>), <code class=char>U+0030</code> |
183 |
<code class=charname>COMMA</code> (<code class=char>,</code>) followed by a |
<code class=charname>DIGIT ZERO</code> |
184 |
<a href="#newline">newline</a> to <var>result</var>.</li> |
(<code class=char>0</code>) to <code class=char>U+0039</code> |
185 |
<li>Append four <code class=char>U+0020</code> |
<code class=charname>DIGIT NINE</code> (<code class=char>9</code>), |
186 |
<code class=charname>SPACE</code> characters to <var>result</var>.</li> |
<code class=char>U+0041</code> <code class=charname>LATIN CAPITAL LETTER |
187 |
<li>Process each sequence of simple selectors or |
A</code> (<code class=char>A</code>) to <code class=char>U+005A</code> |
188 |
combinator in <var>selector</var> by following algorithm: |
<code class=charname>LATIN CAPITAL LETTER Z</code> (<code class=char>Z</code>), |
189 |
<dl class=switch> |
<code class=char>U+005F</code> <code class=charname>LOW LINE</code> |
190 |
<dt>If it is a sequence of simle selector |
(<code class=char>_</code>), <code class=char>U+0061</code> |
191 |
(<dfn id=var-sss><var>sss</var></dfn>)</dt> |
<code class=charname>LATIN SMALL LETTER A</code> |
192 |
<dd> |
(<code class=char>a</code>) to <code class=char>U+006A</code> |
193 |
<ol> |
<code class=charname>LATIN SMALL LETTER Z</code> (<code class=char>z</code>), |
194 |
<li class=ed><a href="#algorithm-serialize-a-simple-selector">Serialize |
<code class=char>U+0080</code> to <code class=char>U+D7FF</code>, or |
195 |
each simple selector</a> in <var>sss</var>.</li> |
<code class=char>U+E000</code> to <code class=char>U+10FFFF</code> in |
196 |
<li class=ed>sort</li> |
<var>n</var>, then replace it by string <code>\<var>HHHHHH</var></code>, where |
197 |
<li>Append a <a href="#newline">newline</a> to <var>result</var>.</li> |
<dfn id=var-HHHHHH><var>HHHHHH</var></dfn> is the upper$B!>(Bcase zero$B!>(Bpadded |
198 |
</ol> |
hexadecimal representation of the character. If the character |
199 |
</dd> |
is outside the range of <code>[<code class=char>U+0000</code>, |
200 |
<dt>If it is a combinator (<dfn id=var-c><var>c</var></dfn>)</dt> |
<code class=char>U+10FFFF</code>]</code>, <var>HHHHHH</var> |
201 |
<dd> |
<em class=rfc2119>MUST</em> be <code>FFFFFF</code>.</li> |
202 |
<ol> |
<li>If the first character in <var>n</var> is one of |
203 |
<li>Append two <code class=char>U+0020</code> |
<code class=char>U+0030</code> <code class=charname>DIGIT ZERO</code> |
204 |
<code class=charname>SPACE</code> characters to <var>result</var>.</li> |
(<code class=char>0</code>) to <code class=char>U+0039</code> |
205 |
<li> |
<code class=charname>DIGIT NINE</code> (<code class=char>9</code>), |
206 |
<dl class=switch> |
then prepend a string <code>\00003</code> at the beginning of |
207 |
<dt>If <var>c</var> is descendant combinator (white space)</dt> |
<var>n</var>.</li> |
208 |
<dd>Append a <code class=char>U+0020</code> |
<li>If the first character in <var>n</var> is <code class=char>U+002D</code> |
209 |
<code class=charname>SPACE</code> character to |
<code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>) and |
210 |
<var>result</var>.</dd> |
the second character, if any, is <em>not</em> one of |
211 |
<dt>If <var>c</var> is child combinator |
<code class=char>U+0041</code> <code class=charname>LATIN CAPITAL LETTER |
212 |
(<code class=char>></code>)</dt> |
A</code> (<code class=char>A</code>) to <code class=char>U+005A</code> |
213 |
<dd>Append a <code class=char>U+003E</code> |
<code class=charname>LATIN CAPITAL LETTER Z</code> (<code class=char>Z</code>), |
214 |
<code class=charname>GREATER-THAN SIGN</code> |
<code class=char>U+005F</code> <code class=charname>LOW LINE</code> |
215 |
(<code class=char>></code>) character to <var>result</var>.</dd> |
(<code class=char>_</code>), <code class=char>U+0061</code> |
216 |
<dt>If <var>c</var> is adjacent sibling combinator |
<code class=charname>LATIN SMALL LETTER A</code> |
217 |
(<code class=char>+</code>)</dt> |
(<code class=char>a</code>) to <code class=char>U+006A</code> |
218 |
<dd>Append a <code class=char>U+002B</code> |
<code class=charname>LATIN SMALL LETTER Z</code> (<code class=char>z</code>), |
219 |
<code class=charname>PLUS SIGN</code> (<code class=char>+</code>) |
<code>U+0080</code> to <code>U+D7FF</code>, or |
220 |
character to <var>result</var>.</dd> |
<code>U+E000</code> to <code>U+10FFFF</code>, or |
221 |
<dt>If <var>c</var> is general sibling combinator |
<var>n</var> is equal to <code class=char>U+002D</code> |
222 |
(<code class=char>~</code>)</dt> |
<code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>), then |
223 |
<dd>Append a <code class=char>U+007E</code> |
replace the <code class=char>U+002D</code> |
224 |
<code class=charname>TILDE</code> (<code class=char>~</code>) |
<code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>) |
225 |
character to <var>result</var>.</dd> |
character by string <code>\00002D</code>.</li> |
226 |
</dl> |
<li>Then, <var>n</var> is the result of the algorithm.</li> |
|
</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> |
|
227 |
</ol> |
</ol> |
228 |
|
|
229 |
|
<p>To <dfn id=algorithm-normalize-a-string title="normalize a STRING">normalize |
230 |
|
a <code>STRING</code> (<dfn id=var-s><var>s</var></dfn>)</dfn>, |
231 |
|
the following algorithm <em class=rfc2119>MUST</em> be used:</p> |
232 |
|
<ol> |
233 |
|
<li><p>Replace the escape sequences (<code>\</code> and following |
234 |
|
characters) in <var>s</var> by characters represented by them |
235 |
|
(or an empty string if <code>\</code> is immediately followed by |
236 |
|
newline character(s)) respectively.</p></li> |
237 |
|
<li><p>Remove the quotation characters in <var>s</var> |
238 |
|
if <var>s</var> is a <code>STRING</code>.</p> |
239 |
|
|
240 |
|
<div class="note memo"> |
241 |
|
<p>The input <var>s</var> to this algorithm may be an |
242 |
|
<code>IDENT</code>.</p> |
243 |
|
</div></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"> |
285 |
|
<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> |
289 |
|
|
290 |
|
<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> |
</div> |
294 |
|
|
295 |
|
</div> |
296 |
|
|
297 |
|
|
298 |
<div class=section id=serializing-simple-selectors> |
<div class=section id=serializing-simple-selectors> |
299 |
<h3>Serializing Simple Selectors</h3> |
<h3>Serializing Simple Selectors</h3> |
300 |
|
|
301 |
|
<p>No <abbr title="Selectors Serialization Format for Testing">SSFT</abbr> |
302 |
|
representation is defined for an invalid <a href="#simple-selector">simple |
303 |
|
selector</a>.</p> |
304 |
|
|
305 |
<p>To |
<p>To |
306 |
<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 |
307 |
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>, |
308 |
|
the following algorithm <em class=rfc2119>MUST</em> be used:</p> |
309 |
|
<ol> |
310 |
|
<li>Let <dfn id=var-r><var>r</var></dfn> an empty string.</li> |
311 |
|
<li>Process <var>ss</var> as following: |
312 |
|
|
313 |
<dl class=switch> |
<dl class=switch> |
314 |
<dt>If <var>ss</var> is a type or universal selector</dt> |
<dt>If <var>ss</var> is a type or universal selector</dt> |
315 |
<dd> |
<dd> |
316 |
<ol> |
<ol> |
317 |
<li> |
<li>Append a namespace prefix as following: |
318 |
|
|
319 |
<dl class=switch> |
<dl class=switch> |
320 |
<dt>If a namespace URI is specified (via namespace prefix, or |
<dt>If a namespace URI is specified (via namespace prefix, or |
321 |
by omitting namespace prefix where a default namespace is specified)</dt> |
by omitting namespace prefix where a default namespace is specified)</dt> |
324 |
prefix)</dt> |
prefix)</dt> |
325 |
<dd>Append a <code class=char>U+007C</code> |
<dd>Append a <code class=char>U+007C</code> |
326 |
<code class=charname>VERTICAL BAR</code> (<code class=char>|</code>) |
<code class=charname>VERTICAL BAR</code> (<code class=char>|</code>) |
327 |
character to <var>result</var>.</dd> |
character to <var>r</var>.</dd> |
328 |
<dt>If no namespace is specified (by namespace prefix <code>*</code>, |
<dt>If no namespace is specified (by namespace prefix <code>*</code>, |
329 |
or by omitting namespace prefix where no default namespace is |
or by omitting namespace prefix where no default namespace is |
330 |
specified)</dt> |
specified)</dt> |
332 |
<code class=charname>ASTERISK</code> (<code class=char>*</code>) |
<code class=charname>ASTERISK</code> (<code class=char>*</code>) |
333 |
character, followed by a <code class=char>U+007C</code> |
character, followed by a <code class=char>U+007C</code> |
334 |
<code class=charname>VERTICAL BAR</code> (<code class=char>|</code>) |
<code class=charname>VERTICAL BAR</code> (<code class=char>|</code>) |
335 |
character, to <var>result</var>.</dd> |
character, to <var>r</var>.</dd> |
336 |
</dl> |
</dl> |
337 |
</li> |
</li> |
338 |
<li>If <var>ss</var> is a type selector, append the |
<li>If <var>ss</var> is a type selector, append the |
339 |
<a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a> |
<a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a> |
340 |
local name to <var>result</var>.</li> |
local name to <var>r</var>.</li> |
341 |
<li>If <var>ss</var> is a universal selector, append |
<li>If <var>ss</var> is a universal selector, append |
342 |
a <code class=char>U+002A</code> <code class=charname>ASTERISK</code> |
a <code class=char>U+002A</code> <code class=charname>ASTERISK</code> |
343 |
(<code class=char>*</code>) character to <var>result</var>.</li> |
(<code class=char>*</code>) character to <var>r</var>.</li> |
344 |
</ol> |
</ol> |
345 |
</dd> |
</dd> |
346 |
<dt>If <var>ss</var> is an attribute selector</dt> |
<dt>If <var>ss</var> is an attribute selector</dt> |
348 |
<ol> |
<ol> |
349 |
<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 |
350 |
SQUARE BRACKET</code> (<code class=char>[</code>) to |
SQUARE BRACKET</code> (<code class=char>[</code>) to |
351 |
<var>result</var>.</li> |
<var>r</var>.</li> |
352 |
<li> |
<li> |
353 |
Append a namespace prefix as following: |
Append a namespace prefix as following: |
354 |
<dl> |
<dl> |
359 |
<dt>If the null namespace is specified</dt> |
<dt>If the null namespace is specified</dt> |
360 |
<dd>Append a <code class=char>U+007C</code> |
<dd>Append a <code class=char>U+007C</code> |
361 |
<code class=charname>VERTICAL BAR</code> character to |
<code class=charname>VERTICAL BAR</code> character to |
362 |
<var>result</var>.</dd> |
<var>r</var>.</dd> |
363 |
<dt>If no namespace is specified</dt> |
<dt>If no namespace is specified</dt> |
364 |
<dd>Append a <code class=char>U+002A</code> |
<dd>Append a <code class=char>U+002A</code> |
365 |
<code class=charname>ASTERISK</code> (<code class=char>*</code>) |
<code class=charname>ASTERISK</code> (<code class=char>*</code>) |
366 |
character, followed by a <code class=char>U+007C</code> |
character, followed by a <code class=char>U+007C</code> |
367 |
<code class=charname>VERTICAL BAR</code> (<code class=char>|</code>) |
<code class=charname>VERTICAL BAR</code> (<code class=char>|</code>) |
368 |
character, to <var>result</var>.</dd> |
character, to <var>r</var>.</dd> |
369 |
</dl> |
</dl> |
370 |
</li> |
</li> |
371 |
<li>Append the |
<li>Append the |
372 |
<a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a> |
<a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a> |
373 |
local name to <var>result</var>.</li> |
local name to <var>r</var>.</li> |
374 |
<li>If a value is specified in <var>ss</var>: |
<li>If a value is specified in <var>ss</var>: |
375 |
<ol> |
<ol> |
376 |
<li>Depending on the way to match, append <code>=</code>, |
<li>Depending on the way to match, append <code>=</code>, |
377 |
<code>~=</code>, <code>|=</code>, <code>^=</code>, |
<code>~=</code>, <code>|=</code>, <code>^=</code>, |
378 |
<code>$=</code>, or <code>*=</code> to <var>result</var>.</li> |
<code>$=</code>, or <code>*=</code> to <var>r</var>.</li> |
379 |
<li>Append the |
<li>Append the |
380 |
<a href="#algorithm-normalize-a-string" title="normalize a string">normalized</a> |
<a href="#algorithm-normalize-a-string" title="normalize a string">normalized</a> |
381 |
value to <var>result</var>.</li> |
value to <var>r</var>.</li> |
382 |
</ol> |
</ol> |
383 |
</li> |
</li> |
384 |
<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 |
385 |
SQUARE BRACKET</code> (<code class=char>]</code>) to |
SQUARE BRACKET</code> (<code class=char>]</code>) to |
386 |
<var>result</var>.</li> |
<var>r</var>.</li> |
387 |
</ol> |
</ol> |
388 |
</dd> |
</dd> |
389 |
<dt>If <var>ss</var> is a class selector</dt> |
<dt>If <var>ss</var> is a class selector</dt> |
390 |
<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 |
391 |
STOP</code> (<code class=char>.</code>) character, followed |
STOP</code> (<code class=char>.</code>) character, followed |
392 |
by <a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a> |
by <a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a> |
393 |
class name, <var>result</var>.</dd> |
class name, to <var>r</var>.</dd> |
394 |
<dt>If <var>ss</var> is an <abbr>ID</abbr> selector</dt> |
<dt>If <var>ss</var> is an <abbr>ID</abbr> selector</dt> |
395 |
<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 |
396 |
SIGN</code> (<code class=char>#</code>) character, followed |
SIGN</code> (<code class=char>#</code>) character, followed |
397 |
by <a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a> |
by <a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a> |
398 |
<abbr>ID</abbr>, to <var>result</var>.</dd> |
<abbr>ID</abbr>, to <var>r</var>.</dd> |
399 |
<dt>If <var>ss</var> is a pseudo$B!>(Bclass selector</dt> |
<dt>If <var>ss</var> is a pseudo$B!>(Bclass selector</dt> |
400 |
<dd> |
<dd> |
401 |
<ol> |
<ol> |
402 |
<li>Append a <code class=char>U+003A</code> |
<li>Append a <code class=char>U+003A</code> |
403 |
<code class=charname>COLON</code> (<code class=char>:</code>) character |
<code class=charname>COLON</code> (<code class=char>:</code>) character |
404 |
to <var>result</var>.</li> |
to <var>r</var>.</li> |
405 |
<li>Append the |
<li>Append the |
406 |
<a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a> |
<a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a> |
407 |
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 |
408 |
|
<var>r</var>.</li> |
409 |
<li>Append any arguments as following: |
<li>Append any arguments as following: |
410 |
<dl class=switch> |
<dl class=switch> |
411 |
<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> |
413 |
<ol> |
<ol> |
414 |
<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 |
415 |
PARENTHESIS</code> (<code class=char>(</code>) character |
PARENTHESIS</code> (<code class=char>(</code>) character |
416 |
to <var>result</var>.</li> |
to <var>r</var>.</li> |
417 |
<li>Append the |
<li>Append the |
418 |
<a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a> |
<a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a> |
419 |
language tag (the argument) to <var>result</var>.</li> |
language tag (the argument) to <var>r</var>. |
420 |
|
<span class="issue ed">Should we normalize cases?</span></li> |
421 |
<li>Append a <code class=char>U+0029</code> |
<li>Append a <code class=char>U+0029</code> |
422 |
<code class=charname>RIGHT PARENTHESIS</code> |
<code class=charname>RIGHT PARENTHESIS</code> |
423 |
(<code class=char>)</code>) character |
(<code class=char>)</code>) character |
424 |
to <var>result</var>.</li> |
to <var>r</var>.</li> |
425 |
</ol> |
</ol> |
426 |
</dd> |
</dd> |
427 |
<dt>If the name of the pseudo$B!>(Bclass is |
<dt>If the name of the pseudo$B!>(Bclass is |
430 |
<ol> |
<ol> |
431 |
<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 |
432 |
PARENTHESIS</code> (<code class=char>(</code>) character |
PARENTHESIS</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-a-string" title="normalize a string">normalized</a> |
<a href="#algorithm-normalize-a-string" title="normalize a string">normalized</a> |
436 |
string (the argument) to <var>result</var>.</li> |
string (the argument) to <var>r</var>.</li> |
437 |
<li>Append a <code class=char>U+0029</code> |
<li>Append a <code class=char>U+0029</code> |
438 |
<code class=charname>RIGHT PARENTHESIS</code> |
<code class=charname>RIGHT PARENTHESIS</code> |
439 |
(<code class=char>)</code>) character |
(<code class=char>)</code>) character |
440 |
to <var>result</var>.</li> |
to <var>r</var>.</li> |
441 |
</ol> |
</ol> |
442 |
</dd> |
</dd> |
443 |
<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>, |
447 |
<ol> |
<ol> |
448 |
<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 |
449 |
PARENTHESIS</code> (<code class=char>(</code>) character |
PARENTHESIS</code> (<code class=char>(</code>) character |
450 |
to <var>result</var>.</li> |
to <var>r</var>.</li> |
451 |
<li>Append <span class=ed>@@ normalized</span> |
<li>Append <span class=ed>@@ normalized</span> |
452 |
integer <var>a</var> to <var>result</var>. |
integer <var>a</var> to <var>r</var>. |
453 |
If the argument is a keyword <code>odd</code> or <code>even</code>, |
If the argument is a keyword <code>odd</code> or <code>even</code>, |
454 |
<var>a</var> is <code>2</code>. If <var>a</var> and |
<var>a</var> is <code>2</code>. If <var>a</var> and |
455 |
<code>n</code> is omitted, <var>a</var> is assumed as |
<code>n</code> is omitted, <var>a</var> is assumed as |
460 |
character).</li> |
character).</li> |
461 |
<li>Append a <code class=char>U+006E</code> |
<li>Append a <code class=char>U+006E</code> |
462 |
<code class=charname>LATIN SMALL LETTER N</code> |
<code class=charname>LATIN SMALL LETTER N</code> |
463 |
(<code class=char>n</code>) character to <var>result</var>.</li> |
(<code class=char>n</code>) character to <var>r</var>.</li> |
464 |
<li>Append <span class=ed>@@ normalized</span> |
<li>Append <span class=ed>@@ normalized</span> |
465 |
integer <var>b</var> to <var>result</var>. |
integer <var>b</var> to <var>r</var>. |
466 |
It <em class=rfc2119>MUST</em> be preceded by a sign, |
It <em class=rfc2119>MUST</em> be preceded by a sign, |
467 |
either <code class=char>U+002B</code> <code class=charname>PLUS |
either <code class=char>U+002B</code> <code class=charname>PLUS |
468 |
SIGN</code> (<code class=char>+</code>) or |
SIGN</code> (<code class=char>+</code>) or |
479 |
<li>Append a <code class=char>U+0029</code> |
<li>Append a <code class=char>U+0029</code> |
480 |
<code class=charname>RIGHT PARENTHESIS</code> |
<code class=charname>RIGHT PARENTHESIS</code> |
481 |
(<code class=char>)</code>) character |
(<code class=char>)</code>) character |
482 |
to <var>result</var>.</li> |
to <var>r</var>.</li> |
483 |
</ol> |
</ol> |
484 |
</dd> |
</dd> |
485 |
<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> |
493 |
<code class=charname>LATIN SMALL LETTER T</code>, and |
<code class=charname>LATIN SMALL LETTER T</code>, and |
494 |
<code class=char>U+0028</code> <code class=charname>LEFT |
<code class=char>U+0028</code> <code class=charname>LEFT |
495 |
PARENTHESIS</code> (<code>:not(</code>), followed by a |
PARENTHESIS</code> (<code>:not(</code>), followed by a |
496 |
<a href="#newline">newline</a>, to <var>result</var>.</li> |
<a href="#newline">newline</a>, to <var>r</var>.</li> |
497 |
<li>Append four <code class=char>U+0020</code> |
<li>Append four <code class=char>U+0020</code> |
498 |
<code class=charname>SPACE</code> characters to |
<code class=charname>SPACE</code> characters to |
499 |
<var>result</var>.</li> |
<var>r</var>.</li> |
500 |
<li>Append four <code class=char>U+0020</code> |
<li>Append four <code class=char>U+0020</code> |
501 |
<code class=charname>SPACE</code> characters to |
<code class=charname>SPACE</code> characters to |
502 |
<var>result</var> again.</li> |
<var>r</var> again.</li> |
503 |
<li><a href="#algorithm-serialize-a-simple-selector">Serialize |
<li><a href="#algorithm-serialize-a-simple-selector">Serialize |
504 |
the simple selector specified as the argument to the |
the simple selector specified as the argument to the |
505 |
<code>not</code> pseudo$B!>(Bclass</a>.</li> |
<code>not</code> pseudo$B!>(Bclass</a>.</li> |
506 |
<li>Append a <a href="#newline">newline</a> to |
<li>Append a <a href="#newline">newline</a> to |
507 |
<var>result</var>.</li> |
<var>r</var>.</li> |
508 |
<li>Append four <code class=char>U+0020</code> |
<li>Append four <code class=char>U+0020</code> |
509 |
<code class=charname>SPACE</code> characters to |
<code class=charname>SPACE</code> characters to |
510 |
<var>result</var>.</li> |
<var>r</var>.</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 |
514 |
to <var>result</var>.</li> |
to <var>r</var>.</li> |
515 |
</ol> |
</ol> |
516 |
</dd> |
</dd> |
517 |
|
<dt>Otherwise</dt> |
518 |
|
<dd>The pseudo$B!>(Bclass is not supported by this version of |
519 |
|
<abbr title="Selectors Serialization Format for Testing">SSFT</abbr> |
520 |
|
and therefore no |
521 |
|
<abbr title="Selectors Serialization Format for Testing">SSFT</abbr> |
522 |
|
representation is defined for <var>ss</var>. Stop the algorithm.</dd> |
523 |
</dl> |
</dl> |
524 |
</li> |
</li> |
525 |
</ol> |
</ol> |
529 |
<ol> |
<ol> |
530 |
<li>Append two <code class=char>U+003A</code> |
<li>Append two <code class=char>U+003A</code> |
531 |
<code class=charname>COLON</code> characters (<code>::</code>) |
<code class=charname>COLON</code> characters (<code>::</code>) |
532 |
to <var>result</var>.</li> |
to <var>r</var>.</li> |
533 |
<li>Append the |
<li>Append the |
534 |
<a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a> |
<a href="#algorithm-normalize-an-ident" title="normalize an IDENT">normalized</a> |
535 |
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 |
536 |
<!-- For future version: append "(", arguments, ")", if any. --> |
to <var>r</var>.</li> |
537 |
|
<li>If the pseudo$B!>(Belement has any arguments: |
538 |
|
The pseudo$B!>(Belement is not supported by this version of |
539 |
|
<abbr title="Selectors Serialization Format for Testing">SSFT</abbr> |
540 |
|
and therefore no |
541 |
|
<abbr title="Selectors Serialization Format for Testing">SSFT</abbr> |
542 |
|
representation is defined for <var>ss</var>. Stop the algorithm. |
543 |
|
</li> |
544 |
</ol> |
</ol> |
545 |
</dd> |
</dd> |
546 |
</dl> |
</dl> |
547 |
|
</li> |
548 |
|
<li>Then, <var>r</var> is the |
549 |
|
<abbr title="Selectors Serialization Format for Testing">SSFT</abbr> |
550 |
|
representation of <var>ss</var>.</li> |
551 |
|
</ol> |
552 |
|
|
553 |
</div> |
</div> |
554 |
|
|
555 |
<div class=section id=serializing-tokens> |
<div class=section id=serializing-groups-of-selectors> |
556 |
<h3>Serializing Tokens</h3> |
<h3>Serializing Groups of Selectors</h3> |
557 |
|
|
558 |
<p>To <dfn id=algorithm-normalize-an-ident title="normalize an IDENT">normalize |
<p>No <abbr title="Selectors Serialization Format for Testing">SSFT</abbr> |
559 |
an <code>IDENT</code> (<dfn id=var-n><var>n</var></dfn>)</dfn>:</p> |
representation is defined for an invalid |
560 |
<ol> |
<a href="http://www.w3.org/TR/css3-selectors/#grouping">group of |
561 |
<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> |
|
562 |
|
|
563 |
<p>To <dfn id=algorithm-normalize-a-string title="normalize a STRING">normalize |
<p>To |
564 |
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 |
565 |
|
a group of selectors (<dfn id=var-gs><var>gs</var></dfn>)</dfn>, |
566 |
|
the following algorithm <em class=rfc2119>MUST</em> be used:</p> |
567 |
<ol> |
<ol> |
568 |
<li>Replace the escape sequences (<code>\</code> and following |
<li>Let <dfn id=var-result><var>result</var></dfn> an empty string.</li> |
569 |
characters) in <var>s</var> by characters represented by them |
<li>For each selector (<dfn id=var-selector><var>selector</var></dfn>) in |
570 |
(or an empty string if <code>\</code> is immediately followed by |
<var>gs</var>: |
571 |
newline character(s)) respectively.</li> |
<ol> |
572 |
<li>Remove the quotation characters in <var>s</var> |
<li>If <var>selector</var> is <em>not</em> the first selector |
573 |
if <var>s</var> is a <code>STRING</code>.</li> |
in the <var>gs</var>, then append a <code class=char>U+002C</code> |
574 |
<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 |
575 |
<code class=char>U+0020</code> <code class=charname>SPACE</code>, |
<a href="#newline">newline</a> to <var>result</var>.</li> |
576 |
<code class=char>U+0021</code> <code class=charname>EXCLAMATION MARK</code> |
<li>Append four <code class=char>U+0020</code> |
577 |
(<code class=char>!</code>), <code class=char>U+0023</code> |
<code class=charname>SPACE</code> characters to <var>result</var>.</li> |
578 |
<code class=charname>NUMBER SIGN</code> (<code class=char>#</code>) to |
<li>Process each sequence of simple selectors or |
579 |
<code class=char>U+005B</code> <code class=charname>LEFT SQUARE |
combinator in <var>selector</var> as following: |
580 |
BRACKET</code>, <code class=char>U+005D</code> <code class=charname>RIGHT |
<dl class=switch> |
581 |
SQUARE BRACKET</code> to <code class=char>U+D7FF</code>, or |
<dt>If it is a sequence of simle selector |
582 |
<code class=char>U+E000</code> to <code class=char>U+10FFFF</code> in |
(<dfn id=var-sss><var>sss</var></dfn>)</dt> |
583 |
<var>s</var>, then replace it by string <code>\<var>HHHHHH</var></code>, where |
<dd> |
584 |
<dfn id=var-HHHHHH><var>HHHHHH</var></dfn> is the upper$B!>(Bcase zero$B!>(Bpadded |
<ol> |
585 |
hexadecimal representation of the character. If the character |
<li class=ed><a href="#algorithm-serialize-a-simple-selector">Serialize |
586 |
is outside the range of <code>[<code class=char>U+0000</code>, |
each simple selector</a> in <var>sss</var>.</li> |
587 |
<code class=char>U+10FFFF</code>]</code>, <var>HHHHHH</var> |
<li class=ed>sort</li> |
588 |
<em class=rfc2119>MUST</em> be <code>FFFFFF</code>.</li> |
<li>Append a <a href="#newline">newline</a> to <var>result</var>.</li> |
589 |
<li>Insert a <code class=char>U+0022</code> <code class=charname>QUOTATION |
</ol> |
590 |
MARK</code> (<code class=char>"</code>) at the beginning of <var>s</var>.</li> |
</dd> |
591 |
<li>Insert a <code class=char>U+0022</code> <code class=charname>QUOTATION |
<dt>If it is a combinator (<dfn id=var-c><var>c</var></dfn>)</dt> |
592 |
MARK</code> (<code class=char>"</code>) at the end of <var>s</var>.</li> |
<dd> |
593 |
<li>Then, <var>s</var> is the result of the algorithm.</li> |
<ol> |
594 |
</ol> |
<li>Append two <code class=char>U+0020</code> |
595 |
|
<code class=charname>SPACE</code> characters to <var>result</var>.</li> |
596 |
<p>A <dfn id=newline title=newline>newline</dfn> |
<li>Process <var>c</var> as following: |
|
<em class=rfc2119>SHOULD</em> be represented as a |
|
|
<code class=char>U+000A</code> <code class=charname>LINE FEED</code> |
|
|
character. However, depending on the context where |
|
|
the <abbr title="Selectors Serialization Format for Testing">SSFT</abbr> |
|
|
representation is in use, a sequence of |
|
|
<code class=char>U+000D</code> <code class=charname>CARRIAGE RETURN</code> |
|
|
followed by a <code class=char>U+000A</code> |
|
|
<code class=charname>LINE FEED</code> (i.e. a |
|
|
<code>CRLF</code> sequence) or a character |
|
|
<code class=char>U+000D</code> <code class=charname>CARRIAGE RETURN</code> |
|
|
<em class=rfc2119>MAY</em> be used as a <a href="#newline">newline</a> instead. |
|
|
<a href="#newline">Newline</a> representations |
|
|
<em class=rfc2119>SHOULD</em> be consistent in an |
|
|
<abbr title="Selectors Serialization Format for Testing">SSFT</abbr> |
|
|
representation.</p> |
|
597 |
|
|
598 |
<div class="note memo"> |
<dl class=switch> |
599 |
<p>Therefore, newlines must be normalized before |
<dt>If <var>c</var> is descendant combinator (white space)</dt> |
600 |
|
<dd>Append a <code class=char>U+0020</code> |
601 |
|
<code class=charname>SPACE</code> character to |
602 |
|
<var>result</var>.</dd> |
603 |
|
<dt>If <var>c</var> is child combinator |
604 |
|
(<code class=char>></code>)</dt> |
605 |
|
<dd>Append a <code class=char>U+003E</code> |
606 |
|
<code class=charname>GREATER-THAN SIGN</code> |
607 |
|
(<code class=char>></code>) character to <var>result</var>.</dd> |
608 |
|
<dt>If <var>c</var> is adjacent sibling combinator |
609 |
|
(<code class=char>+</code>)</dt> |
610 |
|
<dd>Append a <code class=char>U+002B</code> |
611 |
|
<code class=charname>PLUS SIGN</code> (<code class=char>+</code>) |
612 |
|
character to <var>result</var>.</dd> |
613 |
|
<dt>If <var>c</var> is general sibling combinator |
614 |
|
(<code class=char>~</code>)</dt> |
615 |
|
<dd>Append a <code class=char>U+007E</code> |
616 |
|
<code class=charname>TILDE</code> (<code class=char>~</code>) |
617 |
|
character to <var>result</var>.</dd> |
618 |
|
</dl> |
619 |
|
</li> |
620 |
|
<li>Append a <code class=char>U+0020</code> |
621 |
|
<code class=charname>SPACE</code> character to |
622 |
|
<var>result</var>.</li> |
623 |
|
</ol> |
624 |
|
</dd> |
625 |
|
</dl> |
626 |
|
</ol> |
627 |
|
</li> |
628 |
|
<li>Then, <var>result</var> is the |
629 |
<abbr title="Selectors Serialization Format for Testing">SSFT</abbr> |
<abbr title="Selectors Serialization Format for Testing">SSFT</abbr> |
630 |
representations are literally compared.</p> |
representation of <var>gs</var>.</li> |
631 |
</div> |
</ol> |
632 |
|
|
633 |
</div> |
</div> |
634 |
|
|
637 |
<div class="section" id="parsing"> |
<div class="section" id="parsing"> |
638 |
<h2>Parsing |
<h2>Parsing |
639 |
<abbr title="Selectors Serialization Format for Testing">SSFT</abbr> |
<abbr title="Selectors Serialization Format for Testing">SSFT</abbr> |
640 |
Groups of Selectors</h2> |
Representations of Selectors</h2> |
641 |
|
|
642 |
<p>Since <a href="#serializing">the serializing algorithm</a> is |
<p>Since <a href="#algorithm-serialize-a-group-of-selectors">the serializing |
643 |
so designed that it always output a valid |
algorithm for groups of selectors</a> is so designed that it always outputs a |
644 |
<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 |
645 |
selectors</a>, no special parser for the |
selectors</a>, no special parser for the |
646 |
<abbr title="Selectors Serialization Format for Testing">SSFT</abbr> |
<abbr title="Selectors Serialization Format for Testing">SSFT</abbr> |
647 |
representation is necessary. Any conforming parser for |
representation is necessary. Any conforming parser for |
648 |
<a href="http://www.w3.org/TR/css3-selectors/#grouping">groups of |
<a href="http://www.w3.org/TR/css3-selectors/#grouping">groups of |
649 |
selectors</a> <em class=rfc2119>MAY</em> be used |
selectors</a> <em class=rfc2119>MAY</em> be used |
650 |
to parse <abbr title="Selectors Serialization Format for Testing">SSFT</abbr> |
to parse <abbr title="Selectors Serialization Format for Testing">SSFT</abbr> |
651 |
representations of groups of selectors.</p> |
representations of |
652 |
|
<a href="http://www.w3.org/TR/css3-selectors/#grouping">groups of |
653 |
|
selectors</a>.</p> |
654 |
|
|
655 |
|
<p>Likewise, <a href="#algorithm-serialize-a-simple-selector">the serializing |
656 |
|
algorithm for simple selectors</a> always outputs a valid |
657 |
|
<a href="#simple-selector">simple selector</a> and therefore any |
658 |
|
conforming parser for <a href="#simple-selector">simple selector</a> |
659 |
|
<em class=rfc2119>MAY</em> be used to parse |
660 |
|
<abbr title="Selectors Serialization Format for Testing">SSFT</abbr> |
661 |
|
representations of <a href="#simple-selector">simple selectors</a>.</p> |
662 |
</div> |
</div> |
663 |
|
|
664 |
<div class="section" id="examples"> |
<div class="section" id="examples"> |
694 |
<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> |
695 |
14</a>, <abbr title="Request for Comments">RFC</abbr> 2119, |
14</a>, <abbr title="Request for Comments">RFC</abbr> 2119, |
696 |
<time datetime=1997-03>March 1997</time>. |
<time datetime=1997-03>March 1997</time>. |
697 |
This version of the specification is referenced</dd> |
This version of the specification is referenced.</dd> |
698 |
<dt id=ref-SELECTORS>SELECTORS</dt> |
<dt id=ref-SELECTORS>SELECTORS</dt> |
699 |
<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>, |
700 |
<abbr title="World Wide Web Consortium">W3C</abbr> Working Draft, |
<abbr title="World Wide Web Consortium">W3C</abbr> Working Draft, |