Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site ritcv.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!mit-eddie!genrad!decvax!decwrl!pyramid!ut-sally!seismo!rochester!ritcv!abh6509
From: abh6509@ritcv.UUCP (A. hudson)
Newsgroups: net.lang
Subject: Re: Comments on this program please...
Message-ID: <9112@ritcv.UUCP>
Date: Wed, 4-Dec-85 14:14:16 EST
Article-I.D.: ritcv.9112
Posted: Wed Dec  4 14:14:16 1985
Date-Received: Sat, 7-Dec-85 03:14:07 EST
References: <2389@ukma.UUCP>
Reply-To: abh6509@ritcv.UUCP (Andrew)
Organization: Rochester Institute of Technology, Rochester, NY
Lines: 12

That program looks like it should first be modelled with a finite
state diagram. A few theoretical considerations will quickly show
if you are testing for impossible conditions or have redundant
code. Or if a group of IF's are clumsily arranged, always testing
true and therefore unnecesary. 

If that BITNET routine function exhibited none of those maladies
then your cryptic style is functionally justified. Providing
no one has to understand it or modify it later on.


				Andrew Hudson