Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!uwm.edu!gem.mps.ohio-state.edu!ginosko!xanth!mcnc!rti!sunpix!keith
From: keith@sunpix.UUCP ( Sun Visualization Products)
Newsgroups: comp.lang.c
Subject: Re: ambiguous ?
Summary: Ada supports both kinds of boolean operators
Keywords: boolean, ambiguous, Ada
Message-ID: <950@jetcomp.UUCP>
Date: 24 Oct 89 17:51:48 GMT
References: <1989Oct21.071319.8839@utzoo.uucp> <14106@lanl.gov>
Reply-To: keith@jetcomp.UUCP (Keith Harp - Sun Visualization Products)
Distribution: na
Organization: Sun Microsystems, RTP, NC
Lines: 12

In article <14106@lanl.gov> jlg@lanl.gov (Jim Giles) writes:
# <boolean operators should or shouldn't force evaluation order deleted>
#I have no particular opinion on this issue except
#that I am not satisfied with the loss optimization, but I wouldn't be
#satisfied without a way to force order either - can't have both (or
#can you?  I know of an experimental language with both).

Ada supports AND and OR for non short-circuit, and AND THEN and OR ELSE
for short-circuit.

Personally, I find supporting both the best, but if a language is
only going to support one, I prefer the short-circuit version.