|From quads to AST email@example.com (1993-08-10)|
|Re: From quads to AST firstname.lastname@example.org (1993-08-13)|
|Re: From quads to AST email@example.com (1993-08-18)|
|From:||firstname.lastname@example.org (Daniel Weise)|
|Organization:||Computer Systems Laboratory, Stanford University|
|Date:||Fri, 13 Aug 1993 21:16:13 GMT|
email@example.com (Clement Cheung) writes:
Is it possible to reconstruct from quads the AST of a program? If yes,
how? What other information besides the quads is needed? Is there any
The reason I ask is that a lot of neat applications such as construction
of program dependence graph starts from AST rather than quads.
The construction of the PDG starts from a CFG, not an AST. A PDG
consists of an intertwining of a data dependence graph (DDG) and a
control dependence graph (CDG). Methods for constructing a CDG all
start from a CFG. The standard PDG paper (Ferrante, Ottenstein, and
Warren, TOPLAS 86?) isn't too clear on the DDG part, but it can also
be constructed from the CFG.
Going from quads to CFGs is simple. It's described in the red dragon
Return to the
Search the comp.compilers archives again.