<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
   <channel>
      <title>Comp.compilers newsgroup</title>
      <link>http://compilers.iecc.com/</link>
      <description>The oldest and most popular online compilers forum.</description>
      <language>en-us</language>
      <generator>Compilers RSS kludge 0.1</generator>
      <managingEditor>compilers-request@iecc.com</managingEditor>
      <webMaster>webmaster@iecc.com</webMaster>
      <item>
         <title>Re: Archaic hardware (was Fortran calls)</title>
	 <pubDate>Thu, 10 May 2012 16:38:25 +0000 (UTC)</pubDate>
	 <author>"robin" &lt;robin51@dodo.com.au&gt;</author>
	 <link>http://compilers.iecc.com/comparch/article/12-05-009</link>
	 <guid isPermaLink="true">http://compilers.iecc.com/comparch/article/12-05-009</guid>
	 <description>From: "glen herrmannsfeldt" &lt;gah@ugcs.caltech.edu&gt;
Sent: Sunday, 6 May 2012 3:13 PM

&gt; I remembered the PDP-8 using the "store the return address in the
&gt; first word" method, but, yes, there was an earlier PDP-10 compiler.
&gt; The one I used was, I believe, called Fortran-10 and the older one
</description>
      </item>
      <item>
         <title>Seed7 Release 2012-05-06</title>
	 <pubDate>Sun, 6 May 2012 17:24:45 +0000 (UTC)</pubDate>
	 <author>thomas.mertes@gmx.at</author>
	 <link>http://compilers.iecc.com/comparch/article/12-05-008</link>
	 <guid isPermaLink="true">http://compilers.iecc.com/comparch/article/12-05-008</guid>
	 <description>Hello,

I have released a new version of Seed7: seed7_05_20120506.tgz
In the Seed7 programming language new statements and operators
can be declared easily. Types are first class objects and therefore
templates/generics need no special syntax. Object orientation is
</description>
      </item>
      <item>
         <title>Compiler positions available for week ending May 6</title>
	 <pubDate>Sun, 6 May 2012 17:24:23 +0000 (UTC)</pubDate>
	 <author>"comp.compilers" &lt;compilers@iecc.com&gt;</author>
	 <link>http://compilers.iecc.com/comparch/article/12-05-007</link>
	 <guid isPermaLink="true">http://compilers.iecc.com/comparch/article/12-05-007</guid>
	 <description>This is a digest of ``help wanted'' and ``position available'' messages
received at comp.compilers during the preceding week.  Messages must
advertise a position having something to do with compilers and must also
conform to the guidelines periodically posted in misc.jobs.offered.
</description>
      </item>
      <item>
         <title>Re: Fortran calls, was PL/I code</title>
	 <pubDate>Sun, 6 May 2012 17:23:52 +0000 (UTC)</pubDate>
	 <author>glen herrmannsfeldt &lt;gah@ugcs.caltech.edu&gt;</author>
	 <link>http://compilers.iecc.com/comparch/article/12-05-006</link>
	 <guid isPermaLink="true">http://compilers.iecc.com/comparch/article/12-05-006</guid>
	 <description>(snip, I wrote)
&gt; For the PDP-10/TOPS-10 Fortran, return addresses went on the stack,
&gt; but local variables were still static, as usual for Fortran IV.

&gt; [That must be the new PDP-10 compiler.  The old compiler, which looked
&gt; a whole lot like OS/360 Fortran G, used JSA/JRA for subroutine calls,
</description>
      </item>
      <item>
         <title>Re: PL/I code</title>
	 <pubDate>Sun, 6 May 2012 03:43:02 +0000 (UTC)</pubDate>
	 <author>glen herrmannsfeldt &lt;gah@ugcs.caltech.edu&gt;</author>
	 <link>http://compilers.iecc.com/comparch/article/12-05-005</link>
	 <guid isPermaLink="true">http://compilers.iecc.com/comparch/article/12-05-005</guid>
	 <description>robin &lt;robin51@dodo.com.au&gt; wrote:

(snip)
&gt;&gt; There is, at least, more overhead in the procedure entry/exit
&gt;&gt; sequence for recursive routines.

&gt; More overhead, maybe, but how much more?  Registers usually have to be
&gt; saved, a return address has to be preserved somewhere.  When the
</description>
      </item>
      <item>
         <title>Re: PL/I code</title>
	 <pubDate>Sat, 5 May 2012 04:58:15 +0000 (UTC)</pubDate>
	 <author>"robin" &lt;robin51@dodo.com.au&gt;</author>
	 <link>http://compilers.iecc.com/comparch/article/12-05-004</link>
	 <guid isPermaLink="true">http://compilers.iecc.com/comparch/article/12-05-004</guid>
	 <description>From: "glen herrmannsfeldt" &lt;gah@ugcs.caltech.edu&gt;

&gt;
&gt; (big snip, then I wrote)
&gt;&gt;&gt; Fortran didn't allow for recursion until 1990, and even then you
&gt;&gt;&gt; had to have the RECURSIVE attribute. Compilers could still generate
</description>
      </item>
      <item>
         <title>Re: Good practical language and OS agnostic text?</title>
	 <pubDate>Thu, 3 May 2012 13:04:30 +0000 (UTC)</pubDate>
	 <author>basile@starynkevitch.net</author>
	 <link>http://compilers.iecc.com/comparch/article/12-05-003</link>
	 <guid isPermaLink="true">http://compilers.iecc.com/comparch/article/12-05-003</guid>
	 <description>On Tuesday, April 17, 2012 11:28:46 PM UTC+2, (unknown) wrote:
&gt; Guys, I'm having a bear of a time finding a good practical language
&gt; and OS agnostic text on writing a compiler. I'm weak in math and not
&gt; interested in the theoretical details.
</description>
      </item>
      <item>
         <title>Re: PL/I nostalgia</title>
	 <pubDate>Sun, 29 Apr 2012 16:19:33 +0000 (UTC)</pubDate>
	 <author>Robert A Duff &lt;bobduff@shell01.TheWorld.com&gt;</author>
	 <link>http://compilers.iecc.com/comparch/article/12-04-086</link>
	 <guid isPermaLink="true">http://compilers.iecc.com/comparch/article/12-04-086</guid>
	 <description>glen herrmannsfeldt &lt;gah@ugcs.caltech.edu&gt; writes:

&gt; OK, to get an actual compiler question into the discussion,
&gt; are there any compilers that generate non-reentrant code for
&gt; a language that allows recursion when it isn't being used?
</description>
      </item>
      <item>
         <title>Re: PL/I nostalgia</title>
	 <pubDate>Sat, 28 Apr 2012 18:11:32 +0000 (UTC)</pubDate>
	 <author>glen herrmannsfeldt &lt;gah@ugcs.caltech.edu&gt;</author>
	 <link>http://compilers.iecc.com/comparch/article/12-04-085</link>
	 <guid isPermaLink="true">http://compilers.iecc.com/comparch/article/12-04-085</guid>
	 <description>robin &lt;robin51@dodo.com.au&gt; wrote:

(big snip, then I wrote)
&gt;&gt; Fortran didn't allow for recursion until 1990, and even then you
&gt;&gt; had to have the RECURSIVE attribute. Compilers could still generate
&gt;&gt; non-recursive code without the attribute.
</description>
      </item>
      <item>
         <title>Re: PL/I nostalgia</title>
	 <pubDate>Sat, 28 Apr 2012 14:33:52 +0000 (UTC)</pubDate>
	 <author>"robin" &lt;robin51@dodo.com.au&gt;</author>
	 <link>http://compilers.iecc.com/comparch/article/12-04-084</link>
	 <guid isPermaLink="true">http://compilers.iecc.com/comparch/article/12-04-084</guid>
	 <description>From: "glen herrmannsfeldt" &lt;gah@ugcs.caltech.edu&gt;
Sent: Wednesday, 25 April 2012 9:52 AM

&gt; robin &lt;robin51@dodo.com.au&gt; wrote:
&gt;
&gt; (snip, glen herrmannsfeldt wrote)
&gt;&gt;&gt;It has always seemed to me that PL/I would have been more successful
</description>
      </item>
   </channel>
</rss>

