Save & Share

Flavor

  • PCRE2 (PHP)
  • ECMAScript (JavaScript)
  • Python
  • Golang
  • Java
  • .NET 7.0 (C#)
  • Rust
  • PCRE (Legacy)
  • Regex Flavor Guide

Function

  • Match
  • Substitution
  • List
  • Unit Tests
Sponsors
There are currently no sponsors. Become a sponsor today!
An explanation of your regex will be automatically generated as you type.
Detailed match information will be displayed here automatically.
  • All Tokens
  • Common Tokens
  • General Tokens
  • Anchors
  • Meta Sequences
  • Quantifiers
  • Group Constructs
  • Character Classes
  • Flags/Modifiers
  • Substitution
  • A single character of: a, b or c
    [abc]
  • A character except: a, b or c
    [^abc]
  • A character in the range: a-z
    [a-z]
  • A character not in the range: a-z
    [^a-z]
  • A character in the range: a-z or A-Z
    [a-zA-Z]
  • Any single character
    .
  • Alternate - match either a or b
    a|b
  • Any whitespace character
    \s
  • Any non-whitespace character
    \S
  • Any digit
    \d
  • Any non-digit
    \D
  • Any word character
    \w
  • Any non-word character
    \W
  • Non-capturing group
    (?:...)
  • Capturing group
    (...)
  • Zero or one of a
    a?
  • Zero or more of a
    a*
  • One or more of a
    a+
  • Exactly 3 of a
    a{3}
  • 3 or more of a
    a{3,}
  • Between 3 and 6 of a
    a{3,6}
  • Start of string
    ^
  • End of string
    $
  • A word boundary
    \b
  • Non-word boundary
    \B

Regular Expression
Processing...

Test String

Code Generator

Language

Generated Code

import re regex = re.compile(r"(?P<SYMBOLS>[\#/\-\!=()_:.\[\]])|(?P<NUMBERS>[\d])", flags=re.MULTILINE) test_str = ("#/usr/bin/python3\n" "from bisect import bisect_right\n\n" "def binary_search(vector,x):\n" " i = bisect_right(vector,x)\n" " if i != len(vector)+1 and vector[i-1] == x:\n" " return i-1\n" " return -1\n" " \n" "def is_prime(vector,number):\n" " return 1 if binary_search(vector,number) != -1 else 0 \n" " \n" "def prime_vector(num):\n" " ret = []\n" " for a in range(2,num+1):\n" " if a == 2 or a == 3 or a == 5 or a == 7 or a == 11:\n" " ret.append(a)\n" " elif a %2 == 0 or a%3 == 0 or a%5 == 0 or a%7==0 or a%11 == 0:\n" " continue\n" " else:\n" " ret.append(a)\n" " return ret\n" " \n" "number = int(input())\n" "prime = prime_vector(number)\n" "ret = []\n" "p = 0\n\n" "while number:\n" " if is_prime(prime,number):\n" " ret.append(number)\n" " break\n" " elif number%prime[p] == 0:\n" " ret.append(prime[p])\n" " number = int(number / prime[p])\n" " else:\n" " p = p + 1\n" " \n" "for a in range((len(ret))):\n" " print(ret[a],end=\" \")\n") matches = regex.finditer(test_str) for match_num, match in enumerate(matches, start=1): print(f"Match {match_num} was found at {match.start()}-{match.end()}: {match.group()}") for group_num, group in enumerate(match.groups(), start=1): print(f"Group {group_num} found at {match.start(group_num)}-{match.end(group_num)}: {group}")

Please keep in mind that these code samples are automatically generated and are not guaranteed to work. If you find any syntax errors, feel free to submit a bug report. For a full regex reference for Python, please visit: https://docs.python.org/3/library/re.html