My Eureka Moment With Regular Expressions

Regular expressions are a tough cookie for most programmers to figure out. They are terrifying to look at with their daunting syntax. There is also nothing quite like regular expressions anywhere in programming. Programmers may learn to hack together basic regex expressions, or how to cut and paste some they find online for their needs, but it can be tricky to get a real grasp of the concept. Here I’d like to explain the line of thinking that finally led to me grokking regex.

For reference, I’ll be using the PERL-style regular expression syntax used by languages like PHP. Here’s a Regular Expressions Cheat Sheet That I’ll be referencing throughout this article, and it is a great resource to keep around.

Regular Expressions: A Language Unto Itself

The tricky thing about regular expressions is that it is a language within a programming language. It has its collection of symbols and syntax. Those long, scary strings that regexes are made up of are collections of these symbols and are used to make the pattern you want to match. Think of a regular expression as a sentence, and each one of the symbols as a word.

Writing “Words” in Regular Expressions

Most of the words of your regular expression are made up of a few different language constructs:

Ranges: defining a set of characters that can match. Typical examples are [A-Z] , which means all capital letters, [0-9] or which means all digits. You can combine these as well. A common on is [A-Za-z0-9-_] which would match all letters, numbers, hyphens, and underscores.

, which means all capital letters, or which means all digits. You can combine these as well. A common on is which would match all letters, numbers, hyphens, and underscores. Character Classes: similar to ranges. \s means ‘any white space character’, where \S means ‘any non-white space character’.

means ‘any white space character’, where means ‘any non-white space character’. Metacharacters: characters that have special meaning, the most common being the pipe | character, which means ‘or’ similar to || in most programming languages. A subset of metacharacters is anchors, where can denote the beginning of a string ( ^ ) or the end of a string ( $ ).

character, which means ‘or’ similar to in most programming languages. A subset of metacharacters is anchors, where can denote the beginning of a string ( ) or the end of a string ( ). Quantifiers: quantifiers are a kind of ‘modifier’ to the above patterns. These let you tell the pattern how many of the previous pattern to find The common ones are: * for 0 or more, + for 1 or more, and ? for 0 or 1. You can also explicity state an amount with something like {5} for five characters, or a range, such as {3-6} , which matches anywhere between three and six characters.

Building Patterns with Words

Let’s look at the following example problem:

we have a system that has to match social security numbers. They can look like any of the following: 123-45-6789 123/45/6789 123456789

So, now that we have the set of patterns we want to match, we can start building up smaller words to match each part of the pattern. Writing regular expressions is similar to writing functions or classes: you begin by breaking down the problem, figuring out smaller parts of it, and then start working on combining these smaller solutions into a large one. So let’s begin by writing out our pattern in plain English:

We have the start of the string,

then three digits,

then either a hyphen, forward slash, or neither,

then two digits,

then either a hyphen, forward slash, or neither,

then four digits,

and that is the end of the string.

So, let’s look at this step by step:

We have the start of the string: this is where we start with one of the anchors we mentioned earlier, ^ .

. Three Digits: We discussed the range of digits earlier ( [0-9] ), but that only matches a single digit. To match exactly 3, we will need a quantifier as well. So this word can be written as [0-9]{3} .

), but that only matches a single digit. To match exactly 3, we will need a quantifier as well. So this word can be written as . Either a hyphen, forward slash, or neither: this is going to take another quantifier, but which one? It helps if we rephrase this statement a bit, and think of it like this: “exactly 0 or 1 hyphen or forward slash”. Now we can see that we need the ? quantifier. We also see that we’ll need to use an ‘or’ for this statement. For statements like this, you can wrap this part of the expression in parenthesis so that its clear whats going on. The answer here is (-|/)? . Declaring parts of a regular expression inside of parenthesis like this is called defining a sub-pattern

quantifier. We also see that we’ll need to use an ‘or’ for this statement. For statements like this, you can wrap this part of the expression in parenthesis so that its clear whats going on. The answer here is . Declaring parts of a regular expression inside of parenthesis like this is called defining a sub-pattern Two Digits : similar to above: [0-9]{2} .

: similar to above: . Either a hyphen, forward slash, or neither : same as above: (-|/)? .

: same as above: . Four Digits : similar to above: [0-9]{4} .

: similar to above: . End of the String : another anchor, the $ one this time.

So, now let’s put that all together, and we have a full regular expression:

^[0-9]{3}(-|/)?[0-9]{2}(-|/)?[0-9]{4}$

Tada! Now that you can see how the regular expressions is just a bunch of small parts that fit together, hopefully, you can figure out how to both write regular expressions and read other ones you come across.

This is just the tip of the regex iceberg. There is a whole lot more you can do with it that is much more than the span of this article. Play around with them, refer to the cheat sheet and see what you can come up with.

Edit

I realized there was a small problem with the regular expression above. While this work for most of our cases, there is the scenario of getting a number formatted like so: 123-45/6789 which the pattern would match, even though it is not in a valid format. I asked about this on Stack Overflow And learned about using back references for situations like this. You can use the syntax \1 where 1 is the number of the subpattern you want to reference. By doing so, you can make sure that the second delimiter matches the first. So our regular expression would now look like this: