You're in luck, if P::RD doesn't work out. This language isn't recursive, so it can be matched easily with a regex. (If it were recursive, it'd be a little harder, but still doable.)
_____________________________________________________
Jeff[japhy]Pinyan:
Perl,
regex,
and perlhacker.
s++=END;++y(;-P)}y js++=;shajsj<++y(p-q)}?print:??;
Comment on Re: Parse::RecDescent grammar and Parenthesis