Path: utzoo!attcan!uunet!mcvax!hp4nl!ruuinf!piet
From: piet@ruuinf (Piet van Oostrum)
Newsgroups: comp.lang.misc
Subject: Re: Structured loops (WAS:Re: Turing programming language.)
Keywords: programming language
Message-ID: <1081@ruuinf.UUCP>
Date: 27 Jan 89 15:17:16 GMT
References: <11@euteal.UUCP> <89Jan20.111000est.4328@turing.toronto.edu> <12@euteal.UUCP> <7053@june.cs.washington.edu> <9045@burdvax.PRC.Unisys.COM>
Sender: piet@ruuinf.UUCP
Reply-To: piet@ruuinf (Piet van Oostrum)
Organization: Dept of Computer Science, University of Utrecht, Holland
Lines: 12
In-reply-to: dave@emerald.PRC.Unisys.COM (David Lee Matuszek)

In article <9045@burdvax.PRC.Unisys.COM>, dave@emerald (David Lee Matuszek) writes:
 `
 `This is the same as the loop ... exit when <boolean> ... end loop;
 `except that the sense of the test is reversed.  This exists in Turing.
 `It also exists in an in-house language I designed and implemented a couple
 `of years ago.  I don't know of any other languages that use it, however.
 `
Modula-2, Modula-3 and Ada have LOOP ... EXIT ... END (LOOP) constructions
-- 
Piet van Oostrum, Dept of Computer Science, University of Utrecht
Padualaan 14, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands
Telephone: +31-30-531806. piet@cs.ruu.nl (mcvax!hp4nl!ruuinf!piet)