| Title |
Test
Find
Pattern Title
|
| Expression |
(?<!\\)\[(\\\[|\\\]|[^\[\]]|(?<!\\)\[.*(?<!\\)\])*(?<!\\)\] |
| Description |
This regular expression will find the highest level groups within recursive tokens. For instance, if I have "This is [just [an] example] of the [expression]", it'll find [just [an] example] and [expression], and nothing else. It will also not find an escaped bracket expression. If you want to replace the bracket with curly braces or parenthesis, be careful. As an example, curly braces will be: (?<!\\)\{(\\\{|\\\}|[^\{\}]|(?<!\\)\{.*(?<!\\)\})*(?<!\\)\} |
| Matches |
[just] | [just [an] example] |
| Non-Matches |
\[just] |
| Author |
Rating:
Joaquin Jares
|
| Source |
|
| Your Rating |
|
Title: Actually, it's only one level
Name: Joaquin Jares
Date: 7/21/2005 1:13:23 PM
Comment:
I may have stated it incorrectly. This regex will only find the highest level groups. Then I can recurse into them manually. What it does is ignore included groups, which is just what I needed.
Title: Not recursive. Just two levels.
Name: Randal L. Schwartz
Date: 7/21/2005 12:26:20 PM
Comment:
It's not possible using a single regular expression to find arbitrarily nested matching character pairs. Read the literature... this is stated time and time again.
Your regex finds only two levels of nested pairs.
