balancing-groups

Let's say I have this text input. tes{}tR{R{abc}aD{mnoR{xyz}}} I want to extract the ff output: R{abc} R{xyz} D{mnoR{xyz}} R{R{abc}aD{mnoR{xyz}}} Currently, I can only extract what's inside the {}groups using balanced group approach as found in msdn . Here's the pattern: ^[^{}]*(((?'Open'{)[^{}]*)+((?'Target-Open'})[^{}]*)+)*(?(Open)(?!))$ Does anyone know how to include the R{} and D{} in the output? I think that a different approach is required here. Once you match the first larger group R{R{abc}aD{mnoR{xyz}}} (see my comment about the possible typo), you won't be able to get the subgroups

As a generically brewed example for the purpose of this question, my intent is to match some number of a 's, then an equal number of b 's, plus one more b . Examine the two patterns exhibited in this snippet ( also on ideone.com ): var r1 = new Regex(@"(?xn) (?<A> a)+ (?<B-A> b)+ (?(A)(?!)) b "); var r2 = new Regex(@"(?xn) (?<A> a)+ (?<B-A> b)+? (?(A)(?!)) b "); Console.WriteLine(r1.Match("aaabbb")); // aaabbb Console.WriteLine(r2.Match("aaabbb")); // aabbb Note that there is a difference in the matches of the two patterns. r1 , which uses a greedy repetition on the balancing group construct,

I have a basic text template engine that uses a syntax like this: foo bar %IF MY_VAR some text %IF OTHER_VAR some other text %ENDIF %ENDIF bar foo I have an issue with the regular expression that I am using to parse it whereby it is not taking into account the nested IF/ENDIF blocks. The current regex I'm using is: %IF (?<Name>[\w_]+)(?<Contents>.*?)%ENDIF I have been reading up on balancing capture groups (a feature of .NET's regex library) as I understand this is the recommended way of supporting "recursive" regex's in .NET. I've been playing with balancing groups and have so far came up