MATCHES
TOKENS
AST TREE
QUICK REFERENCE
. any char (except \n)\d digit [0-9]\w word [a-zA-Z0-9_]\s whitespace\D \W \S negations\b word boundary^ start of string$ end of stringQUANTIFIERS
* 0 or more+ 1 or more? 0 or 1{n} exactly n{n,} n or more{n,m} n to m*? +? ?? lazy versionsGROUPS
(abc) capture group(?:abc) non-capture(?=abc) lookahead(?!abc) neg lookahead(?<=abc) lookbehind(?<!abc) neg lookbehind(?<name>abc) named groupCHAR CLASSES
[abc] a, b, or c[^abc] not a, b, c[a-z] range a to z[a-zA-Z] letterSPECIAL
a|b a or b\ escape special
regex visualizer + tester
token analysis + AST tree
match highlighting
zero dependencies // bbobop.com
token analysis + AST tree
match highlighting
zero dependencies // bbobop.com