<http://suika.fam.cx/www/markup/selectors/ssft/ssft><http://suika.fam.cx/www/markup/selectors/ssft/ssft>© 2007 Wakaba.
Permission is granted to copy, distribute and/or modify this document
under the terms of the GNU Free Documentation License,
Version 1.2
or any later version published by the Free Software Foundation;
with no Invariant Sections, no Front‐Cover Texts, and no Back‐Cover
Texts. A copy of the license is
available at <http://www.gnu.org/copyleft/fdl.html>.
This section describes the status of this document at the time of its publication. Other documents might supersede this document.
This document is a working draft.
It might be updated, replaced, or obsoleted by
other documents at any time. It is inappropriate to
cite this document as other than work in progress
.
Comments on this document are welcome and may be sent to the author.
Translations of thie document might be available. The English version of the document is the only normative version.
The key words MUST
,
MUST NOT
,
SHOULD
,
SHOULD NOT
, and
MAY
in this
document are to be interpreted as described in
RFC 2119
[KEYWORDS].
See the reference implementation for now.
Since the serializing algorithm is so designed that it always output a valid group of selectors, no special parser for the SFFT is necessary. Any conforming group of selectors parser MAY be used to parse SFFT groups of selectors.