<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>AST Transformation on AI VOID</title><link>https://ai-blog.noorshomelab.dev/tags/ast-transformation/</link><description>Recent content in AST Transformation on AI VOID</description><generator>Hugo</generator><language>en</language><lastBuildDate>Tue, 17 Mar 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://ai-blog.noorshomelab.dev/tags/ast-transformation/index.xml" rel="self" type="application/rss+xml"/><item><title>Chapter 7: The Rule Engine: Linting and Deterministic Fixing</title><link>https://ai-blog.noorshomelab.dev/mermaid-lint-guide/chapter-7-the-rule-engine/</link><pubDate>Tue, 17 Mar 2026 00:00:00 +0000</pubDate><guid>https://ai-blog.noorshomelab.dev/mermaid-lint-guide/chapter-7-the-rule-engine/</guid><description>&lt;h2 id="chapter-7-the-rule-engine-linting-and-deterministic-fixing"&gt;Chapter 7: The Rule Engine: Linting and Deterministic Fixing&lt;/h2&gt;
&lt;h3 id="introduction"&gt;Introduction&lt;/h3&gt;
&lt;p&gt;Welcome to Chapter 7! In the previous chapters, we laid the foundational groundwork for our Mermaid analysis tool by building a robust Lexer to tokenize input, a Parser to construct a strongly typed Abstract Syntax Tree (AST), and a Validator to perform initial syntax and semantic checks. With a validated AST in hand, we now move to the core of our linter and fixer: the Rule Engine.&lt;/p&gt;</description></item></channel></rss>