This article has multiple issues. Please help improve it or discuss these issues on the talk page. ( Learn how and when to remove these template messages) The topic of this article may not meet Wikipedia's notability guidelines for products and services. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted. Find sources:  "RE2" software –  news · newspapers · books · scholar · JSTOR (November 2019) ( Learn how and when to remove this message) This article relies excessively on references to primary sources. Please improve this article by adding secondary or tertiary sources. Find sources:  "RE2" software –  news · newspapers · books · scholar · JSTOR (November 2019) ( Learn how and when to remove this message) This article contains content that is written like an advertisement. Please help improve it by removing promotional content and inappropriate external links, and by adding encyclopedic content written from a neutral point of view. (November 2019) ( Learn how and when to remove this message) ( Learn how and when to remove this message)

RE2

Original author(s)	Google
Initial release	March 11, 2010; 14 years ago (2010-03-11) [1]
Stable release	2021-04-01 / April 1, 2021; 3 years ago (2021-04-01) [2]
Repository	github.com/google/re2
Written in	C++
Operating system	Cross-platform
Type	Pattern matching library
License	BSD
Website	github.com/google/re2

RE2 is a software library which implements a regular expression engine via finite-state machines using automata theory, in contrast to almost all other regular expression libraries, which use backtracking implementations. It provides a C++ interface.

RE2 was implemented and used by Google. The library uses an "on-the-fly" deterministic finite-state automaton algorithm based on Ken Thompson's Plan 9 grep. ^[3]

Comparison to PCRE

RE2 generally compares to Perl Compatible Regular Expressions (PCRE) in performance. For certain regular expression operators like | (the operator for alternation or logical disjunction) it exceeds PCRE. On the other hand, unlike PCRE which supports features such as backreferences, RE2 is only able to recognize regular languages due to its construction using the Thompson DFA ^[3] 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.

RE2 has a slightly smaller set of features than PCRE, but has very predictable run-time and a maximum memory allotment. This can make it more suitable for use in server applications, which require boundaries on memory usage and computational time. PCRE, on the other hand supports more features such as lookarounds, backreferences and recursion, but has unpredictable runtime and memory usage which can grow unbounded.

Adoption

Use in Google products

RE2 is used by Google products like Gmail, Google Documents and Google Sheets. ^[4] See GitHub for a documentation of the syntax: RE2 syntax.

In Google Sheets, it is used in the functions RegexMatch(), RegexReplace(), RegexExtract() and the find and replace feature. RegexExtract(), does not use grouping.

Related libraries

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. ^[5]

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

See also

• Comparison of regular expression engines

References