RE2 (software)

This article has multiple issues. Please help 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:  –  ·  ·  · scholar · JSTOR (November 2019) (Learn how and when to remove this template message) This article relies too much on references to primary sources. Please improve this by adding secondary or tertiary sources. (November 2019) (Learn how and when to remove this template message) This article contains content that is written like an advertisement. Please help 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 template message) (Learn how and when to remove this template message)

RE2

Original author(s)	Google
Initial release	March 11, 2010; 11 years ago (2010-03-11)[1]
Stable release	2021-04-01 / April 1, 2021; 9 months 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 for regular expressions via a finite-state machine 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 is used by Google.

Comparison to PCRE[]

RE2 generally compares to Perl Compatible Regular Expressions (PCRE) in performance. For certain regular expression operators like | (logical disjunction or boolean "or") it exceeds PCRE. On the other hand, RE2 does not support back-references and cannot implement those efficiently. It is also slightly slower than PCRE for parenthetic capturing operations.

PCRE can use a large recursive stack with corresponding high memory use and have exponential runtime on certain patterns. In contrast, RE2 uses a fixed stack and guarantees that run-time 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 makes it suitable for use in server applications which require boundaries on memory usage and computational time. PCRE, on the other hand, has almost all of the features that a regular expression library can have, but has unpredictable run-time and memory usage and can grow unbounded.

Use in Google products[]

RE2 is, for example, used by Google products like Gmail, Google Documents and Google Sheets.^[3] 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.

See also[]

• Comparison of regular expression engines

References[]