Re: [csswg-drafts] [selectors] Backwards combinators (#12453)

• From: Oriol Brufau via GitHub <noreply@w3.org>
• Date: Mon, 07 Jul 2025 23:32:43 +0000
• To: public-css-archive@w3.org
• Message-ID: <issue_comment.created-3046811089-1751931161-noreply@w3.org>

There is no higher precedence depending on the combinator, precedence is only given by order.

Processing combinators right to left:
```
A B < C D
    ▼ Start grouping pairwise, do the right-most combinator first
:is(A B < C) D
    ▼ Continue grouping pairwise, recursing into the LHS (left-hand side)
:is(:is(A B) < C) D
    ▼ The LHS `A B` is already a pair, so no more recursion needed.
    ▼ Apply the definition of `<` to its pair of operands:
:is(C:has(> :is(A B))) D
    ▼ Simplify:
C:has(> :is(A B)) D
```

Saying `A B < C` is `A C:has(> B)` would be like saying `A B C` is `A :is(B C)`

| Short | Full | Without `<` |
| - | - | - |
| `A B C` | `:is(A B) C` |  |
| `A B<C` | `:is(A B)<C` | `C:has(>:is(A B)` |

-- 
GitHub Notification of comment by Loirooriol
Please view or discuss this issue at https://github.com/w3c/csswg-drafts/issues/12453#issuecomment-3046811089 using your GitHub account


-- 
Sent via github-notify-ml as configured in https://github.com/w3c/github-notify-ml-config

Received on Monday, 7 July 2025 23:32:44 UTC