Tree analysis for C programs.

I need to make a tree of (big) C-ANSI programs for some further
formal controls such as invariant properties in loops for instance.
I'd like that tree to be built according to a C parser, and I'd also
like to achieve semantic analyses in order to generate nodes for
'cast' when necessary. Such things must have been done somewhere for
compilers... I've had a look at GCC, but it seems to be much too
complex for what I want to do. Furthermore, many optimizations are
achieved, the tree built during parsing is only done
statement-by-statement and then freed, and, more important, it is not
built for control structures such as loops or conditional expressions
(if...).


If somebody can give me pointers to simple C-analyzers, or perhaps to
very old compilers (without any kind of optimization), or even only
advice... I would greatly appreciate it.


Thanks a lot.


Anne TROTIN. 'atrotin@aigle.saclay.cea.fr'
--

Return to the comp.compilers page.
Search the comp.compilers archives again.