Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sun-barr!olivea!spool.mu.edu!caen!zaphod.mps.ohio-state.edu!cis.ohio-state.edu!ucbvax!BRFAPESP.BITNET!UNBCIC From: UNBCIC@BRFAPESP.BITNET Newsgroups: comp.lang.modula2 Subject: RE: Make the language Perfect/SOS Message-ID: Date: 27 Jun 91 18:07:00 GMT Sender: daemon@ucbvax.BERKELEY.EDU Reply-To: Modula2 List Organization: The Internet Lines: 26 => Sorry, but I think this argument is rather nonsensical. When talking => about overhead (i.e. complexity or runtime cost), "compiler" is any- => thing you have to run to obtain the object file (or whatever you have => instead) from your source. It doesn't matter if this is separated into => several programs, or if one of them is called preprocessor. A preprocessor NEVER adds runtime overhead. It is a COMPILEtime overhead. => The problem with this approach to precedence is that it requires a => global (i.e. across modules) knowledge of all operators that may be => used together at some later time somewhere - probably in ways the => original author never dreamed of. That's my most serious concern I don't think that's true because the proposed scheme *IS* used in Prolog with success. => Marc Wachowitz => X903@DMAFHT1.BITNET (8-DCS) Daniel C. Sobral Errare Humanum Est... UNBCIC@BRFAPESP.BITNET ...Perseverare Autem Diabolicum UNBCIC@FPSP.FAPESP.ANSP.BR -------------------------------------------------------------------------- No one, but me, is responsible for the above message.