Re: Does a C89 compliant compiler exist?

From: Walter Roberson (roberson_at_ibd.nrc-cnrc.gc.ca)
Date: 03/16/05


Date: 16 Mar 2005 04:43:40 GMT

In article <pnbf319hct3tt5f4elt7e4mgtmgljgdjls@4ax.com>,
Jack Klein <jackklein@spamcop.net> wrote:
:On the other hand, I
:imaging that proving a compiler is perfectly strictly conforming is a
:Turing problem.

In theory it isn't an instance of the Halting Problem --
the Halting Problem has to do with the analysis of arbitrary
programs of arbitrary size. Turing's theorem is not that you
cannot prove the haltability of fixed individual programs, but
rather that there is no program which can be applied to
analyze -every- program.

But it would probably be difficult anyhow.

-- 
   Oh, to be a Blobel!


Relevant Pages

  • Re: Getting source file from the object file
    ... solving the halting problem. ... is the output of a particular compiler whose output is a deterministic ... finite time, some source file which when compiled by that compiler ... You don't *need* to enumerate them all, ...
    (comp.lang.c)
  • Re: What is the Result from Invoking this Halt Function?
    ... MC> of a program Q "for which no compiler can be constructed ... PRD> property P for an arbitrary program Q ... (comp.object re:static analysis and the halting problem 6-17-02) ... and learn from your mistakes. ...
    (comp.theory)
  • Re: What is the Result from Invoking this Halt Function?
    ... MC> of a program Q "for which no compiler can be constructed ... PRD> property P for an arbitrary program Q ... (comp.object re:static analysis and the halting problem 6-17-02) ... and learn from your mistakes. ...
    (sci.logic)
  • Re: Certified C compilers for safety-critical embedded systems
    ... but the mistake required all valid Ada 80 compilers to solve the ... Often failure of the compiler to determine that there is a consistent ... elaboration order means that there is no valid elaboration order. ... requires solving the halting problem. ...
    (comp.lang.ada)
  • Re: Can the Turing Problem be deflated?
    ... is self-evident. ... IF Turing wants to address a particular problem, THEN it may be the case that the way he tackles it through the 'halting problem' doesn't actually address it. ... So "The Turing Problem MAY be a problem", but IF it is a problem, THEN the problem is not addressed in the form in which it is cast in the halting problem. ... There are grades of nonsense, but I can't find that paper, and its bed-time. ...
    (sci.logic)