Register to get access to free programming courses with interactive exercises

Look forward/backward Regular Expressions (Regexp)

Most implementations of regular expressions support “lookahead” and “lookback”, or “lookbehind” and “lookback”. Let's see what they're for.

We have the following regular expression, which two substrings:


LudovicXV, LudovicXVI, LudovicXVIII, LudovicLXVII, LudovicXXL

Suppose we don't need to include the part of the substring with the Roman numerals XVI in the search results. To do this, we can wrap it up like this:


LudovicXV, LudovicXVI, LudovicXVIII, LudovicLXVII, LudovicXXL

As we can see, the matching conditions set by the original expression haven't changed. The same substring was matched as in the previous example. However, the characters XVI in the matched substring weren't included in the final search result. This behavior is called positive lookahead.

The logic of positive lookahead can be described as follows. The regular expression a(?=b) finds matches where a, is followed by b, but without making b part of the match.

Forward lookahead can also be negative. In that case, it will look for matches in those substrings where the part of the substring specified in brackets is not there. In our case, that's still XVI. To turn a positive lookahead into a negative one, replace = with !. Now we have the other three substrings matched:


LudovicXV, LudovicXVI, LudovicXVIII, LudovicLXVII, LudovicXXL

In addition to lookahead, there's also lookbehind, or retrospective searching. It works in a similar way, but it looks for matches of characters after the bracketed part of the regular expression (the bracketed part isn't included in the match).

In other words, the regular expression (?<=b)a finds matches of a, that have b in front of it, but without making b part of the match.

An additional sign <. is used for positive lookbehind. In this example, we find a match for the substring Two, which is followed by One:

/(?<=One )Two/

One Two, Three Two

To change the positive lookbehind back to negative, we change = to ! like with lookahead:

/(?<!One )Two/

One Two, Three Two

Hexlet Experts

Are there any more questions? Ask them in the Discussion section.

The Hexlet support team or other students will answer you.

About Hexlet learning process

For full access to the course you need a professional subscription.

A professional subscription will give you full access to all Hexlet courses, projects and lifetime access to the theory of lessons learned. You can cancel your subscription at any time.

Get access
hours of theory

Sign up

Programming courses for beginners and experienced developers. Start training for free

  • 130 courses, 2000+ hours of theory
  • 1000 practical tasks in a browser
  • 360 000 students
By sending this form, you agree to our Personal Policy and Service Conditions

Our graduates work in companies:

<span class="translation_missing" title="translation missing:">Bookmate</span>
<span class="translation_missing" title="translation missing:">Healthsamurai</span>
<span class="translation_missing" title="translation missing:">Dualboot</span>
<span class="translation_missing" title="translation missing:">Abbyy</span>
Suggested learning programs
Development of front-end components for web applications
10 months
from scratch
Start at any time

Use Hexlet to the fullest extent!

  • Ask questions about the lesson
  • Test your knowledge in quizzes
  • Practice in your browser
  • Track your progress

Sign up or sign in

By sending this form, you agree to our Personal Policy and Service Conditions
Toto Image

Ask questions if you want to discuss a theory or an exercise. Hexlet Support Team and experienced community members can help find answers and solve a problem.