undefined | Better HN

0 pointsduaneb9y ago0 comments

A lot of optimizations on arbitrary byte code often look for patterns in byte streams (or in reified assembly) in similar ways to regexes.

0 comments

1 comments · 1 top-level

For many years, an important stage of the GHC Haskell compiler consisted of a giant Perl script full of regexes.

j / k navigate · click thread line to collapse