All of this is really fascinating (and no, I'm not being facetious): A bunch of apparently knowledgeable PL/1 programmers cannot agree on a point that would seem to have a single indisputable answer. Rather than keep on saying "yes it is" / "no it isn't", couldn't one or two of you from both sides run a program demonstrating your claim? It would probably be necessary to define the compiler you're running, too.
--- Bob Bridges, [email protected], cell 336 382-7313 /* Oh good. Now he'll be bi-ignorant. -Texas Agriculture Commissioner Jim Hightower when told that Texas Governor Bill Clements had been studying Spanish */ ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to [email protected] with the message: INFO IBM-MAIN
