|Size of graphs in conventional compilers email@example.com (1995-11-07)|
|Re: Size of graphs in conventional compilers firstname.lastname@example.org (1995-11-13)|
|Re: Size of graphs in conventional compilers email@example.com (1995-11-14)|
|Re: Size of graphs in conventional compilers firstname.lastname@example.org (1995-11-20)|
|From:||email@example.com (Mike Ryer)|
|Date:||Tue, 14 Nov 1995 17:39:16 GMT|
Pinku Surana <firstname.lastname@example.org> 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
Return to the
Search the comp.compilers archives again.