On 2013-10-23, at 07:35, robin wrote:
> From: "John Gilmore" <[email protected]>
> Sent: Wednesday, October 23, 2013 10:02 PM
>
>
>> Interestingly, when I take your C example,
>>
>> if ( j < k ) m = -1;
>> else if (j > k) m = 1;
>> else m = 0;
>> return m;
>>
>> and rewrite it trivially modified in PL/I as
>>
>> if j < k then m = -1;
>> else if j > k then m = 1;
>> else m = 0;
>> return (m);
>>
>> I cannot reproduce your results.
>
> What does it produce (under highest optimisation) ?
What are the representations of boolean values in PL/I?
In Rexx, this could be written with no (explicit) branches
as:
m = ( j > k ) - ( j < k );
-- gil
