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,FREEMAIL_FROM autolearn=ham autolearn_force=no version=3.4.4 X-Google-Thread: 103376,91d0d8cd28bbb477 X-Google-Attributes: gid103376,public X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!postnews.google.com!q75g2000hsh.googlegroups.com!not-for-mail From: Lucretia Newsgroups: comp.lang.ada Subject: Re: Implementing an Ada compiler and libraries. Date: 9 May 2007 20:38:27 -0700 Organization: http://groups.google.com Message-ID: <1178768307.012381.140530@q75g2000hsh.googlegroups.com> References: <1178721451.073700.10730@y80g2000hsf.googlegroups.com> NNTP-Posting-Host: 62.56.81.180 Mime-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" X-Trace: posting.google.com 1178768307 2576 127.0.0.1 (10 May 2007 03:38:27 GMT) X-Complaints-To: groups-abuse@google.com NNTP-Posting-Date: Thu, 10 May 2007 03:38:27 +0000 (UTC) In-Reply-To: User-Agent: G2/1.0 X-HTTP-UserAgent: Opera/9.10 (X11; Linux i686; U; en),gzip(gfe),gzip(gfe) Complaints-To: groups-abuse@google.com Injection-Info: q75g2000hsh.googlegroups.com; posting-host=62.56.81.180; posting-account=G-J9fgwAAADgpzBiEyy5tO4f8MX5fbpw Xref: g2news1.google.com comp.lang.ada:15700 Date: 2007-05-09T20:38:27-07:00 List-Id: On May 9, 9:48 pm, Robert A Duff wrote: > Presumably by storing information (symbol tables and whatnot) in > permanent disk files. If you do that, I think you should design it as a > _pure_ optimization. That is, the system should behave exactly as if > everything is compiled from source every time, except that it's faster. > Don't mimic the Ada 83 compilers that had a notion of "compiling things > into the library", where a source file sitting right there in the source > directory is ignored, unless "compiled into...". Yes, I have no intention of having to add stuff to the library before it can compile. I'm looking at a hybrid of what GNAT does combined with the ability to use precompiled units in binary form. > If you do this, you need to design a permanent (on disk) representation > that is small. I think it's possible, but it's not easy -- the > "obvious" representation of symbol tables will be 10 times larger than > the source code. If it's 10 times larger, then it defeats the purpose > -- reading it in from disk will be slower than re-analyzing the original > source code. > > You also suggested storing the info in the object files. Yes, that is > possible, given a reasonable object file format that allows arbitrary > information to be stored, in addition to the actual machine code. DWARF? > Building a complete Ada implementation is a daunting task (many > person-years). You said you're doing a subset of Ada 2005, and I assume > you're doing this "just for fun". Keep your subset small, or you will > never finish. Nope, just a subset. Luke.