// REXPLORE

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 string

QUANTIFIERS

* 0 or more
+ 1 or more
? 0 or 1
{n} exactly n
{n,} n or more
{n,m} n to m
*? +? ?? lazy versions

GROUPS

(abc) capture group
(?:abc) non-capture
(?=abc) lookahead
(?!abc) neg lookahead
(?<=abc) lookbehind
(?<!abc) neg lookbehind
(?<name>abc) named group

CHAR CLASSES

[abc] a, b, or c
[^abc] not a, b, c
[a-z] range a to z
[a-zA-Z] letter

SPECIAL

a|b a or b
\ escape special
regex visualizer + tester
token analysis + AST tree
match highlighting
zero dependencies // bbobop.com