Selectors Serialization Format for Testing (SSFT) Specification

Abstract

Status of This Document

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.

Introduction

Terminology

The key words MUST, MUST NOT, SHOULD, SHOULD NOT, and MAY in this document are to be interpreted as described in RFC 2119 [KEYWORDS].

Serializing Groups of Selectors

Newline is U+000A LINE FEED or U+000D U+000A or U+000A ??.

1. Let result an empty string.
2. For each selector (selector) in the group of selectors:
   1. If selector is not the first selector in the group of selectors, then append a U+002C COMMA followed by a newline to result.
   2. Append four U+0020 SPACE characters to result.
   3. Process each sequence of simple selectors or combinator in selector by following algorithm:

      If it is a sequence of simle selector (sss)

      @@

      If it is a combinator (c)

      1. Append two U+0020 SPACE characters to result.

      2. If c is descendant combinator (white space)

         Append a U+0020 SPACE character to result.

         If c is child combinator (>)

         Append a U+003E GREATER-THAN SIGN character to result.

         If c is adjacent sibling combinator (+)

         Append a U+0020 SPACE character to result.

         If c is general sibling combinator (~)

         Append a U+007E TILDE character to result.

      3. Append a U+0020 SPACE character to result.

3. Then, result is the SFFT representation of the group of selectors.

Parsing SFFT Groups of Selectors

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.

Examples

This section is informative.

...