Non-Greedy Matching Regex Pattern

Live Regex Tester

Pattern Breakdown

Code Examples

const regex = /<.+?>/g;
const test = "<b>bold</b>";
console.log(regex.test(test)); // true

// Extract matches
const matches = test.match(regex);
console.log(matches);

import re

pattern = r'<.+?>'
test = "<b>bold</b>"
match = re.findall(pattern, test)
print(match)  # Found!

package main

import (
    "fmt"
    "regexp"
)

func main() {
    re := regexp.MustCompile(`<.+?>`)
    fmt.Println(re.MatchString("<b>bold</b>")) // true
}

Common Use Cases

Match Examples

About the Non-Greedy Matching Regex

Shows non-greedy (lazy) matching with +? quantifier. Matches shortest possible string instead of longest.

Regular expressions (regex) are powerful pattern matching tools used across virtually all programming languages. The non-greedy matching pattern is classified as <strong>intermediate</strong> difficulty in the <strong>advanced patterns</strong> category. It works in all major programming languages.

When using this regex, always consider edge cases and test thoroughly with real-world data. Use the interactive tester above to validate the pattern against your specific inputs before deploying to production.

More Advanced Patterns Patterns