Ludwig Stecher

Using the keyword `recursion`. For example: ```regexp '(' recursion* ')' | [not '()']+ ``` Compiles to ```regexp \((?R)*\)|[^()]+? ``` Which matches any text with balanced parentheses.

Atomic groups exist to improve matching performance for regex engines that use backtracking by default, but they also change the regex behavior. The regex syntax is this: `(?>atomic group)`. The...

Most regex engines support conditionals à là `(?(?=condition)then|else)` or `(?Pcondition)? (?(foo)then|else)`. The syntax varies slightly between implementations. A subset of this feature can be be made available in engines like...

### Is your feature request related to a problem? Please describe. If you have lots of regexes, rewriting them in pomsky is currently an annoying, elaborate task. ### Describe the...

This would be interesting for people who don't use babel.

### Is your feature request related to a problem? Please describe. There is currently no way to automatically format a pomsky expression. ### Describe the solution you'd like A tool,...

Section about mode modifiers in popular regex engines Here are the best supported mode modifiers: - `(?i)`: case insensitive - `(?m)`: multi-line mode (`^` and `$` match begin/end of line)...

- [x] [Language tour](https://pomsky-lang.org/docs/language-tour/): finished - [x] [Grammar](https://pomsky-lang.org/docs/reference/grammar/): finished - [ ] Check if it is still up to date with the latest version - [x] Documentation of public API...