Re: DIANA

["Ira Baxter" <idbaxter@semdesigns.com>]

[-- Warning: decoded text below may be mangled, UTF-8 assumed --]
[-- Attachment #1: Type: text/plain, Size: 1339 bytes --]

"patrick boulay" <boulayp@free.fr> wrote in message
news:494A312B.2000004@free.fr...
> Jean-Pierre Rosen wrote:
> > patrick boulay a �crit :
> >> Hi,
> >> I am looking for a reference on the DIANA ...
> >> patrick
> >
> > Diana was an attempt to standardize the intermediate tree of Ada
> > compilers, ...
> >
> > What kind of application do you have in mind?
> >
> PL/SQL reverse engineering

DIANA simply won't work for that.  It is very specific to Ada.

If you want to work on PL/SQL, you need working parsers and ASTs for PL/SQL.

I think you can use ANTLR to parse and build trees, but after that, you're
completely
on your own.  Fair warning: I have no specific experience with ANTLR than
being a serious
student of the technology they use.
See www.antlr.org.

You can use our DMS to parse and build ASTs for PL/SQL.  DMS provides
all kinds of additional facilities, such as symbol table building, support
for extracting and building control and data flow graphs, iterative data
flow
equuation solvers, point-to analyzers, source-level pattern specificaitons,
rewrite rules written in source notation, and regeneration of compilable
text
from ASTs via prettyprinting.  DMS handles other langauges such
as C, C++, Java, COBOL, and well, Ada to some extent.
See the website, below.


-- 
Ira Baxter, CTO
www.semanticdesigns.com