Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!purdue!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: <11111@smoke.BRL.MIL>
Date: 19 Sep 89 21:13:21 GMT
References: <1989Sep8.230612.6629@algor2.algorists.com> <12570026@hpclwjm.HP.COM>
Reply-To: gwyn@brl.arpa (Doug Gwyn)
Organization: Ballistic Research Lab (BRL), APG, MD.
Lines: 10

In article <12570026@hpclwjm.HP.COM> walter@hpclwjm.HP.COM (Walter Murray) writes:
-A relevant passage might be this from Section 1.2, which is hard for me to
-reconcile with the requirement in 1.7 ...
-One could argue from this that, as long as it can translate one
-particular program as described by 2.2.4.1, a conforming implementation
-is free to reject any other program as being too "complex".

I agree that it's hard to reconcile 1.2 with 1.7.  I think 1.7 makes
too definite a statement and that 1.2 and 2.2.4.1 more properly
indicate what was intended.