<?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>Ada-Europe Int.Conf. Reliable Software Technologies, AEiC 2021 (online, June 2021)</title>
	 <pubDate></pubDate>
	 <author>Dirk.Craeynest@cs.kuleuven.be (Dirk Craeynest)</author>
	 <link>http://compilers.iecc.com/comparch/article/21-04-013</link>
	 <guid isPermaLink="true">http://compilers.iecc.com/comparch/article/21-04-013</guid>
	 <description>-----------------------------------------------------------------------

                         Call for Participation

                        *** PROGRAM SUMMARY ***

              25th Ada-Europe International Conference on
               Reliable Software Technologies (AEiC 2021)
</description>
      </item>
      <item>
         <title>In defense of phi nodes</title>
	 <pubDate></pubDate>
	 <author>Elijah Stone &lt;elronnd@elronnd.net&gt;</author>
	 <link>http://compilers.iecc.com/comparch/article/21-04-012</link>
	 <guid isPermaLink="true">http://compilers.iecc.com/comparch/article/21-04-012</guid>
	 <description>A conflict, in compiler IL design:

1. We would like to use SSA, to enable fancy optimizations.
2. We would like to allow the value of a register to depend on a branch.

The latter constraint necessitates the existence of multiple assignments,
while the former necessitates that each register be assigned to only once.
</description>
      </item>
      <item>
         <title>Re: Algorithm Optimization</title>
	 <pubDate></pubDate>
	 <author>"Johann 'Myrkraverk' Oskarsson" &lt;johann@myrkraverk.com&gt;</author>
	 <link>http://compilers.iecc.com/comparch/article/21-04-011</link>
	 <guid isPermaLink="true">http://compilers.iecc.com/comparch/article/21-04-011</guid>
	 <description>On 16/09/2020 5:25 am, gah4 wrote:

&gt; I think I remember this being discussed many years ago.

&gt; One thought was that someone codes bubblesort, and the compiler
&gt; generates quicksort. Small complication that bubblesort is stable, and
&gt; quicksort isn't. (Add an array with the original position to break
</description>
      </item>
      <item>
         <title>Lexing Unicode strings?</title>
	 <pubDate></pubDate>
	 <author>"Johann 'Myrkraverk' Oskarsson" &lt;johann@myrkraverk.com&gt;</author>
	 <link>http://compilers.iecc.com/comparch/article/21-04-010</link>
	 <guid isPermaLink="true">http://compilers.iecc.com/comparch/article/21-04-010</guid>
	 <description>Dear c.compilers,

For context, I have been reading the old book Compiler design in C
by Allen Holub; available here

https://holub.com/compiler/

and it goes into the details of the author's own LeX implementation.

Just like the dragon book [which I admit I haven't read for some number
</description>
      </item>
      <item>
         <title>Re: macros of yore, was TeX syntax?</title>
	 <pubDate></pubDate>
	 <author>gah4 &lt;gah4@u.washington.edu&gt;</author>
	 <link>http://compilers.iecc.com/comparch/article/21-04-009</link>
	 <guid isPermaLink="true">http://compilers.iecc.com/comparch/article/21-04-009</guid>
	 <description>On Friday, April 9, 2021 at 4:20:27 PM UTC-7, Rock Brentwood wrote:
&gt; (His original aim is much more doable now, by the way, than in the 1980's,
&gt; because the *forward* advancement of C from the 1980's to C99 actually entails
&gt; a dramatic *simplification* of what's needed for a "cfront" like utility, and
</description>
      </item>
      <item>
         <title>Re: TeX syntax? ... In-stream/parallel parsing &amp; intelligent handling of macros</title>
	 <pubDate></pubDate>
	 <author>Rock Brentwood &lt;rockbrentwood@gmail.com&gt;</author>
	 <link>http://compilers.iecc.com/comparch/article/21-04-007</link>
	 <guid isPermaLink="true">http://compilers.iecc.com/comparch/article/21-04-007</guid>
	 <description>I remade {tangle,weave}.web and c{tangle,weave}.w both in more C-like form as
ordinary contiguous code+comments (+ UNICODE, because I'd like to keep some of
the original spirit of making it as more math-/typeset-friendly
program+documentation) ... and might post what I have on GitHub or somewhere,
</description>
      </item>
      <item>
         <title>Ann: HAC Ada compiler v.0.095</title>
	 <pubDate></pubDate>
	 <author>Gautier write-only address &lt;gautier_niouzes@hotmail.com&gt;</author>
	 <link>http://compilers.iecc.com/comparch/article/21-04-006</link>
	 <guid isPermaLink="true">http://compilers.iecc.com/comparch/article/21-04-006</guid>
	 <description>HAC (HAC Ada Compiler) is a small, quick, open-source Ada compiler,
covering a subset of the Ada language.
HAC is itself fully programmed in Ada.

Web site: http://hacadacompiler.sf.net/

Source repositories:
 #1 svn: https://sf.net/p/hacadacompiler/code/HEAD/tree/trunk/
</description>
      </item>
      <item>
         <title>Re: TeX syntax?</title>
	 <pubDate></pubDate>
	 <author>gah4 &lt;gah4@u.washington.edu&gt;</author>
	 <link>http://compilers.iecc.com/comparch/article/21-04-005</link>
	 <guid isPermaLink="true">http://compilers.iecc.com/comparch/article/21-04-005</guid>
	 <description>On Monday, April 5, 2021 at 7:55:35 AM UTC-7, gah4 wrote:

(snip, John wrote)
&gt; [The m4 macro processor tokenizes its input and then checks to see
&gt; if a token is a named macro. It's still used for autoconf
&gt; configuration scripts. -John]

I know about m4, but have managed never to use it.
</description>
      </item>
      <item>
         <title>Re: TeX syntax?</title>
	 <pubDate></pubDate>
	 <author>gah4 &lt;gah4@u.washington.edu&gt;</author>
	 <link>http://compilers.iecc.com/comparch/article/21-04-004</link>
	 <guid isPermaLink="true">http://compilers.iecc.com/comparch/article/21-04-004</guid>
	 <description>On Sunday, April 4, 2021 at 6:12:06 PM UTC-7, Rock Brentwood wrote:
&gt; [ This is a followup to a thread from 2007. ]
&gt; &gt;I've looked high and low without success. Where can i find
&gt; &gt;something resembling the BNF of Knuth's TeX typesetting syntax?
</description>
      </item>
      <item>
         <title>CEX - Context-Free Expression Filter: update.</title>
	 <pubDate></pubDate>
	 <author>Rock Brentwood &lt;rockbrentwood@gmail.com&gt;</author>
	 <link>http://compilers.iecc.com/comparch/article/21-04-003</link>
	 <guid isPermaLink="true">http://compilers.iecc.com/comparch/article/21-04-003</guid>
	 <description>The following is an update of the comp.compilers article

"CEX - Context-Free Expression Filter"
2007 February 25
https://compilers.iecc.com/comparch/article/07-02-067

Both an updated and UTF-8 converted version of the original have been
posted under comp.theory here:
</description>
      </item>
   </channel>
</rss>
