Xref: utzoo alt.sources.wanted:1098 comp.sources.wanted:15880 comp.software-eng:5128 Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!think.com!snorkelwacker.mit.edu!bloom-beacon!eru!hagbard!sunic!mcsun!inesc!unl!unl!jpc From: jpc@fct.unl.pt (Jose Pina Coelho) Newsgroups: alt.sources.wanted,comp.sources.wanted,comp.software-eng Subject: Re: WANTED: "C" code line counter program Message-ID: Date: 21 Mar 91 10:45:38 GMT References: <1991Mar6.214157.18633@ntpal.uucp> <1991Mar20.114450.19653@rhrk.uni-kl.de> Sender: news@fct.unl.pt (USENET News System) Organization: Universidade Nova de Lisboa -- Lisbon, Portugal Lines: 45 In-Reply-To: hammes@dill.informatik.uni-kl.de's message of 20 Mar 91 11:44:50 GMT In article <1991Mar20.114450.19653@rhrk.uni-kl.de> hammes@dill.informatik.uni-kl.de (Stefan Hammes (HiWi Mattern)) writes: In article , jpc@fct.unl.pt (Jose Pina Coelho) writes: |> |>In article <1991Mar14.192419.1576@comm.wang.com> lws@comm.wang.com (Lyle Seaman) writes: |> |> |>[... How to fool char counters ...] |> |>Why not compile the sources and checking the size of object code ? Because this is very machine, compiler and linker dependent! It's probably the best [better fiability/work ratio ] bet, you can compare by compiling all programs on the same architecture with the same compiler. Another bet [machine, compiler and linker independent]: Get a C grammar and count tokens. On the other hand, you need a method that is programer-independent because: - Programer A came from Fortran, he isn't used to: - ``Creative'' for's :-) . - Recursivity. - Programer B came from C B is going to produce the same funcionality with a lower ammount of code. -- Jose Pedro T. Pina Coelho | BITNET/Internet: jpc@fct.unl.pt Rua Jau N 1, 2 Dto | UUCP: ...!mcsun!unl!jpc 1300 Lisboa, PORTUGAL | Home phone: (+351) (1) 640767 - If all men were brothers, would you let one marry your sister ?