RE2 (software) 📖 Wikipedia

RE2
Original author	Google
Release	March 11, 2010; 16 years ago (2010-03-11)[1]
Stable release	2021-04-01 / August 12, 2025; 10 months ago (2025-08-12)[2]
Written in	C++
Operating system	Cross-platform
Type	Regular expression library
License	BSD
Website	github.com/google/re2
Repository	github.com/google/re2

RE2 is a C++ software library^[3] which implements a regular expression engine^[3]. It uses finite-state machines, in contrast to most other regular expression libraries. RE2 requires a minimum C++ version of C++17, and uses the Abseil library by Google.

RE2 was implemented by Google and Google uses RE2 for Google products.^[4] RE2 uses an "on-the-fly" deterministic finite-state automaton algorithm based on Ken Thompson's Plan 9 grep.^[5] It is designed to avoid ReDoS (regex denial of service) attacks.

RE2 performs comparably to Perl Compatible Regular Expressions (PCRE). For certain regular expression operators like | (the operator for alternation or logical disjunction) it is superior to PCRE. Unlike PCRE, which supports features such as lookarounds, backreferences and recursion, RE2 is only able to recognize regular languages due to its construction using the Thompson DFA^[5] algorithm. It is also slightly slower than PCRE for parenthetic capturing operations.

PCRE can use a large recursive stack with corresponding high memory usage and result in exponential runtime on certain patterns. In contrast, RE2 uses a fixed stack size and guarantees that its runtime increases linearly (not exponentially) with the size of the input. The maximum memory allocated with RE2 is configurable. This can make it more suitable for use in server applications, which require boundaries on memory usage and computational time.

RE2 is available to users of Google Docs and Google Sheets.^[6] Google Sheets supports RE2 except Unicode character class matching.^[7] RegexExtract does not use grouping.

Here is an example of using re2 against a potential ReDoS (regular expression denial of service) attack.

import <re2/re2.h>;

import std;

using std::string;
using re2::RE2;

int main(int argc, char* argv[]) {
    string text = "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa!"
    string pattern = "(a+)+$";
    bool match = RE2::FullMatch(text, pattern);
    std::println("Match result: {}", match);
}

RE2 comes with a built-in Python wrapper, available on Python Package Index (PyPI) as google-re2.^[8]

The built-in regexp package in Go uses the same patterns and implementation as RE2, though it is written in Go.^[9] This is unsurprising, given Go's common staff from the Plan 9 team.

The RE2 algorithm has been rewritten in Rust as the package regex. CloudFlare's web application firewall uses this package because the RE2 algorithm is immune to ReDoS.^[10]

Russ Cox also wrote RE1, an earlier regular expression based on a bytecode interpreter.^[11] OpenResty uses a RE1 fork called "sregex".^[12]

There is an official Java binding, called RE2J (com.google.re2j).^[8]

The following languages have unofficial bindings:^[8]

• C (cre2)
• D (re2d)
• Erlang (re2)
• Inferno (inferno-re2)
• JavaScript (RE2JS), a port of RE2J to JavaScript
• Node.js (node-re2)
• OCaml (re2)
• Perl (re-engine-RE2)
• R (re2)
• Ruby (re2)
• WebAssembly (re2-wasm)

• Comparison of regular expression engines