On 10/9/07, Michael Bevilacqua-Linn <michael.bevilacqualinn / gmail.com> wrote:
> [snip]
>
> ??
> >
> > I agree that for complex cases a regexp is not the solution. A
> > solution like yours counting parens (or with a stack) should be
> > preferred way.

> Yep, parsing something with an arbitrarily stacked parentheses is the
> classic example of something that can't be done with a regex.  (Well,
> assuming you actually care about the nested parens.)

I've read that the .NET regex engine has some constructs to recognize
balanced constructs like parens:

http://puzzleware.net/blogs/archive/2005/08/13/22.aspx

Interesting !!

Jesus.