The syntax is based on the use of regular expressions.
The result is similar to that for regular expressions, and won't be detailed here.
Sometimes they make decisions based on matching a regular expression.
In a regular expression, it represents a match of any character.
Indeed this language may be defined by a finite regular expression.
We consider two such regular expressions equal if they describe the same language.
Note that the above cases are in effect the defining rules of regular expression.
Any regular expression may be used as the rule pattern.
This grammar describes the same language as the regular expression a*bc*.
A regular expression is then used by a special program or part of a programming language.