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 X-Received: by 10.236.25.175 with SMTP id z35mr2588780yhz.32.1396006297468; Fri, 28 Mar 2014 04:31:37 -0700 (PDT) Path: Xl.tags.giganews.com!border1.nntp.dca3.giganews.com!backlog3.nntp.dca3.giganews.com!border2.nntp.dca.giganews.com!ottix-news.ottix.net!news.litech.org!news.glorb.com!hw13no9447281qab.1!news-out.google.com!bw18ni25986qab.1!nntp.google.com!border1.nntp.dca.giganews.com!nntp.giganews.com!local2.nntp.dca.giganews.com!news.giganews.com.POSTED!not-for-mail NNTP-Posting-Date: Fri, 28 Mar 2014 06:31:36 -0500 Date: Fri, 28 Mar 2014 07:31:36 -0400 From: "Peter C. Chapin" User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:24.0) Gecko/20100101 Thunderbird/24.4.0 MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: Augusta: An open source Ada 2012 compiler (someday?) References: <1f0a85a6-ea4d-4d30-8537-0ce9063f992a@googlegroups.com> <89a0ea84-83e2-4693-b2ea-ea9da65bbc73@googlegroups.com> In-Reply-To: Message-ID: X-Usenet-Provider: http://www.giganews.com X-Trace: sv3-NFFzRHZr1hVKjIqgOf+E6bvBXJ9GQx0M18X3vfK94T+EwSYHk6PVthGAcmysCXp7Vmeg+ddn91JIJkI!/oW84XJa7PU4WDbA0B+HW/mK11kthNe01AJrcj2jd7wtZufJ5P8Dq3Vg+8l/gio= X-Complaints-To: abuse@giganews.com X-DMCA-Notifications: http://www.giganews.com/info/dmca.html X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly X-Postfilter: 1.3.40 X-Original-Bytes: 3488 Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit Xref: number.nntp.dca.giganews.com comp.lang.ada:185395 Date: 2014-03-28T07:31:36-04:00 List-Id: On 03/27/2014 05:51 PM, Niklas Holsti wrote: > More interesting to me would be work towards making Ada compiler > implementation easier. It seems to me that progress in formal methods, > functional and declarative languages, and computer power, since the > 80's, should make it possible... One reason why I choose Scala as an implementation language for Augusta is because I wanted to see if I could productively take advantage of Scala's functional features when writing a serious compiler. As much as I like Ada, I don't think Ada is the most wonderful compiler implementation language imaginable. For example Scala's algebraic data types and pattern matching make processing trees quite enjoyable and compilers tend to use a lot of trees. Also Scala has good support for creating what the community calls "internal domain specific languages." See for example Graph for Scala (http://www.scala-graph.org/), a library for manipulating graphs (perhaps control flow graphs?) in a arguably elegant way. Finally, of course, there might be interesting ways to use higher order functions. I won't know until I try. My intention has also been to use LLVM or something similar (C, the JVM, etc) as a back end to reduce the amount of work involved in actually getting executable code generated. I understand it is still necessary to generate code for whatever target I use, but the targets above are all higher level than machine language and so (I anticipate) easier to manage. Peter