Other than lex/yacc

Hi,

I am looking for clean and efficient lexical/parser tool which generates
(abstract) syntax trees, symbol table information and easily manipulatable
intermediate form. It would be great if the tool allows handling
assertions/comments also.

I intend to derive verification conditions for the input program ( may be in
written in C,Java, or my own toy language).


Any thing other than Lex/Yacc.

regards

On 23 Aug 2004 12:06:56 -0400, umar wrote:

> Any thing other than Lex/Yacc.

This is definitely not Lex/Yacc:

http://www.dmitry-kazakov.de/ada/components.htm

It contains a parser for infix expressions capable to generate syntax
trees. No grammar required, (well, you need not to lay it down (:-))

--
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de

On 23 Aug 2004 12:06:56 -0400, umar <muj20@cam.ac.uk> wrote:

> I am looking for clean and efficient lexical/parser tool which
> generates (abstract) syntax trees, symbol table information and
> easily manipulatable intermediate form. It would be great if the
> tool allows handling assertions/comments also.
>
> I intend to derive verification conditions for the input program
> (may be in written in C,Java, or my own toy language).
>
> Any thing other than Lex/Yacc.

I feel I have to mention the Prolog programming language.

A free interpreter (which I can recommend) and tutorial are to be
found at:

http://www.amzi.com

but there are many other Prolog resources on the web.

I am considering using Prolog for my own purposes, for much the same
reasons you cite. It is not a parsing tool as such, but it is
readily programmed to do parsing (to generate trees) and tree
manipulations. Prolog can be used interactively, and structures are
easily played with. Just a thought.

--
Nick Roberts

"umar" <muj20@cam.ac.uk> wrote
> I am looking for clean and efficient lexical/parser tool which generates
> (abstract) syntax trees, symbol table information and easily manipulatable
> intermediate form. It would be great if the tool allows handling
> assertions/comments also.
>
> I intend to derive verification conditions for the input program (
> may be in written in C,Java, or my own toy language).

The DMS Software Reengineering Toolkit meets all of these
requirements.  It has front ends including full symbol table
construction for C, C++, COBOL and Java.  The ASTs are directly
manipulable via source to source transformations or analyzable via
attribute evaluation.  See
http://www.semanticdesigns.com/Prod...MSToolkit.html.


--
Ira D. Baxter, Ph.D., CTO   512-250-1018
Semantic Designs, Inc.      www.semdesigns.com