Re: Structured loops (WAS:Re: Turing programming language.)

Article View: comp.lang.misc

Article #6231

#6231

From: David Phillip Oster
Date: Wed, 25 Jan 1989 05:08

11 lines
859 bytes

When my for loop expressions get too complex in C, I prefer:

	for(;;){
		...arbitrary statement...
		if(exitExpression1){
			break;
		}
		...
	}

Seems like Turing just gives this idiom more prominence.

Technical Details

Message-ID: <27727@ucbvax.BERKELEY.EDU>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!attcan!uunet!lll-winken!lll-lcc!ames!pasteur!ucbvax!dewey.soe.berkeley.edu!oster

References: <11@euteal.UUCP> <89Jan20.111000est.4328@turing.toronto.edu> <12@euteal.UUCP> <7053@june.cs.washington.edu>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!attcan!uunet!lll-winken!lll-lcc!ames!pasteur!ucbvax!dewey.soe.berkeley.edu!oster
From: oster@dewey.soe.berkeley.edu (David Phillip Oster)
Newsgroups: comp.lang.misc
Subject: Re: Structured loops (WAS:Re: Turing programming language.)
Keywords: programming language
Message-ID: <27727@ucbvax.BERKELEY.EDU>
Date: 25 Jan 89 05:08:54 GMT
References: <11@euteal.UUCP> <89Jan20.111000est.4328@turing.toronto.edu> <12@euteal.UUCP> <7053@june.cs.washington.edu>
Sender: usenet@ucbvax.BERKELEY.EDU
Reply-To: oster@dewey.soe.berkeley.edu.UUCP (David Phillip Oster)
Organization: School of Education, UC-Berkeley
Lines: 11

Reply to Parent Message