Unfortunately, we have some more complicated grammars...maybe not so difficult, because a directly recursive descendant parser could handle some of them (Excel syntax for example), but something like bison or TXL would be much better...(need to get deeper into TXL..seems promising).
Max "Timur Safin" <[EMAIL PROTECTED]> ha scritto nel messaggio news:[EMAIL PROTECTED] > I believed he meant not the express evaluation in the wide-sense, but rather something > very simplistic like arithmetic evaluation. And for this purposes XECUTE could serve quite > easy (well, even with some preprocessing). > > Ok, in generic sense it could be fun weekend project to implement something like > Parse::RecDescent in Perl. I'll look into it. If time permits. > > Best Regards, > Timur > > On 07.06.2004 17:27, Denver Braughler said the following: > > > Timur Safin wrote: > > > >>Max Sebastiani wrote: > >> > >>>I often face problems which require some basic parsing capabilities (like > >>>evaluating an expression in some language), which is very simple to do in > >>>Java or C++ with some compiler generators, there are so many! > >> > >>Try XECUTE <COS-STATEMENT>. > > > > > > Have you since seen the list of languages he wants to execute? > > The problem is that they are not COS-STATEMENTs.
