A Guide to the S-Lang Language: Regular Expressions

Next Previous Contents

## 18. Regular Expressions

The S-Lang library includes a regular expression (RE) package that may be used by an application embedding the library. The RE syntax should be familiar to anyone acquainted with regular expressions. In this section the syntax of the S-Lang regular expressions is discussed.

## 18.1 S-Lang RE Syntax

A regular expression specifies a pattern to be matched against a string, and has the property that the contcatenation of two REs is also a RE.

The S-Lang library supports the following standard regular expressions:

> `

>        .                 match any character except newline
>        *                 matches zero or more occurences of previous RE
>        +                 matches one or more occurences of previous RE
>        ?                 matches zero or one occurence of previous RE
>        ^                 matches beginning of a line
>        $                 matches end of line
>        [ ... ]           matches any single character between brackets.
>                          For example, [-02468] matches `-' or any even digit.
>                          and [-0-9a-z] matches `-' and any digit between 0 and 9
>                          as well as letters a through z.
>        \<                Match the beginning of a word.
>        \>                Match the end of a word.
>        \( ... \)
>        \1, \2, ..., \9   Matches the match specified by nth \( ... \)
>                          expression.

> `

In addition the following extensions are also supported:

> `

>        \c                turn on case-sensitivity (default)
>        \C                turn off case-sensitivity
>        \d                match any digit
>        \e                match ESC char

> `

Here are some simple examples:

`"^int "` matches the `"int "` at the beginning of a line.

`"\<money\>"` matches `"money"` but only if it appears as a separate word.

`"^$"` matches an empty line.

A more complex pattern is

> `

>       "\(\<[a-zA-Z]+\>\)[ ]+\1\>"

> `

which matches any word repeated consecutively. Note how the grouping operators `\(` and `\)` are used to define the text matched by the enclosed regular expression, and then subsequently referred to `\1`.

Finally, remember that when used in string literals either in the S-Lang language or in the C language, care must be taken to "double-up" the `'\'` character since both languages treat it as as an escape character.

## 18.2 Differences between S-Lang and egrep REs

There are several differences between S-Lang regular expressions and, e.g., egrep regular expressions.

The most notable difference is that the S-Lang regular expressions do not support the OR operator `|` in expressions. This means that `"a|b"` or `"a\|b"` do not have the meaning that they have in regular expression packages that support egrep-style expressions.

The other main difference is that while S-Lang regular expressions support the grouping operators `\(` and `\)`, they are only used as a means of specifying the text that is matched. That is, the expression

> `

>          "@\([a-z]*\)@.*@\1@"

> `

matches `"xxx@abc@silly@abc@yyy"`, where the pattern `\1` matches the text enclosed by the `\(` and `\)` expressions. However, in the current implementation, the grouping operators are not used to group regular expressions to form a single regular expression. Thus expression such as `"\(hello\)*"` is not a pattern to match zero or more occurances of `"hello"` as it is in e.g., egrep.

One question that comes up from time to time is why doesn't S-Lang simply employ some posix-compatible regular expression library. The simple answer is that, at the time of this writing, none exists that is is available across all the platforms that the S-Lang library supports (Unix, VMS, OS/2, win32, win16, BEOS, MSDOS, and QNX) and can be distributed under both the GNU and Artistic licenses. It is particularly important that the library and the interpreter support a common set of regular expressions in a platform independent manner.

Next Previous Contents