Regular expressions you can read: a visual syntax and UI
The problem with &quot;regex&quot; is that it left the pure computer science realm of true regular expressions, and thus lost many of the mathematical properties of regular expressions.<p>Regex&#x27;s are then further abused to do things far beyond what true regular expressions can do, which results in cryptic regex expressions whose behaviors are implementation dependent instead of bounded by computer science principles.<p>Lua creator Roberto Ierusalimschy resurfaced and explored the idea of PEGs (Parsing Expression Grammars) as a better way to do the things that people have abused regex to do, while keeping it grounded in pure CS principles, allowing better syntax making things easier to express, more powerful behavior, mathematically grounded complexity (for performance), and more clarity in what can and cannot be accomplished.<p>This video presentation from the Lua Workshop explains all of this and more about why PEGs.
<a href="https:&#x2F;&#x2F;vimeo.com&#x2F;1485123" rel="nofollow">https:&#x2F;&#x2F;vimeo.com&#x2F;1485123</a>