Sort word lists rule

[RunDevelopment]

Some regexes contain (potentially long) lists of words. E.g. almost every language over at Prism has at least one regex like this.

For many of those lists, the order of alternatives doesn't matter. I.e. most word lists in Prism are surrounded with \bs. In this case, we are free to reorder (=sort) the alternatives.

Sorting these lists is beneficial because it makes it easier for humans to find words. This makes it easier to maintain the regexes containing these lists.

Another additional advantage is that compression algorithms (e.g. gzip) are typically able to better compress sorted lists. I tested this with a few examples and sorted lists were around 10% smaller when compressed with gzip.

---

This rule is basically order-in-character-class but for groups.