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=unavailable autolearn_force=no version=3.4.4 Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!.POSTED!not-for-mail From: Paul Rubin Newsgroups: comp.lang.ada Subject: Re: Why are Ada compilers difficult to write ? Date: Sun, 24 Jun 2018 10:33:17 -0700 Organization: A noiseless patient Spider Message-ID: <87d0wg84yq.fsf@nightsong.com> References: <584564c2-9f64-4965-b045-535cdaf899c0@googlegroups.com> <871sd2bggh.fsf@nightsong.com> Mime-Version: 1.0 Content-Type: text/plain Injection-Info: reader02.eternal-september.org; posting-host="927ee4fe04006161b0357297dabda013"; logging-data="28001"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18bUhsJ+ojJZByGqk0la0YN" User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/25.3 (gnu/linux) Cancel-Lock: sha1:MhcPsCMORW0gU1LeQ6pruAjUD3g= sha1:ap4NIbcvgyVreY3BrMP5QFqcGFM= Xref: reader02.eternal-september.org comp.lang.ada:53279 Date: 2018-06-24T10:33:17-07:00 List-Id: Lucretia writes: >> Ada might be harder to compile than C or Pascal, but not by *that* much > You are living in a dream world [if] you think that. You are right, looking into this a little further, the amount of stuff in Ada is enormous compared to C or Pascal, much larger than Ada Distilled makes it sound. It's not possible to write a minimalistic Ada compiler comparable in size to some of the small C or Pascal compilers that have been written. Compared to an industrial-strength C compiler though, it's still not that big an increment: i.e. GNAT was not that large an addition to GCC. It's also not clear to me that Ada has actual difficult-to-compile features (maybe it does, and I just haven't spotted them) as opposed to a very large number of straightforward ones. By comparison, lots of the stuff in GHC resulted from academic research projects that represented new advances in the state of PLT knowledge.