Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!uwm.edu!uakari.primate.wisc.edu!aplcen!haven!adm!smoke!gwyn
From: gwyn@smoke.BRL.MIL (Doug Gwyn)
Newsgroups: comp.std.c
Subject: Re: Do non-trivial strictly conforming programs exist?
Message-ID: <11037@smoke.BRL.MIL>
Date: 12 Sep 89 10:36:34 GMT
References: <1989Sep8.230612.6629@algor2.algorists.com> <12570025@hpclwjm.HP.COM>
Reply-To: gwyn@brl.arpa (Doug Gwyn)
Organization: Ballistic Research Lab (BRL), APG, MD.
Lines: 17

In article <12570025@hpclwjm.HP.COM> walter@hpclwjm.HP.COM (Walter Murray) writes:
>But doesn't the dpANS do just that, in Section 1.7?  "A conforming
>hosted implementation shall accept any strictly conforming program."
>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?

Hmm, this is trickier than I thought.  The only way that the first
sentence of 2.2.4.1 seems to make sense, in view of what you cited
from 1.7, would be that ALL strictly conforming programs must be
ACCEPTED, but only ONE particular program is required to be TRANSLATED
and EXECUTED.  I'd been thinking that "acceptance" by a language
translator somehow implied translation and executability or the result,
but no I wonder what IS meant.  Dave, help!!