Article View: comp.lang.modula2
Article #1198Re: Bitwise EXOR
From: Preston Briggs
Date: Mon, 01 Oct 1990 15:50
Date: Mon, 01 Oct 1990 15:50
16 lines
817 bytes
817 bytes
In article <3356@mindlink.UUCP> a665@mindlink.UUCP (Anthon Pang) writes: >Herman.Stevens@p21701.f601.n292.z2.fidonet.org writes: >> I am a beginner with Modula-II. I work on an Amiga with the M2Amiga >> compiler. I fail to see how I can do a bitwise EXOR, something you >For booleans: > > x := ( a OR b) AND (NOT (a AND b)); Or more simply, x := a # b; -- Preston Briggs looking for the great leap forward preston@titan.rice.edu
Technical Details
Message-ID:
<1990Oct1.155021.24635@rice.edu>Path:
arc1-ca.pugleaf.net!utzoo!attcan!uunet!wuarchive!rice!titan.rice.edu!prestonReferences:
<3356@mindlink.UUCP>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!wuarchive!rice!titan.rice.edu!preston From: preston@titan.rice.edu (Preston Briggs) Newsgroups: comp.lang.modula2 Subject: Re: Bitwise EXOR Message-ID: <1990Oct1.155021.24635@rice.edu> Date: 1 Oct 90 15:50:21 GMT References: <3356@mindlink.UUCP> Sender: news@rice.edu (News) Organization: Rice University, Houston Lines: 16