<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
    <title>regexp</title>
    <link rel="self" type="application/atom+xml" href="https://links.biapy.com/guest/tags/633/feed"/>
    <updated>2026-09-20T23:37:34+00:00</updated>
    <id>https://links.biapy.com/guest/tags/633/feed</id>
            <entry>
            <id>https://links.biapy.com/links/13355</id>
            <title type="text"><![CDATA[Regex Vis]]></title>
            <link rel="alternate" href="https://regex-vis.com/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/13355"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[🎨 Regex visualizer &amp;amp; editor 

- [Regex Vis @ GitHub](https://github.com/Bowen7/regex-vis).]]>
            </summary>
            <updated>2026-07-21T06:48:01+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/12758</id>
            <title type="text"><![CDATA[Regex Blaster]]></title>
            <link rel="alternate" href="https://mdp.github.io/regex-blaster/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/12758"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[PATTERN MATCHING DEFENSE.
Write regex patterns to destroy falling strings.]]>
            </summary>
            <updated>2026-05-15T10:45:35+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/12280</id>
            <title type="text"><![CDATA[RE#]]></title>
            <link rel="alternate" href="https://github.com/ieviev/resharp-dotnet" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/12280"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[RE# - A high-performance, automata based regex engine with first-class support for intersection and complement operations. 

RE# compiles patterns into deterministic automata. All matching is non-backtracking with guaranteed linear-time execution. RE# extends System.Text.RegularExpressions syntax with intersection (&amp;amp;), complement (~), and a universal wildcard (_), enabling patterns that are impossible or impractical to express with standard regex. 

Related contents:

- [RE#: how we built the world&amp;#039;s fastest regex engine in F# @ ian erik varatalu](https://iev.ee/blog/resharp-how-we-built-the-fastest-regex-in-fsharp/).
- [finding all regex matches has always been O(n²). even in the engines built to prevent it @ ian erik varatalu](https://iev.ee/blog/the-quadratic-problem-nobody-fixed/).]]>
            </summary>
            <updated>2026-03-24T13:53:48+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/11117</id>
            <title type="text"><![CDATA[grex]]></title>
            <link rel="alternate" href="https://pemistahl.github.io/grex-js/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/11117"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[Generate regular expressions from test cases.

 A command-line tool and Rust library with Python bindings for generating regular expressions from user-provided test cases.

- [grex @ GitHub](https://github.com/pemistahl/grex).]]>
            </summary>
            <updated>2025-11-28T10:26:24+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/10829</id>
            <title type="text"><![CDATA[emoji-regex]]></title>
            <link rel="alternate" href="https://github.com/mathiasbynens/emoji-regex" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/10829"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[A regular expression to match all Emoji-only symbols as per the Unicode Standard.

emoji-regex offers a regular expression to match all emoji symbols and sequences (including textual representations of emoji) as per the Unicode Standard. It’s based on emoji-test-regex-pattern, which generates (at build time) the regular expression pattern based on the Unicode Standard. As a result, emoji-regex can easily be updated whenever new emoji are added to Unicode.]]>
            </summary>
            <updated>2025-10-30T13:22:14+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/10273</id>
            <title type="text"><![CDATA[Regex Utils 🔤]]></title>
            <link rel="alternate" href="https://gruhn.github.io/regex-utils/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/10273"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[TypeScript library for regex equivalence, intersection, complement and other utilities that go beyond string matching. 

Zero-dependency TypeScript library for regex utilities that go beyond string matching. These are surprisingly hard to come by for any programming language. ✨

- [RegExp Equivalence Checker homepage](https://gruhn.github.io/regex-utils/equiv-checker.html).
- [Regex Utils 🔤 @ GitHub](https://github.com/gruhn/regex-utils).]]>
            </summary>
            <updated>2025-09-18T13:49:34+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/491</id>
            <title type="text"><![CDATA[RE2]]></title>
            <link rel="alternate" href="https://github.com/google/re2" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/491"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[RE2 is a fast, safe, thread-friendly alternative to backtracking regular expression engines like those used in PCRE, Perl, and Python. It is a C++ library.

Related contents:

- [Fast(er) regular expression engines in Ruby @ SerpApi](https://serpapi.com/blog/faster-regular-expression-engines-in-ruby/).]]>
            </summary>
            <updated>2025-08-28T17:19:54+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/492</id>
            <title type="text"><![CDATA[regex - Rust]]></title>
            <link rel="alternate" href="https://docs.rs/regex/latest/regex/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/492"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[This crate provides routines for searching strings for matches of a regular expression (aka “regex”). The regex syntax supported by this crate is similar to other regex engines, but it lacks several features that are not known how to implement efficiently. This includes, but is not limited to, look-around and backreferences. In exchange, all regex searches in this crate have worst case O(m * n) time complexity, where m is proportional to the size of the regex and n is proportional to the size of the string being searched.

- [Rust regex @ GitHub](https://github.com/rust-lang/regex).

Related contents:

- [Fast(er) regular expression engines in Ruby @ SerpApi](https://serpapi.com/blog/faster-regular-expression-engines-in-ruby/).]]>
            </summary>
            <updated>2025-08-28T17:19:55+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/1134</id>
            <title type="text"><![CDATA[OpenRegex]]></title>
            <link rel="alternate" href="https://github.com/SunneV/OpenRegex" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/1134"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[OpenRegex is a simple, self-hosted, web-based regular expression (regex) tester and debugger.]]>
            </summary>
            <updated>2025-08-28T19:04:52+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/3598</id>
            <title type="text"><![CDATA[Regexper]]></title>
            <link rel="alternate" href="https://regexper.com/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/3598"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[Regular Expression Visualization Site (static site version)

- [Regexper @ GitLab](https://gitlab.com/javallone/regexper-static).]]>
            </summary>
            <updated>2025-08-29T01:57:16+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/4400</id>
            <title type="text"><![CDATA[RegExpBuilderPHP]]></title>
            <link rel="alternate" href="https://github.com/gherkins/regexpbuilderphp" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/4400"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[🦉 human-readable regular expressions. PHP port of regexpbuilderjs

RegExpBuilder integrates regular expressions into the programming language, thereby making them easy to read and maintain. Regular Expressions are created by using chained methods and variables such as arrays or strings.]]>
            </summary>
            <updated>2025-08-29T04:10:28+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/4637</id>
            <title type="text"><![CDATA[beberlei/DoctrineExtensions]]></title>
            <link rel="alternate" href="https://github.com/beberlei/DoctrineExtensions" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/4637"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[A set of extensions to Doctrine 2 that add support for functions available in MySQL, Oracle, PostgreSQL and SQLite.]]>
            </summary>
            <updated>2025-08-29T04:50:48+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/4653</id>
            <title type="text"><![CDATA[Rubular]]></title>
            <link rel="alternate" href="https://rubular.com/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/4653"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[Rubular is a Ruby-based regular expression editor. It&amp;#039;s a handy way to test regular expressions as you write them.]]>
            </summary>
            <updated>2025-08-29T04:52:46+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/4767</id>
            <title type="text"><![CDATA[Regulex]]></title>
            <link rel="alternate" href="https://jex.im/regulex/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/4767"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[JavaScript Regular Expression Visualizer.

- [Regulex @ GitHub](https://github.com/CJex/regulex).]]>
            </summary>
            <updated>2025-08-29T05:11:02+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/5761</id>
            <title type="text"><![CDATA[🦜 Super Expressive]]></title>
            <link rel="alternate" href="https://github.com/francisrstokes/super-expressive" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/5761"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[Super Expressive is a zero-dependency JavaScript library for building regular expressions in (almost) natural language.

Super Expressive is a JavaScript library that allows you to build regular expressions in almost natural language - with no extra dependencies, and a lightweight code footprint (less than 4kb with minification + gzip!).]]>
            </summary>
            <updated>2025-11-04T12:57:51+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/6320</id>
            <title type="text"><![CDATA[i Hate Regex]]></title>
            <link rel="alternate" href="https://ihateregex.io/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/6320"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[The Regex Cheat Sheet]]>
            </summary>
            <updated>2025-08-29T09:30:12+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/6680</id>
            <title type="text"><![CDATA[Regex Learn - Step by step, from zero to advanced.]]></title>
            <link rel="alternate" href="https://regexlearn.com/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/6680"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[Learn Regex step by step, from zero to advanced.
Learning Regex is easier than you think. You can use this tool to easily learn, practice, test and share Regex.]]>
            </summary>
            <updated>2025-08-29T10:30:44+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/7127</id>
            <title type="text"><![CDATA[regex101]]></title>
            <link rel="alternate" href="https://regex101.com/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/7127"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[build, test, and debug regex]]>
            </summary>
            <updated>2025-08-29T11:46:23+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/8854</id>
            <title type="text"><![CDATA[Regexper]]></title>
            <link rel="alternate" href="http://www.regexper.com/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/8854"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[You thought you only had two problems...]]>
            </summary>
            <updated>2025-08-29T16:33:17+00:00</updated>
        </entry>
    </feed>
