Size of graphs in conventional compilers

pinkus@comm.mot.com (Pinku Surana)
Tue, 7 Nov 1995 22:53:46 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: pinkus@comm.mot.com (Pinku Surana)
Keywords: question, analysis, optimize
Organization: Motorola LMPS Software Technology Center
Date: Tue, 7 Nov 1995 22:53:46 GMT

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?


Thanks,
Pinku Surana




--
Pinku Surana Software Technology Center
pinkus@comm.mot.com Motorola, Inc


--

Post a followup to this message

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