Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83 (MC840302); site zuring.UUCP
Path: utzoo!linus!decvax!ucbvax!ucdavis!lll-crg!seismo!mcvax!zuring!dik
From: dik@zuring.UUCP
Newsgroups: net.lang
Subject: Re: Recursion
Message-ID: <241@zuring.UUCP>
Date: Fri, 13-Sep-85 00:26:34 EDT
Article-I.D.: zuring.241
Posted: Fri Sep 13 00:26:34 1985
Date-Received: Sun, 15-Sep-85 05:30:03 EDT
References: <712@gitpyr.UUCP> <250@mot.UUCP>
Reply-To: dik@zuring.UUCP (Dik T. Winter)
Organization: CWI, Amsterdam
Lines: 14
Apparently-To: rnews@mcvax.LOCAL

In article <250@mot.UUCP> al@mot.UUCP (Al Filipski) writes:
(about A calling B calling A, and how to detect this)...
>	You just set up an n-by-n Boolean matrix
>where n is the number of subroutines under consideration and the
>ij element is 1 iff routine i calls routine j.  Then take the
>transitive closure by Warshall's algorithm.  1's on the diagonal of
>the result indicate which routines are indirectly recursive.

No, the 1's indicate the routines that *might* be recursive, they
need not be.  (What in the situation that if A calls B, B will never
call A, vv.)
-- 
dik t. winter, cwi, amsterdam, nederland
UUCP: {seismo|decvax|philabs}!mcvax!dik


Brought to you by Super Global Mega Corp .com