Article View: fj.mail-lists.parallel
Article #220Re: Constructing Control Flow Graph
From: Sadun Anik
Date: Tue, 25 Aug 1992 19:14
Date: Tue, 25 Aug 1992 19:14
29 lines
1575 bytes
1575 bytes
In article <1992Aug25.130859.2832@hubcap.clemson.edu> lka@lems1alems.brown.edu (Lalit K. Agarwal) writes: I'm looking for any published material on actual implementation methods & data-structures for constructing control-flow & dependence graphs of a c-program. All responses will be greatly appreciated. I would strongly recommend "The Red Dragon", the must have book for anybody interested in detailed compiler techniques. It covers everything from lexical analysis and parsing to code generation. It does provide algortihms for control-flow, data-flow analysis and many related optimizations. The real name and other info follows. Compilers, principles, techniques, and tools by Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman ISBN 0-201-10088-6 Published by Addison-Wesley. The book cover illustrates a compiler writer wearing an armor of compiler tools and the red dragon of "complexity of compiler design". In our compiler project here, all (well almost all) the flow based algorihtms from this book has been implemented with success. -- Sadun Anik, U of Illinois at Urbana-Champaign Center for Reliable and High-performance Computing e-mail: anik@crhc.uiuc.edu
Technical Details
Message-ID:
<314271@nttlab.ntt.JP>Path:
arc1-ca.pugleaf.net!sparky!uunet!sun-barr!sh.wide!wnoc-snd-ss2!akiu!hakata!kyu-cs!lab!nttlab!daemonShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!sun-barr!sh.wide!wnoc-snd-ss2!akiu!hakata!kyu-cs!lab!nttlab!daemon From: anik@crhc.uiuc.edu (Sadun Anik) Newsgroups: fj.mail-lists.parallel Subject: Re: Constructing Control Flow Graph Message-ID: <314271@nttlab.ntt.JP> Date: 25 Aug 92 19:14:12 GMT Sender: news@nttlab.ntt.JP Distribution: fj Lines: 29 Approved: news@nttlab.ntt