2 lint questions

[Paul Hudson]

In article <18796 at mimsy.UUCP> chris at mimsy.UUCP (Chris Torek) writes:


   >2)  Is there any way to get lint to detect a closed loop of code which can
   >never be called?

   Lint would need to do call graph analysis to find these; I have never
   seen one that does.
   -- 
   In-Real-Life: Chris Torek, Univ of MD Comp Sci Dept (+1 301 454 7163)
   Domain:	chris at mimsy.umd.edu	Path:	uunet!mimsy!chris

Don't hold your breath - determining whether code is reachable is
equivalent to the halting problem. Lint takes long enough already -
infinite time seems a little over-the-top.
--
Paul Hudson	 MAIL: Monotype ADG, Science Park, Cambridge, CB4 4FQ, UK.
		PHONE: +44 (223) 420018	  EMAIL: paul at moncam.co.uk,
	;"	  FAX: +44 (223) 420911		 ...!ukc!acorn!moncam!paul
 `"";";"        These opinions void where prohibited by law.