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!.POSTED!not-for-mail From: Simon Wright Newsgroups: comp.lang.ada Subject: Re: Ada to Ada Translator ? Date: Sun, 19 May 2019 22:27:06 +0100 Organization: A noiseless patient Spider Message-ID: References: <100ad407-090e-4316-9746-a4469568b53e@googlegroups.com> <477352cf-80d0-458c-b64a-4605557fef8f@googlegroups.com> <36cf3be3-0ab0-48d4-bffa-e49c624e73ff@googlegroups.com> Mime-Version: 1.0 Content-Type: text/plain Injection-Info: reader02.eternal-september.org; posting-host="1f918a0f3e6fafea4b90e16c0c51c197"; logging-data="27417"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/B+RkV2WMc2FH6/6APRFYjO0xOEfacHhY=" User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/26.1 (darwin) Cancel-Lock: sha1:lA7LAx1726cMiLmTMDNqNC4wu70= sha1:zOutDXzjMiis09salxv57wi0iW0= Xref: reader01.eternal-september.org comp.lang.ada:56340 Date: 2019-05-19T22:27:06+01:00 List-Id: Optikos writes: > The vastly more germane dicey question legally is whether Patrick's > proposed generated Ada-to-Ada source code qualifies as Target Code > (and thus gets to enjoy the Runtime Library Exception's generous > nonGPL-license permissions for Target Code emitted from an Eligible > Compilation Process) or whether it would be deemed the onerous > intermediate representation that then decisively revokes the > permissions of the Runtime Library Exception for any programmer using > the ineligible Compilation Process. Seems to me (but of course IANAL) that 'The "Compilation Process" transforms code entirely represented in non-intermediate languages designed for human-written code, and/or in Java Virtual Machine byte code, into Target Code. Thus, for example, use of source code generators and preprocessors need not be considered part of the Compilation Process, since the Compilation Process can be understood as starting with the output of the generators or preprocessors.' covers Patrick's scheme.