Author: Robert Hyatt
Date: 09:12:31 12/23/02
Go up one level in this thread
On December 23, 2002 at 09:28:30, Vincent Diepeveen wrote: >On December 21, 2002 at 22:54:05, Eugene Nalimov wrote: > >>Wrong. >> >>In all compiler textbooks number of passes means "how much times compiler goes >>through the program code" regardless of the program's representation -- be it >>source or some intermediate form (quads, tuples, triades, ASTs, etc.). >> >>Thanks, >>Eugene > >That's a different form of passes which have more to do with the difficulty >of optimizing high level languages. > >Note i just quoted a statement from some researchers in the field >of compiler optimizations. > >Of course that was from a few years ago. Let's be clear there. My knowledge >is of course very limited with regards to todays compilers, like Bob's >algorithmic computerchess knowledge is too. If my chess algorithm knowledge was as limited as your compiler knowledge, I could not even develop a legal move generator. > >>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 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.