Regular expressions

Top  Previous  Next

Introduction > Regular expressions


As already mentioned, the pieces to which TETRA takes the text are called token or terminal symbols. They are identified by regular expressions. Regular expressions are well known from many script languages or text processing programs. They extend the possibilities of finding words, because by them not only special, single words can be found, but also words contained in a group of words of a common pattern.


Regular expressions define by means of some simple rules patterns of characters, i.e., they describe the order in which characters can follow each other.

Typical token defined by regular expressions are words, numbers, times, data, quotes etc.


This page belongs to the TextTransformer Documentation

Home  Content  German