Related articles |
---|
Calculation of IN sets. sa1@reef.cis.ufl.edu (Scott Alden) (1992-09-21) |
Newsgroups: | comp.compilers |
From: | Scott Alden <sa1@reef.cis.ufl.edu> |
Organization: | Compilers Central |
Date: | Mon, 21 Sep 1992 16:24:09 GMT |
Keywords: | optimize, question |
I am currently working on a project that requires calculation of IN sets
from a flow graph. Can anyone direct me to an algorithm (hopefully easily
implementable) that is fast and elegant. I have already read Aho-Ullman,
"The Theory of Parsing, Translation, and Compiling Vol II" and am not
satisified with the algorithms presented there. Please mail replies to
sa1@reef.cis.ufl.edu
Thanks in advance, Scott D. Alden
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.