Xref: utzoo alt.sources.wanted:1087 comp.sources.wanted:15851 comp.software-eng:5117 Path: utzoo!utgpu!cs.utexas.edu!swrinde!elroy.jpl.nasa.gov!usc!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!ira.uka.de!sun.rhrk.uni-kl.de!dill.informatik.uni-kl.de!hammes From: hammes@dill.informatik.uni-kl.de (Stefan Hammes (HiWi Mattern)) Newsgroups: alt.sources.wanted,comp.sources.wanted,comp.software-eng Subject: Re: WANTED: "C" code line counter program Message-ID: <1991Mar20.114450.19653@rhrk.uni-kl.de> Date: 20 Mar 91 11:44:50 GMT References: <1991Mar6.214157.18633@ntpal.uucp> Sender: news@rhrk.uni-kl.de Reply-To: hammes@informatik.uni-kl.de (Stefan Hammes) Organization: University of Kaiserslautern, Federal Republic of Germany Lines: 32 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: |> |> bhoughto@pima.intel.com (Blair P. Houghton) writes: |> |> >In article <1991Mar11.182848.26693@comm.wang.com> lws@comm.wang.com (Lyle Seaman) writes: |> >>Counting semi-colons is a pretty good approach, as that counts C |> >>statements. Lines is kind of less meaningful. Counting '{' is |> >>an interesting one, too. |> |> >{{{{{{{{printf("Oh, if I were a rich man... ;;;;;;;;;;;;;;;;;;;;;;;\n");}}}}}}}} |> |>[... 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! Stefan +---------------------------------------+-------------------------------------+ | Stefan Hammes | e-Mail: hammes@informatik.uni-kl.de | | FB Informatik, SFB 124-D1 +-------------------------------------+ | Universitaet Kaiserslautern, P.O.Box 3049, D-W6750 Kaiserslautern, Germany | +-------------+------------------------------------------------+--------------+ | Language definition: Recursion - see recursion | +------------------------------------------------+