Y
Hacker News
new
|
ask
|
show
|
jobs
by
duaneb
3555 days ago
A lot of optimizations on arbitrary byte code often look for patterns in byte streams (or in reified assembly) in similar ways to regexes.
1 comments
teraflop
3555 days ago
For many years, an important stage of the GHC Haskell compiler consisted of a giant Perl script full of regexes.
http://code.haskell.org/ghc-scp/ghc/docs/comm/the-beast/mang...
link
http://code.haskell.org/ghc-scp/ghc/docs/comm/the-beast/mang...