I remember once here was a question about parser generators, which use
regular expressions instead of EBNF expressions. Somebody answered
EBNF expressions are regular expressions.

The TextTransformer uses for the tokens POSIX style (matching the
longest input) regular expressions with '*', '+' and '?' for repeats
and options and the same syntax is used for the non backtracking
productions.