Pointers wanted: analysis of compiler complexity

Hi all,


I'm seeking references on analysis of the complexity of the
compilation process for C-like languages. I don't mean optimization
of the resulting code, but rather, the number of instructions/memory
cells required to perform the compilation itself, and the way these
functions grow with source code size and complexity.


I'm also interested in such analyses for macro assemblers, as well as
any war stories about implementing compilers for sophisticated
languages on very slow/small/low-power devices. (I'm working on a JIT
download- and-compile audio processing language for inclusion in the
MPEG-4 standard. I want to know what kind of hardware is reasonable
to imagine a JIT compiler being effective on.)


The more hard numbers, the better, but pointers to theoretical
treatments would also be welcome.


Thanks in advance.


  -- Eric
--
+-------------------+
| Eric Scheirer | A-7b5 D7b9 | G-7 C7 | Cb C-7b5 F7#9 |Bb | B-7 E7 |
| eds@media.mit.edu | < http://sound.media.mit.edu/~eds >
| 617 253 0112 | A A/G# F#-7 F#-/E | Eb-7b5 D7b5 | Db | C7b5 B7b5 | Bb |
--

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