<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Serialization on ./Code</title><link>https://blog.ouankou.com/tags/serialization/</link><description>Recent content in Serialization on ./Code</description><generator>Hugo</generator><language>en</language><copyright>© Anjia Wang</copyright><lastBuildDate>Wed, 08 Jul 2026 15:36:46 +0000</lastBuildDate><atom:link href="https://blog.ouankou.com/tags/serialization/index.xml" rel="self" type="application/rss+xml"/><item><title>How REX Made Sage AST Checkpoints Round-Trip Through JSON</title><link>https://blog.ouankou.com/2026/07/02/how-rex-made-sage-ast-checkpoints-round-trip-through-json/</link><pubDate>Thu, 02 Jul 2026 00:00:00 +0000</pubDate><guid>https://blog.ouankou.com/2026/07/02/how-rex-made-sage-ast-checkpoints-round-trip-through-json/</guid><description>&lt;p&gt;Compilers are full of useful internal boundaries that are hard to make real.&lt;/p&gt;
&lt;p&gt;In REX, one of those boundaries sits around the OpenMP path. A source file goes
through Clang/Flang frontend work, Sage AST construction, OpenMP pragma parsing,
OpenMP AST construction, lowering, unparsing, and sometimes generated helper
files for offloading. Each step has a reasonable conceptual input and output.
But the actual object moving through the compiler is not a small value. It is a
pointer-rich Sage tree inside an &lt;code&gt;SgProject&lt;/code&gt;, tied to types, scopes, symbol
tables, file locations, token streams, comments, directives, hidden declarations,
and transformation side tables.&lt;/p&gt;</description></item></channel></rss>