<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Grep on Aayush Bajaj's Augmenting Infrastructure</title><link>https://abaj.ai/tags/grep/</link><description>Recent content in Grep on Aayush Bajaj's Augmenting Infrastructure</description><generator>Hugo</generator><language>en</language><copyright>© 2026 Aayush Bajaj</copyright><lastBuildDate>Fri, 10 Jul 2026 08:15:51 +1000</lastBuildDate><atom:link href="https://abaj.ai/tags/grep/index.xml" rel="self" type="application/rss+xml"/><item><title>Regular Expressions</title><link>https://abaj.ai/wiki/ccs/linux/regex/</link><pubDate>Fri, 10 Jul 2026 07:44:46 +1000</pubDate><guid>https://abaj.ai/wiki/ccs/linux/regex/</guid><description>&lt;blockquote>
&lt;p>You should not be permitted to write production code if you do not have an journeyman licence in regular expressions or floating point math.
&amp;mdash;Rob Pike&lt;/p>
&lt;/blockquote>
&lt;p>a regular expression is two things wearing one syntax: a seventy-year-old theorem about finite automata, and the single most-used text-processing tool on unix.&lt;span class="margin-note" data-note="kleene proved the theorem in 1951 in a paper about nerve nets, not text — the grep application came later">
 &lt;span class="margin-note-indicator">𐃏&lt;/span>
&lt;/span>

this page takes both seriously: the theory tells you exactly what the notation can and cannot express, and the theory&amp;rsquo;s failure modes (backtracking blowups, backreference NP-hardness, the html-parsing folklore) are precisely where practitioners get burned.&lt;/p></description></item></channel></rss>