You could have a look at Parse::RecDescent. It's a general purpose recursive descent parser generator I've used successfully for a number of problems and that is written by Damian Conway.
Roughtly speaking, you specify the syntax of your language in an extended BNF like format and write semantic actions in Perl for the appropriate rules.
Hope this helps, -gjb-
In reply to Re: Perl Script Engine
by gjb
in thread Perl Script Engine
by davebarter
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |