<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Can Large Language Models Understand Intermediate Representations in Compilers? · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2502.06854/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2502.06854/feed.xml" rel="self" type="application/rss+xml" /><item><title>Can Large Language Models Understand Intermediate Representations in Compilers? — mentioned by peter_d_sherman</title><link>https://news.ycombinator.com/item?id=47594603</link><guid isPermaLink="false">urn:hackerpapers:mention:2502.06854:47594603</guid><pubDate>Tue, 31 Mar 2026 23:00:06 GMT</pubDate><description>&lt;p&gt;&amp;gt;&amp;quot;ASGs are more complex and concise than ASTs because they may contain shared subterms (also known as &amp;quot;common subexpressions&amp;quot;).[1] Abstract semantic graphs are often used as an intermediate representation by compilers to store the results of performing common subexpression elimination upon abstract syntax trees.&amp;quot; Related (Transpiler IR Related): Intermediate Representations: https://cs.lmu.edu/~ray/notes/ir/ https://en.wikipedia.org/wiki/Intermediate_representation QBE Intermediate Language: https://c9x.me/compile/ https://c9x.me/compile/doc/il.html Can Large Language Models Understand…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2502.06854/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
