Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!usc!rpi!crdgw1!camelback!volpe
From: volpe@camelback.crd.ge.com (Christopher R Volpe)
Newsgroups: comp.lang.c
Subject: Re: Can analysis detect undefined expressions?
Message-ID: <20653@crdgw1.crd.ge.com>
Date: 17 Jun 91 14:10:53 GMT
References: <14206.285B7688@stjhmc.fidonet.org> <6371@goanna.cs.rmit.oz.au>
Sender: news@crdgw1.crd.ge.com
Reply-To: volpe@camelback.crd.ge.com (Christopher R Volpe)
Lines: 18

In article <6371@goanna.cs.rmit.oz.au>, ok@goanna.cs.rmit.oz.au (Richard
A. O'Keefe) writes:
|>Wrong.  Think of the assignments as going into a bag.  By the time you
|>reach a "sequence point" all of the assignments must have been pulled
|>out of the bag and been done, but they can be pulled out of the bag in
|>any order.  So
|>	((i=1) == (i=2))	=>	put <i=2> into bag
|>					put <i=1> into bag
|>	(j = ...)		=>	put <j=0> into bag
                                             ^^^
This is not necessarily true. J could very well be 1 here, if it reads the
value of i twice before comparing them.

                         
==================
Chris Volpe
G.E. Corporate R&D
volpecr@crd.ge.com