I wonder if Parse::RecDescent would be suitable for this problem instead of writing a monster regexp.

At least it would more easily handle the recursion that is suggested by your examples.

--t. alex

"Nyahhh (munch, munch) What's up, Doc?" --Bugs Bunny