Author: Dave Gomboc
Date: 23:02:20 12/21/02
Go up one level in this thread
On December 21, 2002 at 21:20:26, Vincent Diepeveen wrote: >On December 21, 2002 at 17:45:43, Matt Taylor wrote: > >>On December 21, 2002 at 17:29:11, Vincent Diepeveen wrote: >> >>>On December 21, 2002 at 14:32:18, Matt Taylor wrote: >>> >>>checkout the compiler faq at : >>> >>>http://www.cs.strath.ac.uk/~hl/classes/52.358/FAQ/passes.html >>> >>>[off topic nonsense removed] >> >>Ok, the FAQ explains to me principles which were self-evident. When you read the >>FAQ, you realize that an optimizing single-pass C compiler is not possible. >> >>"Optimization: Only really possible with a multi-pass compiler" >> >>It also reaffirms what I'd already stated -- multi-pass compilers are EASIER to >>write because the code is more modular and has less coupling. Just about the >>only data structure that you're going to rely on to go between stages is the >>AST, and that's not that difficult. >> >>This is quite familiar for me as I've been working on a compiler implementation >>for a C-like language. (Actually it's more like C++, but it lacks multiple >>inheritance and templates.) >> >>-Matt > >If you have 'so much' experience with compilers, whereas i consider myself >a layman; i just wrote a few very very primitif compilers (and no assembly >output of them even); i wonder why you do not know what 'single pass >compiler' means. It has to do with how many times a compiler reads >the source code. Not so much how many high level optimizations >you apply to it. > >So now you learned again something. > >Best regards, >Vincent. This isn't correct. It's how many passes are made through the code in any form, not just source form. Dave
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.