RegEx Cheat Sheet & Generator

Regular Expression Theory & Pattern Matching Architecture

A Regular Expression (RegEx or RegExp) is a sequence of characters that specifies a search pattern in text. Originating in theoretical computer science (formal language theory and Stephen Kleene's regular sets), regular expressions are supported natively across every major programming language via state machine engines (Deterministic and Nondeterministic Finite Automata - DFA and NFA).

RegEx patterns power search-and-replace routines, form input validation (email addresses, phone numbers, UUIDs), log parsing, and data scraping. However, due to its dense, compact syntax containing meta-characters, quantifiers, anchors, and lookarounds, writing correct patterns can be challenging even for experienced developers.

Our RegEx Generator & Cheat Sheet provides a visual catalog of pre-built, production-tested regular expressions alongside an interactive builder to construct custom regex patterns with immediate verification.

Common Production RegEx Patterns Cheat Sheet

Standard regex patterns for everyday development tasks:

• Email Address Validation: ^[a-zA-Z0-9._%+-]+@[a-zA-Z0-9.-]+\.[a-zA-Z]{2,}$
• URL / Web Address: https?:\/\/(www\.)?[-a-zA-Z0-9@:%._\+~#=]{1,256}\.[a-zA-Z0-9()]{1,6}\b([-a-zA-Z0-9()@:%_\+.~#?&//=]*)
• IPv4 Address: ^((25[0-5]|(2[0-4]|1\d|[1-9]|)\d)\.?\b){4}$
• ISO 8601 Date (YYYY-MM-DD): ^\d{4}-(0[1-9]|1[0-2])-(0[1-9]|[12]\d|3[01])$
• UUID v4: ^[0-9a-f]{8}-[0-9a-f]{4}-4[0-9a-f]{3}-[89ab][0-9a-f]{3}-[0-9a-f]{12}$
• Strong Password (8+ chars, 1 uppercase, 1 digit, 1 special): ^(?=.*[a-z])(?=.*[A-Z])(?=.*\d)(?=.*[@$!%*?&])[A-Za-z\d@$!%*?&]{8,}$

Regular Expression Engine Flags (g, i, m, s, u)

Regex flags alter the global matching behavior of the pattern:

• g (Global): Find all matching occurrences rather than stopping after the first match.
• i (Case-Insensitive): Match characters regardless of uppercase or lowercase distinctions.
• m (Multiline): Causes ^ and $ to match the start and end of individual lines rather than the entire string.
• s (DotAll): Allows the wildcard dot (.) to match newline characters.
• u (Unicode): Enables full UTF-16 surrogate pair matching for international characters and emojis.

Preventing Catastrophic Backtracking (ReDoS)

Regular Expression Denial of Service (ReDoS) occurs when an NFA regex engine encounters nested quantifiers over overlapping patterns (e.g. (a+)+$). When tested against a string of 30 "a" characters followed by an "x", the engine evaluates millions of combinations, freezing server CPUs. Always test patterns with regex profilers and avoid nested greedy quantifiers.

Common Production RegEx Patterns & Quantifier Greedy vs Lazy Mechanics

Constructing robust regular expressions requires an understanding of pattern quantifiers and boundary assertions. Quantifiers in regex engines are Greedy by default: patterns like <.*> match from the first < to the final > on the entire line, inadvertently matching multiple HTML tags simultaneously.

Appending a question mark creates a Lazy (Reluctant) Quantifier (<.*?>), causing the engine to halt matching at the earliest possible closing delimiter. Our cheat sheet and pattern generator provides instant, battle-tested regular expressions for common validation scenarios (emails, international phone numbers, URLs, IPv4 addresses, hex colors) with comprehensive flag configurations.

Frequently Asked Questions