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=-1.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Thread: 103376,c3d0e99376a4f379 X-Google-Attributes: gid103376,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit Newsgroups: comp.lang.ada Subject: Re: Interested about number crunching in Ada References: <1187235764.909133.180650@19g2000hsx.googlegroups.com> <46c49e6e$1_6@news.bluewin.ch> <46c54d1a$1_5@news.bluewin.ch> From: development-2006-8ecbb5cc8aREMOVETHIS@ANDTHATm-e-leypold.de (Markus E.L. 2) Date: Sat, 18 Aug 2007 13:40:58 +0200 Message-ID: User-Agent: Some cool user agent (SCUG) Cancel-Lock: sha1:CBBPhIlvPFfVSKvsJjdrtD1hUSM= MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii NNTP-Posting-Host: 88.72.249.21 X-Trace: news.arcor-ip.de 1187436549 88.72.249.21 (18 Aug 2007 13:29:09 +0200) X-Complaints-To: abuse@arcor-ip.de Path: g2news2.google.com!news3.google.com!proxad.net!feeder1-2.proxad.net!213.200.89.82.MISMATCH!tiscali!newsfeed1.ip.tiscali.net!newsfeed00.sul.t-online.de!newsfeed01.sul.t-online.de!t-online.de!newsfeed.arcor-ip.de!news.arcor-ip.de!not-for-mail Xref: g2news2.google.com comp.lang.ada:1482 Date: 2007-08-18T13:40:58+02:00 List-Id: 'anon AT anon DOT org (anon)' wrote: > As for GNAT converting Ada to C. Try looking at a number of papers > of the net on GNAT Ada and also how to write a Frontend compiler for > gnu's gcc c compiler. Also, for a direct proof take a look at the C coded > procedure called 'gigi' in file "trans.c" in GCC-4.x Ada source packages. > The 'gigi" procedure is called from the procedure "Call_Back_End" in > file "Back_End.adb". Gnat uses it converts the C (ada tree) tree and > generates the assembly code and finally the object code. This is the > structure of all GCC type compilers that use GCC as a backend. And > there are a number of papers at GNU on this. Does the expression "intermediate representation" or "intermediate code" convey any meaning to you? >>- F2A is not a Fortran preprocessor for using Ada as the back end; you use it >>once and forget the Fortran code, and continue developing the Ada source. >>At the end, you have one step. Sorry... > > I guess you have never tried to increase a codes performance. To prove > each step you must start with the original code every time. In the F2A > that is, the FORTRAN code. And sometime to increase a codes > performance you may need to alter the FORTRAN code which has some > documentation and then test it, first. Because for functionally > both the FORTRAN and Ada codes must yield the correct results. > Both in performance and output. What ist so difficult about "forget"? Forget as in "throw away" ... - M