In message "[ruby-talk:9078] Re: Regexp for matching Ruby reg exps?"
>     on 01/01/11, "Ben Tilly" <ben_tilly / hotmail.com> writes:
> >Friedl's solution only handles nesting to a limited depth.
> >Enough for parsing email addresses but not a general
> >solution.  Not only is handling arbitrary nesting in a

Which means that if you build a parser to handle nesting of parens up
to, say, 1000 deep, that you'd be able to defeat this parser by giving
it an expression with a deeper nesting than that.  Theoretically true
but not very practical.  Realistically, assuming some reasonable fixed
limit on nesting, is the problem then (fairly simply) solveable?

craig