Re: Size of graphs in conventional compilers

ryer@harp.camb.inmet.com (Mike Ryer)
Tue, 14 Nov 1995 17:39:16 GMT

          From comp.compilers
Related articles
Size of graphs in conventional compilers pinkus@comm.mot.com (1995-11-07)
Re: Size of graphs in conventional compilers havlak@cs.umd.edu (1995-11-13)
Re: Size of graphs in conventional compilers ryer@harp.camb.inmet.com (1995-11-14)
Re: Size of graphs in conventional compilers cliffc@ami.sps.mot.com (1995-11-20)
| List of all articles for this month |
Newsgroups: comp.compilers
From: ryer@harp.camb.inmet.com (Mike Ryer)
Summary: They're huge
Keywords: analysis, performance
Organization: Intermetrics, Inc.
References: 95-11-068
Date: Tue, 14 Nov 1995 17:39:16 GMT

Pinku Surana <pinkus@comm.mot.com> wrote:
>What is, approximately, the size of the flow graphs created by
>compilers with respect to the parse tree, or to the size of the input
>program? Does the time taken to create the graphs dominate most uses
>of the graph?


500 to 1000 bytes per source line of code is common for full-up graph
representations of programs. It could be less, but once you have a
graph, everyone wants to hang their favorite data off it.


Creating and hauling the graphs around is likely to account for the
majority of time in the compiler.


These comments are based on experience with several generations of
Ada and C compilers. (Newer compilers are *less* graph oriented).
Your milage will vary.


-- Mike Ryer
Intermetrics, Inc.
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.