The program to do the checking is simple. Recursion on trees is simple.
You can write it in maxima. It would be a short exercise in an introductory
programming course at my university.
If you mean simple = someone has already written this program, then no, it
is not simple.
Perhaps the translate() function does some semantic static checking, but it
won't do everything you ask.
RJF
> -----Original Message-----
> From: Juhana Antero Yrj?l? [mailto:jayrjola at cc.hut.fi]
> Sent: Tuesday, October 09, 2007 8:57 AM
> To: Richard Fateman
> Subject: RE: [Maxima] A simple way to parse/check equations?
>
> Hi
> Again guess i was not clear enough. I asked that is there a
> SIMPLE way of
> doing this.
>
> Of course this can be done even with assembly-language.
> I take that your aswer is no, since it requires LISP/Maxima code and
> function writing. Trust me Maxima is not the best enviroment
> to program.
............
But there are some people who would say that Lisp IS the best environment.
RJF