<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: rayneorshine</title><link>https://news.ycombinator.com/user?id=rayneorshine</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Fri, 24 Apr 2026 20:18:18 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=rayneorshine" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by rayneorshine in "Writing a C Compiler, in Zig (2025)"]]></title><description><![CDATA[
<p>>Having a garbage collector makes so many compiler algorithms and data structures easier.<p>Does it really?
Compilers tend to be programs that just appends a bunch of data to lists, hashmaps, queues and trees, processes it, then shuts down.
So you can just make append-only data structures and not care too much about freeing stuff.<p>I never worry about memory management when I write compilers in C.</p>
]]></description><pubDate>Fri, 24 Apr 2026 06:58:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=47886608</link><dc:creator>rayneorshine</dc:creator><comments>https://news.ycombinator.com/item?id=47886608</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47886608</guid></item></channel></rss>