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

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

Parent Directory | Revision Log | View Patch Patch

-revision 1.15 by wakaba,
Mon Oct 22 11:00:57 2007 UTC
+revision 1.27 by wakaba,
Mon Nov  5 11:39:39 2007 UTC
 Line 1
  <!DOCTYPE html>
- <html lang="en" class="formal-specification status-work-in-progress">
+ <html lang="en" class="formal-specification"><!-- work-in-progress -->
  <head>
  <title>Selectors Serialization Format for Testing (SSFT) Specification</title>
  <link rel="stylesheet" href="http://suika.fam.cx/www/style/html/spec">
 Line 10
  <div class="header">
  <h1>Selectors Serialization Format for Testing (<abbr>SSFT</abbr>)
  Specification</h1>
- <h2>Working Draft <time datetime=2007-10-22>22 October 2007</time></h2>
+ <h2>First Edition <!-- Working Draft -->
+ <time datetime=2007-11-05>5 November 2007</time></h2>
  <dl class="versions-uri">
  <dt>This Version</dt>
-   <dd><code class="URI">&lt;<a href="http://suika.fam.cx/www/markup/selectors/ssft/ssft"
+   <dd><code class="URI">&lt;<a href="http://suika.fam.cx/www/markup/selectors/ssft/ssft-20071105"
-       >http://suika.fam.cx/www/markup/selectors/ssft/ssft</a>&gt;</code></dd>
+       >http://suika.fam.cx/www/markup/selectors/ssft/ssft-20071105</a>&gt;</code></dd>
  <dt>Latest Version</dt>
    <dd><code class="URI">&lt;<a href="http://suika.fam.cx/www/markup/selectors/ssft/ssft"
        >http://suika.fam.cx/www/markup/selectors/ssft/ssft</a>&gt;</code></dd>
- <!--
  <dt>Latest Working Draft</dt>
- -->
+   <dd><code class="URI">&lt;<a href="http://suika.fam.cx/www/markup/selectors/ssft/ssft-work"
+       >http://suika.fam.cx/www/markup/selectors/ssft/ssft-work</a>&gt;</code></dd>
  <!-- <dt>Previous Version</dt> -->
  <dt>Version History</dt>
-   <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>
+   <dd><code class=URI>&lt;<a href="http://suika.fam.cx/gate/cvs/markup/selectors/ssft/ssft-work.en.html">http://suika.fam.cx/gate/cvs/markup/selectors/ssft/ssft-work.en.html</a>&gt;</code></dd>
  </dl>
  <dl class="authors" id="author">
  <dt>Author</dt>
-Line 52 
 available at <code class="URI">&lt;<a
+Line 53 
 available at <code class="URI">&lt;<a
  <div id="abstract" class="section">
  <h2>Abstract</h2>
- <div class="ed issue">...</div>
+ <p>This document defines
+ <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>,
+ a subset of Selectors language which is suitable for describing results
+ of Selectors parsing tests.</p>
  </div>
-Line 63 
 available at <code class="URI">&lt;<a
+Line 67 
 available at <code class="URI">&lt;<a
  at the time of its publication.  Other documents
  might supersede this document.</em></p>
- <p>This document is a working draft, produced as part of the
+ <p>This document is the specification
+ <!-- This document is a working draft -->
+ of <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>,
+ produced as part of the
  <a href="http://suika.fam.cx/www/markup/html/whatpm/readme">Whatpm</a>
  subproject
  of the <a href="http://suika.fam.cx/www/manakai-core/doc/web/">manakai</a>
- project.  It might be updated, replaced, or obsoleted by
+ project.
+ <!-- It might be updated, replaced, or obsoleted by
  other documents at any time.  It is inappropriate to
- cite this document as other than <q>work in progress</q>.</p>
+ cite this document as other than <q>work in progress</q>. --></p>
  <p>Comments on this document are welcome and
  may be sent to the <a href="#author">author</a>.</p>
-Line 98 
 in a tree structure and are used in Web
+Line 106 
 in a tree structure and are used in Web
  <abbr>API</abbr></a>
  <cite class="bibref informative">[<a href="#ref-SAPI">SAPI</a>]</cite>.</p>
- <div class="issue ed">...</div>
+ <p>It is so flexible language that a conceptually same pattern
+ can be represented in inifnite numbers of instances of selectors.
+ It might be convinient for e.g. validation of a test result to
+ define a subset of the language, in which no semantically equivalent
+ selectors are contained.</p>
  <p><a href="http://dev.w3.org/cvsweb/csswg/cssom/Overview.html">The
  <abbr title="Cascading Style Sheets Object Model">CSSOM</abbr>
-Line 111 
 attribute.  However, the algorithm is in
+Line 123 
 attribute.  However, the algorithm is in
  <time datetime=2007-09-25>at the time of the writing</time>.
  Note that current Web browser implementations
  of the <code>selectorText</code> attribute are consistently broken
- in not escaping unsafe identifiers.</p>
+ in not escaping unsafe identifiers and therefore it is not wise
+ to deploy that format for testing.</p>
  </div>
-Line 120 
 in not escaping unsafe identifiers.</p>
+Line 133 
 in not escaping unsafe identifiers.</p>
  <p>The key words <q><dfn id=must><em class="rfc2119">MUST</em></dfn></q>,
  <q><dfn id=must-not><em class="rfc2119">MUST NOT</em></dfn></q>,
- <q><dfn id=should><em class="rfc2119">SHOULD</em></dfn></q>,
+ <q><dfn id=should><em class="rfc2119">SHOULD</em></dfn></q>, and
- <q><dfn id=should-not><em class="rfc2119">SHOULD NOT</em></dfn></q>, and
  <q><dfn id=may><em class=rfc2119>MAY</em></dfn></q> in this
  document are to be interpreted as described in
  <a href="urn:ietf:rfc:2119"><abbr title="Request for Comments">RFC</abbr>
-Line 148 
 simple selector in a selector.</p>
+Line 160 
 simple selector in a selector.</p>
  </div>
  <div class="section" id="serializing">
- <h2>Serializing Selectors as
+ <h2>Serializing Selectors in
  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
  Representation</h2>
- <div class="issue ed">
+ <p>Subsections of this section define algorithms
- <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
- for now.</p>
+ selector</a> or <a href="#algorithm-serialize-a-group-of-selectors">serialize
- </div>
+ a group of selectors</a>.</p>
  <div class="note memo">
  <p>The serialized representation will not contain any comment.</p>
  </div>
- <!-- TODO: link terms to Selectors -->
  <div class=section id=serializing-tokens>
  <h3>Serializing Tokens</h3>
- <p>To <dfn id=algorithm-normalize-an-ident title="normalize an IDENT">normalize
+ <p>To <dfn id=algorithm-normalize-an-ident title="normalize a string as an IDENT">normalize
- an <code>IDENT</code> (<dfn id=var-n><var>n</var></dfn>)</dfn>,
+ a string (<dfn id=var-n><var>n</var></dfn>) as an <code>IDENT</code></dfn>,
  the following algorithm <em class=rfc2119>MUST</em> be used:</p>
  <ol>
- <li>Replace the escape sequences (<code>\</code> and following
+ <li>If <var>n</var> is either an <code>IDENT</code> or a <code>HASH</code>,
- characters) in <var>n</var> by characters represented by them
+ replace the escape sequences (<code>\</code> and following characters) in
- respectively.</li>
+ <var>n</var> by characters represented by them respectively.</li>
+ <li>If <var>n</var> is a <code>HASH</code>, remove the leading
+ <code class=char>U+0023</code> <code class=charname>NUMBER SIGN</code>
+ (<code class=char>#</code>) character from <var>n</var>.</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>
-Line 189 
 A</code> (<code class=char>A</code>) to
+Line 203 
 A</code> (<code class=char>A</code>) to
  <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
+ <dfn id=var-ident-HHHHHH><var>HHHHHH</var></dfn> is the uppercase
- hexadecimal representation of the character.  If the character
+ 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>
-Line 221 
 character by string <code>\00002D</code>
+Line 235 
 character by string <code>\00002D</code>
  <li>Then, <var>n</var> is the result of the algorithm.</li>
  </ol>
- <p>To <dfn id=algorithm-normalize-a-string title="normalize a STRING">normalize
+ <p>To <dfn id=algorithm-normalize-a-string title="normalize a string (STRING or IDENT) as a STRING">normalize
- a <code>STRING</code> (<dfn id=var-s><var>s</var></dfn>)</dfn>,
+ a string (<dfn id=var-s><var>s</var></dfn>) as a <code>STRING</code></dfn>,
  the following algorithm <em class=rfc2119>MUST</em> be used:</p>
  <ol>
- <li><p>Replace the escape sequences (<code>\</code> and following
+ <li>If <var>s</var> is either an <code>IDENT</code> or a
- characters) in <var>s</var> by characters represented by them
+ <code>STRING</code>, replace the escape sequences (<code>\</code> and
+ following characters) in <var>s</var> by characters represented by them
  (or an empty string if <code>\</code> is immediately followed by
- newline character(s)) respectively.</p></li>
+ newline character(s)) respectively.</li>
- <li><p>Remove the quotation characters in <var>s</var>
+ <li>If <var>s</var> is a <code>STRING</code>, remove the quotation marks
- if <var>s</var> is a <code>STRING</code>.</p>
+ enclosing <var>s</var>.</li>
- <div class="note memo">
- <p>The input <var>s</var> to this algorithm may be an
- <code>IDENT</code>.</p>
- </div></li>
  <li><p>If there is any character that is <em>not</em> one of
  <code class=char>U+0020</code> <code class=charname>SPACE</code>,
  <code class=char>U+0021</code> <code class=charname>EXCLAMATION MARK</code>
-Line 246 
 BRACKET</code>, <code class=char>U+005D<
+Line 256 
 BRACKET</code>, <code class=char>U+005D<
  SQUARE BRACKET</code> to <code class=char>U+D7FF</code>, or
  <code class=char>U+E000</code> to <code class=char>U+10FFFF</code> in
  <var>s</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
+ <dfn id=var-string-HHHHHH><var>HHHHHH</var></dfn> is the uppercase
- hexadecimal representation of the character.  If the character
+ 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>.</p></li>
-Line 282 
 representation.</p>
+Line 292 
 representation.</p>
  representations are literally compared.</p>
  </div>
+ <div class="issue ed">
+ <p>In a future version of the specification, we need to define
+ <dfn id=lowercase>lowercase</dfn> (maybe by referencing some version of
+ some module of <abbr>CSS</abbr>).  It is <code>tr/A-Z/a-z/</code> for now.</p>
+ </div>
+ <p>To
+ <dfn id=algorithm-normalize-an-integer title="normalize an integer">normalize
+ an integer (<dfn id=var-int-i><var>i</var></dfn>)</dfn>, the following
+ algorithm <em class=rfc2119>MUST</em> be used:</p>
+ <ol class=algorithm>
+ <li>If <var>i</var> is equal to zero (0), return a string with only a
+ character: <code class=char>U+0030</code>
+ <code class=charname>DIGIT ZERO</code> (<code class=char>0</code>).
+ Stop the algorithm.</li>
+ <li>Let <dfn id=var-int-result><var>result</var></dfn> be an empty string.</li>
+ <li>If <var>i</var> is less than zero (0), append a
+ <code class=char>U+002D</code> <code class=charname>HYPHEN-MINUS</code>
+ (<code class=char>-</code>) character to <var>result</var>.</li>
+ <li>Append the decimal representation of the absolute value of
+ <var>i</var> to <var>result</var>.  The decimal (base$B!>(Bten) representation
+ <em class=rfc2119>MUST NOT</em> begin with a <code class=char>U+0030</code>
+ <code class=charname>DIGIT ZERO</code> (<code class=char>0</code>)
+ character.</li>
+ <li>Return <var>result</var>.</li>
+ </ol>
  </div>
-Line 289 
 representations are literally compared.<
+Line 326 
 representations are literally compared.<
  <h3>Serializing Simple Selectors</h3>
  <p>No <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
- representation is defined for an invalid simple selector selector.</p>
+ representation is defined for an invalid <a href="#simple-selector">simple
+ selector</a>.</p>
  <p>To
  <dfn id=algorithm-serialize-a-simple-selector title="serialize a simple selector">serialize
  a simple selector (<dfn><var id=var-ss>ss</var></dfn>)</dfn>,
  the following algorithm <em class=rfc2119>MUST</em> be used:</p>
+ <ol>
+ <li>Let <dfn id=var-r><var>r</var></dfn> an empty string.</li>
+ <li>Process <var>ss</var> as following:
  <dl class=switch>
  <dt>If <var>ss</var> is a type or universal selector</dt>
    <dd>
      <ol>
-     <li>
+     <li>Append a namespace prefix as following:
        <dl class=switch>
        <dt>If a namespace URI is specified (via namespace prefix, or
        by omitting namespace prefix where a default namespace is specified)</dt>
-         <dd class="ed">@@</dd>
+         <dd>Append the namespace URI as a
+         <a href="#algorithm-normalize-an-ident" title="normalize a string as an IDENT">normalized
+         <code>IDENT</code></a> to <var>r</var>.  Then, append a
+         <code class=char>U+007C</code>
+         <code class=charname>VERTICAL BAR</code> (<code class=char>|</code>)
+         character to <var>r</var>.</dd>
        <dt>If the null namespace is specified (by zero$B!>(Blength namespace
        prefix)</dt>
          <dd>Append a <code class=char>U+007C</code>
          <code class=charname>VERTICAL BAR</code> (<code class=char>|</code>)
-         character to <var>result</var>.</dd>
+         character to <var>r</var>.</dd>
        <dt>If no namespace is specified (by namespace prefix <code>*</code>,
        or by omitting namespace prefix where no default namespace is
        specified)</dt>
-Line 316 
 the following algorithm <em class=rfc211
+Line 364 
 the following algorithm <em class=rfc211
          <code class=charname>ASTERISK</code> (<code class=char>*</code>)
          character, followed by a <code class=char>U+007C</code>
          <code class=charname>VERTICAL BAR</code> (<code class=char>|</code>)
-         character, to <var>result</var>.</dd>
+         character, to <var>r</var>.</dd>
        </dl>
      </li>
      <li>If <var>ss</var> is a type selector, append the
-     <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>
-     local name to <var>result</var>.</li>
+     local name to <var>r</var>.</li>
      <li>If <var>ss</var> is a universal selector, append
      a <code class=char>U+002A</code> <code class=charname>ASTERISK</code>
-     (<code class=char>*</code>) character to <var>result</var>.</li>
+     (<code class=char>*</code>) character to <var>r</var>.</li>
      </ol>
    </dd>
  <dt>If <var>ss</var> is an attribute selector</dt>
-Line 332 
 the following algorithm <em class=rfc211
+Line 380 
 the following algorithm <em class=rfc211
      <ol>
      <li>Append a <code class=char>U+005B</code> <code class=charname>LEFT
      SQUARE BRACKET</code> (<code class=char>[</code>) to
-     <var>result</var>.</li>
+     <var>r</var>.</li>
      <li>
        Append a namespace prefix as following:
        <dl>
        <dt>If a namespace URI is specified</dt>
-         <dd class=ed>@@</dd>
+         <dd>Append the namespace URI as a
-         <dd class=ed>@@ Current reference implementation is wrong,
+         <a href="#algorithm-normalize-an-ident" title="normalize a string as an IDENT">normalized
-         since its result of sorting depends on namespace prefix.</dd>
+         <code>IDENT</code></a> to <var>r</var>.  Then, append a
+         <code class=char>U+007C</code>
+         <code class=charname>VERTICAL BAR</code> (<code class=char>|</code>)
+         character to <var>r</var>.</dd>
        <dt>If the null namespace is specified</dt>
          <dd>Append a <code class=char>U+007C</code>
          <code class=charname>VERTICAL BAR</code> character to
-         <var>result</var>.</dd>
+         <var>r</var>.</dd>
        <dt>If no namespace is specified</dt>
          <dd>Append a <code class=char>U+002A</code>
          <code class=charname>ASTERISK</code> (<code class=char>*</code>)
          character, followed by a <code class=char>U+007C</code>
          <code class=charname>VERTICAL BAR</code> (<code class=char>|</code>)
-         character, to <var>result</var>.</dd>
+         character, to <var>r</var>.</dd>
        </dl>
      </li>
      <li>Append the
-     <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>
-     local name to <var>result</var>.</li>
+     local name to <var>r</var>.</li>
      <li>If a value is specified in <var>ss</var>:
        <ol>
        <li>Depending on the way to match, append <code>=</code>,
        <code>~=</code>, <code>|=</code>, <code>^=</code>,
-       <code>$=</code>, or <code>*=</code> to <var>result</var>.</li>
+       <code>$=</code>, or <code>*=</code> to <var>r</var>.</li>
        <li>Append the
        <a href="#algorithm-normalize-a-string" title="normalize a string">normalized</a>
-       value to <var>result</var>.</li>
+       value to <var>r</var>.</li>
        </ol>
      </li>
      <li>Append a <code class=char>U+005D</code> <code class=charname>RIGHT
      SQUARE BRACKET</code> (<code class=char>]</code>) to
-     <var>result</var>.</li>
+     <var>r</var>.</li>
      </ol>
    </dd>
  <dt>If <var>ss</var> is a class selector</dt>
    <dd>Append a <code class=char>U+002E</code> <code class=charname>FULL
    STOP</code> (<code class=char>.</code>) character, followed
-   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>
-   class name, <var>result</var>.</dd>
+   class name, to <var>r</var>.</dd>
  <dt>If <var>ss</var> is an <abbr>ID</abbr> selector</dt>
    <dd>Append a <code class=char>U+0023</code> <code class=charname>NUMBER
    SIGN</code> (<code class=char>#</code>) character, followed
-   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>
-   <abbr>ID</abbr>, to <var>result</var>.</dd>
+   <abbr>ID</abbr>, to <var>r</var>.</dd>
  <dt>If <var>ss</var> is a pseudo$B!>(Bclass selector</dt>
    <dd>
      <ol>
      <li>Append a <code class=char>U+003A</code>
      <code class=charname>COLON</code> (<code class=char>:</code>) character
-     to <var>result</var>.</li>
+     to <var>r</var>.</li>
      <li>Append the
-     <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>
-     name of the pseudo$B!>(Bclass to <var>result</var>.</li>
+     name (in <a href="#lowercase">lowercase</a>) of the pseudo$B!>(Bclass to
+     <var>r</var>.</li>
      <li>Append any arguments as following:
        <dl class=switch>
        <dt>If the name of the pseudo$B!>(Bclass is <code>lang</code></dt>
-Line 396 
 the following algorithm <em class=rfc211
+Line 448 
 the following algorithm <em class=rfc211
            <ol>
            <li>Append a <code class=char>U+0028</code> <code class=charname>LEFT
            PARENTHESIS</code> (<code class=char>(</code>) character
-           to <var>result</var>.</li>
+           to <var>r</var>.</li>
            <li>Append the
-           <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>
-           language tag (the argument) to <var>result</var>.</li>
+           language tag (the argument) to <var>r</var>.
+           <span class="issue ed">Should we normalize cases?</span></li>
            <li>Append a <code class=char>U+0029</code>
            <code class=charname>RIGHT PARENTHESIS</code>
            (<code class=char>)</code>) character
-           to <var>result</var>.</li>
+           to <var>r</var>.</li>
            </ol>
          </dd>
        <dt>If the name of the pseudo$B!>(Bclass is
-Line 412 
 the following algorithm <em class=rfc211
+Line 465 
 the following algorithm <em class=rfc211
            <ol>
            <li>Append a <code class=char>U+0028</code> <code class=charname>LEFT
            PARENTHESIS</code> (<code class=char>(</code>) character
-           to <var>result</var>.</li>
+           to <var>r</var>.</li>
            <li>Append the
            <a href="#algorithm-normalize-a-string" title="normalize a string">normalized</a>
-           string (the argument) to <var>result</var>.</li>
+           string (the argument) to <var>r</var>.</li>
            <li>Append a <code class=char>U+0029</code>
            <code class=charname>RIGHT PARENTHESIS</code>
            (<code class=char>)</code>) character
-           to <var>result</var>.</li>
+           to <var>r</var>.</li>
            </ol>
          </dd>
        <dt>If name of the pseudo$B!>(Bclass is either <code>nth-child</code>,
-Line 429 
 the following algorithm <em class=rfc211
+Line 482 
 the following algorithm <em class=rfc211
            <ol>
            <li>Append a <code class=char>U+0028</code> <code class=charname>LEFT
            PARENTHESIS</code> (<code class=char>(</code>) character
-           to <var>result</var>.</li>
+           to <var>r</var>.</li>
-           <li>Append <span class=ed>@@ normalized</span>
+           <li>Let <dfn id=var-a><var>a</var></dfn> be the <var>a</var>
-           integer <var>a</var> to <var>result</var>.
+           part of the argument.  If the argument is a keyword <code>odd</code>
-           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>.
-           <var>a</var> is <code>2</code>.  If <var>a</var> and
+           If the <var>a</var> part with following <code>n</code> character
-           <code>n</code> is omitted, <var>a</var> is assumed as
+           is omitted, then let <var>a</var> be <code>0</code>.
-           <code>0</code>.  Otherwise, if <var>a</var> is omitted,
+           Otherwise, if only the <var>a</var> part is omitted, then
-           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>
-           if there is a <code class=char>U+002D</code>
+           part is <code>-</code>, then let <var>a</var> be
-           <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>)
+           <code>-1</code>.</li>
-           character).</li>
+           <li>Let <var>a</var> be the
+           <a href="#algorithm-normalize-an-integer" title="normalize an integer">normalized
+           string representation</a> of integer <var>a</var>.</li>
+           <li>Append <var>a</var> to <var>r</var>.</li>
            <li>Append a <code class=char>U+006E</code>
            <code class=charname>LATIN SMALL LETTER N</code>
-           (<code class=char>n</code>) character to <var>result</var>.</li>
+           (<code class=char>n</code>) character to <var>r</var>.</li>
-           <li>Append <span class=ed>@@ normalized</span>
+           <li>Let <dfn id=var-b><var>b</var></dfn> be the <var>b</var>
-           integer <var>b</var> to <var>result</var>.
+           part of the argument.  If the argument is a keyword <code>odd</code>,
-           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
-           either <code class=char>U+002B</code> <code class=charname>PLUS
+           keyword <code>even</code>, then let <var>b</var> be <code>0</code>.
-           SIGN</code> (<code class=char>+</code>) or
+           If the <var>b</var> part is omitted, then let <var>b</var> be
-           <code class=char>U+002D</code>
+           <code>0</code>.</li>
+           <li>Let <var>b</var> be the
+           <a href="#algorithm-normalize-an-integer" title="normalize an integer">normalized
+           string representation</a> of integer <var>b</var>.</li>
+           <li>If <var>b</var> does <em>not</em> start with a
+           <code class=char>U+002D</code>
            <code class=charname>HYPHEN-MINUS</code> (<code class=char>-</code>)
-           character.  If the argument is a keyword <code>odd</code>,
+           character, then append <code class=char>U+002B</code>
-           <var>b</var> is <code>1</code>.  If the argument
+           <code class=charname>PLUS SIGN</code>
-           is a keyword <code>even</code>, <var>b</var> is
+           (<code class=char>+</code>) to <var>r</var>.</li>
-           <code>0</code>.  If <var>b</var> is omitted, it is assumed as
+           <li>Append <var>b</var> to <var>r</var>.</li>
-           <code>0</code>.  The sign of <code>0</code>
-           <em class=rfc2119>MUST</em> be <code class=char>U+002B</code>
-           <code class=charname>PLUS SIGN</code>
-           (<code class=char>+</code>).</li>
            <li>Append a <code class=char>U+0029</code>
            <code class=charname>RIGHT PARENTHESIS</code>
            (<code class=char>)</code>) character
-           to <var>result</var>.</li>
+           to <var>r</var>.</li>
            </ol>
          </dd>
        <dt>If the name of the pseudo$B!>(Bclass is <code>not</code></dt>
-Line 475 
 the following algorithm <em class=rfc211
+Line 532 
 the following algorithm <em class=rfc211
              <code class=charname>LATIN SMALL LETTER T</code>, and
              <code class=char>U+0028</code> <code class=charname>LEFT
              PARENTHESIS</code> (<code>:not(</code>), followed by a
-             <a href="#newline">newline</a>, to <var>result</var>.</li>
+             <a href="#newline">newline</a>, to <var>r</var>.</li>
              <li>Append four <code class=char>U+0020</code>
              <code class=charname>SPACE</code> characters to
-             <var>result</var>.</li>
+             <var>r</var>.</li>
              <li>Append four <code class=char>U+0020</code>
              <code class=charname>SPACE</code> characters to
-             <var>result</var> again.</li>
+             <var>r</var> again.</li>
              <li><a href="#algorithm-serialize-a-simple-selector">Serialize
              the simple selector specified as the argument to the
              <code>not</code> pseudo$B!>(Bclass</a>.</li>
              <li>Append a <a href="#newline">newline</a> to
-             <var>result</var>.</li>
+             <var>r</var>.</li>
              <li>Append four <code class=char>U+0020</code>
              <code class=charname>SPACE</code> characters to
-             <var>result</var>.</li>
+             <var>r</var>.</li>
              <li>Append a <code class=char>U+0029</code>
              <code class=charname>RIGHT PARENTHESIS</code>
              (<code class=char>)</code>) character
-             to <var>result</var>.</li>
+             to <var>r</var>.</li>
            </ol>
          </dd>
+       <dt>Otherwise</dt>
+         <dd>The pseudo$B!>(Bclass is not supported by this version of
+         <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
+         and therefore no
+         <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
+         representation is defined for <var>ss</var>.  Stop the algorithm.</dd>
        </dl>
      </li>
      </ol>
-Line 505 
 the following algorithm <em class=rfc211
+Line 568 
 the following algorithm <em class=rfc211
      <ol>
      <li>Append two <code class=char>U+003A</code>
      <code class=charname>COLON</code> characters (<code>::</code>)
-     to <var>result</var>.</li>
+     to <var>r</var>.</li>
      <li>Append the
-     <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>
-     name of the pseudo$B!>(Belement to <var>result</var>.</li>
+     name (in <a href="#lowercase">lowercase</a>) of the pseudo$B!>(Belement
-     <!-- For future version: append "(", arguments, ")", if any. -->
+     to <var>r</var>.</li>
+     <li>If the pseudo$B!>(Belement has any arguments:
+         The pseudo$B!>(Belement is not supported by this version of
+         <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
+         and therefore no
+         <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
+         representation is defined for <var>ss</var>.  Stop the algorithm.
+     </li>
      </ol>
    </dd>
  </dl>
+ </li>
+ <li>Then, <var>r</var> is the
+ <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
+ representation of <var>ss</var>.</li>
+ </ol>
  </div>
-Line 520 
 the following algorithm <em class=rfc211
+Line 595 
 the following algorithm <em class=rfc211
  <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>
+ representation is defined for an invalid
+ <a href="http://www.w3.org/TR/css3-selectors/#grouping">group of
+ selectors</a>.</p>
  <p>To
  <dfn id=algorithm-serialize-a-group-of-selectors title="serialize a group of selectors">serialize
-Line 532 
 the following algorithm <em class=rfc211
+Line 609 
 the following algorithm <em class=rfc211
  <var>gs</var>:
    <ol>
    <li>If <var>selector</var> is <em>not</em> the first selector
-   in the group of selectors, then append a <code class=char>U+002C</code>
+   in the <var>gs</var>, then append a <code class=char>U+002C</code>
    <code class=charname>COMMA</code> (<code class=char>,</code>) followed by a
    <a href="#newline">newline</a> to <var>result</var>.</li>
    <li>Append four <code class=char>U+0020</code>
    <code class=charname>SPACE</code> characters to <var>result</var>.</li>
    <li>Process each sequence of simple selectors or
-   combinator in <var>selector</var> by following algorithm:
+   combinator in <var>selector</var> as following:
      <dl class=switch>
      <dt>If it is a sequence of simle selector
      (<dfn id=var-sss><var>sss</var></dfn>)</dt>
        <dd>
          <ol>
-         <li class=ed><a href="#algorithm-serialize-a-simple-selector">Serialize
+         <li>If <var>sss</var> contains a universal or type selector, then
-         each simple selector</a> in <var>sss</var>.</li>
+         <a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">serialize
-         <li class=ed>sort</li>
+         that simple selector</a> and append the result to
+         <var>result</var>.</li>
+         <li>Otherwise, i.e. if <var>sss</var> does not contain a universal or
+         type selector, then
+         <a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">serialize
+         a simple selector <code>*</code></a> and append the result to
+         <var>result</var>.</li>
+         <li><a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">Serialize
+         any attribute selectors</a> in <var>sss</var>, sort the results,
+         then append them to <var>result</var> in order.</li>
+         <li><a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">Serialize
+         any class selectors</a> in <var>sss</var>, sort the results,
+         then append them to <var>result</var> in order.</li>
+         <li><a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">Serialize
+         any <abbr>ID</abbr> selectors</a> in <var>sss</var>, sort the results,
+         then append them to <var>result</var> in order.</li>
+         <li><a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">Serialize
+         any pseudo$B!>(Bclass selectors</a> in <var>sss</var>, sort the results,
+         then append them to <var>result</var> in order.</li>
+         <li><a href="#algorithm-serialize-a-simple-selector" title="serialize a simple selector">Serialize
+         any pseudo elements</a> in <var>sss</var>, sort the results,
+         then append them to <var>result</var> in order.</li>
          <li>Append a <a href="#newline">newline</a> to <var>result</var>.</li>
          </ol>
        </dd>
-Line 555 
 the following algorithm <em class=rfc211
+Line 653 
 the following algorithm <em class=rfc211
          <ol>
          <li>Append two <code class=char>U+0020</code>
          <code class=charname>SPACE</code> characters to <var>result</var>.</li>
-         <li>
+         <li>Process <var>c</var> as following:
            <dl class=switch>
            <dt>If <var>c</var> is descendant combinator (white space)</dt>
              <dd>Append a <code class=char>U+0020</code>
-Line 598 
 representation of <var>gs</var>.</li>
+Line 697 
 representation of <var>gs</var>.</li>
  <div class="section" id="parsing">
  <h2>Parsing
  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
- Groups of Selectors</h2>
+ Representations of Selectors</h2>
- <p>Since <a href="#serializing">the serializing algorithm</a> is
+ <p>Since <a href="#algorithm-serialize-a-group-of-selectors">the serializing
- so designed that it always output a valid
+ algorithm for groups of selectors</a> is so designed that it always outputs a
- <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
  selectors</a>, no special parser for the
  <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
  representation is necessary.  Any conforming parser for
  <a href="http://www.w3.org/TR/css3-selectors/#grouping">groups of
  selectors</a> <em class=rfc2119>MAY</em> be used
  to parse <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
- representations of groups of selectors.</p>
+ representations of
+ <a href="http://www.w3.org/TR/css3-selectors/#grouping">groups of
+ selectors</a>.</p>
+ <p>Likewise, <a href="#algorithm-serialize-a-simple-selector">the serializing
+ algorithm for simple selectors</a> always outputs a valid
+ <a href="#simple-selector">simple selector</a> and therefore any
+ conforming parser for <a href="#simple-selector">simple selector</a>
+ <em class=rfc2119>MAY</em> be used to parse
+ <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
+ representations of <a href="#simple-selector">simple selectors</a>.</p>
  </div>
  <div class="section" id="examples">
-Line 617 
 representations of groups of selectors.<
+Line 726 
 representations of groups of selectors.<
  <p class=section-info>This section is <em>non$B!>(Bnormative</em>.</p>
- <div class="ed issue">
- <p><a href="http://suika.fam.cx/gate/2007/css/parser-interface">Try demo</a>,
- by choosing <q>Selectors</q> radio button.</p>
  <div class="example figure block">
- <div class="caption">...</div>
+ <p>The <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
+ representation of a selector <code>p + q</code> is:</p>
- <pre><code>...</code></pre>
+ <pre><code>    *|p
+   + *|q
+ </code></pre>
  </div>
+ <div class="example figure block">
+ <p>The <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
+ representation of a selector <code>a#id.class1:n\ot(:Active)/*
+  comment
+ */.class2</code> is:</p>
+ <pre><code>    *|a.class1.class2#id:not(
+         :active
+     )
+ </code></pre>
+ </div>
+ <div class="example figure block">
+ <p>The <abbr title="Selectors Serialization Format for Testing">SSFT</abbr>
+ representation of a
+ <a href="http://www.w3.org/TR/css3-selectors/#grouping">group of selectors</a>
+ <code>a, #b, C[d^=e], .\31 23</code> is:</p>
+ <pre><code>    *|a
+ ,
+     *|*#b
+ ,
+     *|C[|d^="e"]
+ ,
+     *|*.\00003123
+ </code></pre>
  </div>
  </div>
-Line 645 
 by choosing <q>Selectors</q> radio butto
+Line 779 
 by choosing <q>Selectors</q> radio butto
    <a href="urn:ietf:bcp:14"><abbr title="Best Current Practice">BCP</abbr>
 </a>, <abbr title="Request for Comments">RFC</abbr> 2119,
    <time datetime=1997-03>March 1997</time>.
-   This version of the specification is referenced</dd>
+   This version of the specification is referenced.</dd>
  <dt id=ref-SELECTORS>SELECTORS</dt>
    <dd><a href="http://www.w3.org/TR/2005/WD-css3-selectors-20051215"><cite>Selectors</cite></a>,
    <abbr title="World Wide Web Consortium">W3C</abbr> Working Draft,
-Line 678 
 by choosing <q>Selectors</q> radio butto
+Line 812 
 by choosing <q>Selectors</q> radio butto
  <dt id=ref-HTML5>HTML5</dt>
    <dd><cite><a href="http://whatwg.org/html5"><abbr>HTML</abbr> 5</a></cite>,
    <abbr title="Web Hypertext Application Technology Working Group">WHATWG</abbr>
-   Working Draft.  Work in progress.</dd>
+   Working Draft, <time datetime="2007-11-03">3 November 2007</time>.
+   Work in progress.</dd>
  <dt id=ref-SAPI>SAPI</dt>
    <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>,
    <abbr title="World Wide Web Consortium">W3C</abbr> Editor's Draft,

 Legend:



Removed from v.1.15
 


changed lines


 
Added in v.1.27
 Legend:



Removed from v.1.15
 


changed lines


 
Added in v.1.27
-Removed from v.1.15
+Added in v.1.27

admin@suikawiki.org	ViewVC Help
Powered by ViewVC 1.1.24