dlclark/regexp2
A full-featured regex engine in pure Go based on the .NET engine observed · 2026-08-28
Health v2 · maintenance only
76/100
- Activity 97
- Release rhythm 35
- Longevity 100
Flags: no_releases
How is this computed?
round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10) — computed 2026-09-03. Adoption (stars, forks) is never an input.
- gap_med: n/a
- age_days: 3898
- days_rel: n/a
- days_push: 19
- n_releases_24m: 0
Adoption not part of the score
1183 stars · 95 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded
A full-featured regular expression engine for Go, ported from the .NET regex engine. It supports backtracking and Perl5/.NET-compatible patterns, trading the built-in regexp package's constant-time guarantees for expressive power.
Use cases
- use complex regex patterns with backtracking in Go
- match .NET-compatible regular expressions in Go
- use Perl5 regex features not supported by Go's regexp package
- split strings with regex matches in Go
- migrate .NET regex patterns to a Go application
When to choose
- you need backtracking, lookarounds, or other advanced regex features RE2 lacks
- you need pattern compatibility with .NET or Perl5
- you're porting code that relies on .NET regex semantics
When to avoid
- you need constant-time matching guarantees against catastrophic backtracking (use Go's built-in regexp/RE2)
- your patterns are simple and well-served by the standard library
- you're processing untrusted input where regex DoS is a concern
Facets
library · maturity active
parser developer-tools parsers go cross-platform regex-engine backtracking dotnet-compatible perl5-regex text-processing
1 source
- readme: https://github.com/dlclark/regexp2 · fetched 2026-08-28 · d5f701c4bd92
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| dlclark/regexp2 | main | 76 |
For agents
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem