i know there are several questions about regex recursion in .net. I can write somewhat complex regex expressions but this recursion is beyond me, i am just not able to write it.
This are the questions closest to what i want.
first question, second question.
but it matches the entire string, i want the matches in a collection preferably the innermost match first or in some order. Also it matches on one opening character and one closing character. Mine is 2 chars for opening and closing, [! and !]
my input string will be something like this.
[!a='test' b='[!a='innertest' b='innervalue'!]'!]
I need to find the innertest section, [!a='innertest' b='innervalue'!],
first and then evaluate it through one of my expression trees. then evaluate the parent one containing it.
Can anyone help with this?
See Question&Answers more detail:os