Article View: comp.std.c
Article #568Re: Do non-trivial strictly conforming programs exist?
From: Walter Murray
Date: Mon, 11 Sep 1989 03:08
Date: Mon, 11 Sep 1989 03:08
21 lines
1307 bytes
1307 bytes
Doug Gwyn writes: > The alternative would be to require acceptance of every strictly > conforming program that did not exceed any of the limits. But doesn't the dpANS do just that, in Section 1.7? "A conforming hosted implementation shall accept any strictly conforming program." With reference to the example in the basenote, a program can be strictly conforming even though it contains TWO macro definitions with 31 parameters in each, can't it? As I interpret Section 2.2.4.1, the provider of a supposedly conforming implementation has to be able to produce a program that will be accepted by the implementation and that contains at least one instance of each of the translation limits. But that doesn't excuse the implementation from accepting a program which contains more than one such instance, does it? Walter Murray --
Technical Details
Message-ID:
<12570025@hpclwjm.HP.COM>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!usc!apple!motcsd!hpda!hpcuhb!hpcllla!hpclisp!hpclwjm!walterReferences:
<1989Sep8.230612.6629@algor2.algorists.com>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!usc!apple!motcsd!hpda!hpcuhb!hpcllla!hpclisp!hpclwjm!walter From: walter@hpclwjm.HP.COM (Walter Murray) Newsgroups: comp.std.c Subject: Re: Do non-trivial strictly conforming programs exist? Message-ID: <12570025@hpclwjm.HP.COM> Date: 11 Sep 89 03:08:39 GMT References: <1989Sep8.230612.6629@algor2.algorists.com> Organization: Hewlett-Packard Calif. Language Lab Lines: 21