Author: Sally Weltrop
Date: 19:53:35 12/28/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. o boy, fighting words,heehee
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.