<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Pattern-Matching on Pi Stack</title>
    <link>https://www.pistack.xyz/tags/pattern-matching/</link>
    <description>Recent content in Pattern-Matching 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/pattern-matching/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Regular Expression Engine Libraries Compared: RE2 vs PCRE2 vs Hyperscan vs Oniguruma</title>
      <link>https://www.pistack.xyz/posts/2026-06-22-regular-expression-engine-libraries-re2-pcre2-hyperscan-oniguruma/</link>
      <pubDate>Mon, 22 Jun 2026 00:00:00 +0000</pubDate>
      <guid>https://www.pistack.xyz/posts/2026-06-22-regular-expression-engine-libraries-re2-pcre2-hyperscan-oniguruma/</guid>
      <description>&lt;p&gt;Regular expressions are one of the most widely used tools in software engineering, powering everything from log parsing and input validation to network intrusion detection and search engines. But not all regex engines are created equal. The underlying algorithm — backtracking versus finite automaton — determines whether your regex will complete in microseconds or hang indefinitely on certain inputs.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
