|Semantical checks that involve flow of execution of the program firstname.lastname@example.org (Lujop) (2004-10-17)|
|Re: Semantical checks that involve flow of execution of the program email@example.com (John Max Skaller) (2004-10-21)|
|Re: Semantical checks that involve flow of execution of the program firstname.lastname@example.org (ChokSheak Lau) (2004-10-21)|
|From:||ChokSheak Lau <email@example.com>|
|Date:||21 Oct 2004 22:30:08 -0400|
|Organization:||Georgia Institute of Technology|
|Posted-Date:||21 Oct 2004 22:30:08 EDT|
To check which variables were never initialized, you need to do
liveness analysis. the variables that are live at the top of the entry
basic block are those that were never initialized (of course, excusing
the function parameters).
if you don't know what is "liveness" or CFG, please feel free to post to the
newsgroup, and I'm sure some kind souls will be willing to help you out.
> I'm writting a compiler for a pseudocode language similar to Java. I
> use a pred-LL(1) parser (with ANTLR) and I construct an AST that I
> walk several times (currently twice) to do the semantical checking.
> Well my question is that I want to do some intelligent checks for
> program flow like Java does.
Return to the
Search the comp.compilers archives again.