From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=0.7 required=5.0 tests=BAYES_00,INVALID_DATE, MSGID_SHORT,REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!zaphod.mps.ohio-state.edu!magnus.ircc.ohio-state.edu!tut.cis.ohio-state.edu!sei!ajpo!carters From: carters@ajpo.sei.cmu.edu (Scott Carter) Newsgroups: comp.lang.ada Subject: Re: Fortran-to-Ada translator Summary: Yet another FORTRAN-to-Ada translator Message-ID: <758@ajpo.sei.cmu.edu> Date: 20 Feb 91 01:15:43 GMT References: <2736@sparko.gwu.edu> Reply-To: carter%csvax.decnet@mdcgwy.mdc.com Organization: McDonnell Douglas Electronic Systems Company List-Id: re PD FORTRAN-to-Ada translator in Ada SR: I'm not familiar with this particular product, but we have written an F77 to Ada translator which has been reasonably successful on some fairly large programs (mostly simulators and software development tools). We attempt to recast the FORTRAN into normal structured constructs (if humanly possible :} ) and otherwise try to make the output human-readable (e.g. separate packages for each named COMMON, etc.). If the other product does the same thing (correctly, at least 100-eps % of the time), I would expect that that the output would be about as maintainable as most of the Ada I see which seems to have been written by a human [Turing] translator. Again, I can't vouch for the other product but at least there's an existence proof that it's doable. Scott Carter - McDonnell Douglas Electronic Systems Company carter%csvax.decnet@mdcgwy.mdc.com (preferred and faster) - or - carters@ajpo.sei.cmu.edu (714)-896-3097 The opinions expressed herein are solely those of the author, and are not necessarily those of McDonnell Douglas.