Related articles |
---|
def-use and use-def chain... sreedhar@flo.cs.mcgill.ca (V.C. Sreedhar) (1992-07-12) |
Re: def-use and use-def chain... preston@dawn.cs.rice.edu (1992-07-13) |
Re: def-use and use-def chain... lins@Apple.COM (1992-07-13) |
Summary (def-use chain) sreedhar@flo.cs.mcgill.ca (V.C. SREEDHAR) (1992-07-30) |
re: finding use-def and def-use chains uday@kailash.cse.iitb.ernet.in (1992-08-05) |
Re: finding use-def and def-use chains preston@dawn.cs.rice.edu (1992-08-07) |
Newsgroups: | comp.compilers |
From: | V.C. Sreedhar <sreedhar@flo.cs.mcgill.ca> |
Organization: | Compilers Central |
Date: | Sun, 12 Jul 1992 21:10:30 GMT |
Keywords: | optimize, question |
I am developing some of the dataflow analysis in our compiler.
Can anyone point to me an efficient way of representing
for def-use and use-def chain? I am looking space efficient algorithms
(bit vectors). I need to represent both du and ud chains.
Thanks
Sreedhar
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.