Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site brl-tgr.ARPA
Path: utzoo!watmath!clyde!burl!ulysses!allegra!mit-eddie!godot!harvard!seismo!brl-tgr!gwyn
From: gwyn@brl-tgr.ARPA (Doug Gwyn <gwyn>)
Newsgroups: net.lang.c
Subject: Re: Breaking out - the ratfor approach
Message-ID: <5507@brl-tgr.ARPA>
Date: Mon, 29-Oct-84 21:13:42 EST
Article-I.D.: brl-tgr.5507
Posted: Mon Oct 29 21:13:42 1984
Date-Received: Wed, 31-Oct-84 01:18:19 EST
References: <2122@usceast.UUCP> <169@desint.UUCP>
Organization: Ballistic Research Lab
Lines: 7

> So tell me, folks:  do *you* have a global data flow analysis algorithm that
> works in the presence of unrestricted goto's?

I would like to see any global data flow analysis algorithm that would
substantially improving the code generated from my (goto-free) C code.
I doubt very much that there is one.  I like to do my own high-level
algorithmic optimization, thank you.