\u00a7Meta characters
\n([{\\^$|)?*+<\/p>\n
\u2022Escape meta character
\n\\
\n\\Q\\E<\/p>\n
\u00a7Classes
\n\tare enclosed within []
\n\u2022Simple class
\n[abc]:\ta, b, or c
\n\u2022Negation
\n[^abc]:\tany character except a,b,c
\n\u2022Ranges
\n[a-c]:\tcharacter a to c
\n\u2022Unions
\n[0-4[6-8]]
\n\u2022Intersections
\n[0-9&&[345]]:\t\t3,4,5
\n\u2022Substraction
\n[0-9&&[^345]]: \texcept 3,4,5<\/p>\n
\u00a7Predefined character classes
\n.\tany character
\n\\d\ta digit [0-9]
\n\\D\ta non digit [^0-9]
\n\\s\ta whitespace character
\n\\S\ta non-whitespace character
\n\\w\ta word character [a-zA-Z_0-9]
\n\\W\ta non-word character[^\\w]<\/p>\n
\u00a7Qualifiers
\ngreedy\treluctant\tpossessive
\nx?\t\tx??\t\tx?+
\nX*
\nx+
\nx{n}
\nx{n,}
\nx{n,m}<\/p>\n
\u00a7Capturinq groups
\n()<\/p>\n
\u00a7Back reference
\n(\\d\\d)\\1<\/p>\n
\u00a7Boundary Matchers
\n^\tbegin of a line
\n$\tend of a line
\n\\b\ta word boundary
\n\\B\ta non-word boundary
\n\\A\tbeqin of the input
\n\\G\tend of previous match
\n\\Z\tend of the input but for the final terminator, if any
\n\\z\tend of input<\/p>\n","protected":false},"excerpt":{"rendered":"
\u00a7Meta characters ([{\\^$|)?*+ \u2022Escape meta character \\ \\Q\\E \u00a7Classes are enclosed within [] \u2022Simple class [abc]: a, b, or c \u2022Negation [^abc]: any character except a,b,c \u2022Ranges [a-c]: character a to c \u2022Unions [0-4[6-8]] \u2022Intersections [0-9&&[345]]: 3,4,5 \u2022Substraction [0-9&&[^345]]: except … Continue reading