Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!dali.cs.montana.edu!caen!zaphod.mps.ohio-state.edu!mips!dimacs.rutgers.edu!aramis.rutgers.edu!paul.rutgers.edu!njin!princeton!phoenix!egnilges From: egnilges@phoenix.Princeton.EDU (Ed Nilges) Newsgroups: comp.lang.c Subject: Re: to "OR" or not to "OR" Message-ID: <10276@idunno.Princeton.EDU> Date: 31 May 91 15:45:04 GMT References: <1991May28.210421.9656@unlv.edu> <8492@jhunix.HCF.JHU.EDU> Sender: news@idunno.Princeton.EDU Organization: Princeton University Lines: 26 In article worley@compass.com (Dale Worley) writes: >Various posters say: > > >) I'm tired of Demorgan's law (a | b= !(a & b)) isnt there a way to get around > Boy, that's one for the books. Yeah, I'm sick of the law of excluded middle, Planck's constant, the speed of light, the law of comparative advantage, and Heisenberg's uncertainty principle. Dale, was this for real? First this jerk announces that he's tired of DeMorgan's law and then gets it wrong. I'm tired of working with people like him (and trying to teach C to students who cannot program in Cobol.) Whatthehell, who cares, ah gots mah 486 and ah'll invade Iraq when the going gets tough. > btw, isn't demorgan's law a|b = !(!a & !b)? > >In this case, it's: a|b == ~(~a & ~b) and a||b == !(!a && !b). >Remember that |, &, and ~ are bitwise operators, while ||, &&, and ! >are logical operators. Thank you very much, there's hope for mankind, you know what you're talking about. > >Dale Worley Compass, Inc. worley@compass.com >-- >I don't have to take this abuse from you -- I've got hundreds of >people waiting to abuse me. -- Bill Murray, "Ghostbusters"