October 1, 2020
Hot Topics:

Understanding Basic Regular Expressions Patterns

  • By Tom Archer
  • Send Email »
  • More Articles »
When I began writing about the .NET implementation of regular expressions, I intended to focus solely on the .NET classes and not on regular expressions themselves. To that end, I started with a couple of very basic tasks that can be formed with regular expressions: splitting strings with the Regex::Split method and using the Match and MatchCollection methods to enumerate found literals or patterns.

Many readers wrote in explaining that they are new to regular expressions, and they want at least an article or two that explain some basic patterns--instead of having all the examples search for literals or unexplained patterns. Therefore, this article presents some very basic regular expression patterns to get people who are new to this area off and running.

Searching for Letters and Words

The first thing to note is that regular expression patterns consist of metacharacters, which are simply characters that represent other characters and tell the regular expressions parser how to scan the input string and what to search for.

The following sections illustrate some basic patterns that utilize some of the more commonly used metacharacters. The end of the article presents a table that you can use as a metacharacter quick-reference when creating your own patterns.

Here's a basic string that all the example patterns in this article use:

John and Harry are members of the Borbon club.
Now, suppose you want to locate all the proper nouns in this sentence. Logically, you would know that you need to locate every capitalized word. In terms of a regular expression pattern, that would look like the following:
[A-Z][a-z]+[ ]*
If you're new to regular expressions, this definitely will look a bit strange at first. The following breakdown explains each of the pattern's components:

The A-Z indicates that you're looking for any letter within the range of a capital A to a capital Z. The square brackets simply group this like the parenthesis in a numeric equation to remove ambiguity.
Once again, a range of characters is being searched for, this time the lower case letters a-z. However, the plus sign (+) after the right bracket indicates that the parser will search for one match to the criteria specified in the brackets. In other words, the parser is being instructed to look for one or more lowercase letters.
[ ]*
This part of the pattern indicates that a space will be located, but the asterisk after the right bracket indicates that the parser will match on zero or any number of spaces. This allows for the pattern to properly handle the end of a string or multiple spaces between words.

So there you have it. The following pattern simply states "Find a capital letter, followed by one or more lowercase letters, followed by any number of spaces."

[A-Z][a-z]+[ ]*

Using this pattern results in the following list of matches:


However, the pattern has two problems. First, it will not catch capitalized abbreviations or acronyms, as it stipulates that only one capital letter will be matched, followed by lowercase letters. Therefore, the current pattern used on the following input value will not yield the match for IBM:
John and Harry are members of the Borbon club at IBM

To fix this problem, you need to modify the pattern as follows where I've bolded change:

[A-Z][A-Z|a-z]+[ ]*
What I've inserted into this pattern is the A-Z range and the vertical bar separator (|), which acts as an "or" operator. Therefore, the pattern now states: "Find a single capital letter followed by one or more upper and lower case letters followed by any number of spaces". The pattern will now yield the following:

The second problem that the pattern has is it doesn't handle singular pronouns correctly. This is the easiest problem to solve. All you need to do is replace the plus sign in the pattern with an asterisk, so that the parser knows that there may not be a sequence of letters following the capital letter. Using an input value of: "John, Harry and I are members of the Borbon club at IBM.", the pattern would be as follows:

[A-Z][A-Z|a-z]*[ ]*
It would yield:


Page 1 of 2

This article was originally published on March 1, 2005

Enterprise Development Update

Don't miss an article. Subscribe to our newsletter below.

Thanks for your registration, follow us on our social networks to keep up-to-date