<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Expression-Parsing on Pi Stack</title>
    <link>https://www.pistack.xyz/tags/expression-parsing/</link>
    <description>Recent content in Expression-Parsing on Pi Stack</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Mon, 22 Jun 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://www.pistack.xyz/tags/expression-parsing/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Self-Hosted C&#43;&#43; Expression Parsing Libraries: ExprTk vs muParser vs TinyExpr</title>
      <link>https://www.pistack.xyz/posts/2026-06-22-cpp-expression-parsing-libraries-exprtk-muparser-tinyexpr/</link>
      <pubDate>Mon, 22 Jun 2026 00:00:00 +0000</pubDate>
      <guid>https://www.pistack.xyz/posts/2026-06-22-cpp-expression-parsing-libraries-exprtk-muparser-tinyexpr/</guid>
      <description>&lt;h2 id=&#34;introduction&#34;&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;When building applications that need to evaluate mathematical expressions at runtime — whether it&amp;rsquo;s a scientific calculator, a game engine physics solver, a financial modeling tool, or a configuration-driven computation engine — you need a fast, reliable expression parsing library. Writing your own parser from scratch is time-consuming and error-prone. These C++ libraries handle tokenization, parsing, compilation, and evaluation of mathematical expressions, letting you focus on your application logic.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
