Explore >> Select a destination
|
You are here 
|
benhoyt.com | ||
| | | | |
bloeys.com
|
|
| | | | | In 'Thought 2: Regex is Like Assembly' I wondered why we are still doing regex in this kind of hard to understand, symbolic way, when we have already invented high level programming languages. There is no reason regex can't be written as clearly as any other programming language we use today. I thought doing this would be an interesting project, and so I came up with Regexl, a high level language for writing regex, that can be used as a simple library. | |
| | | | |
xnacly.me
|
|
| | | | | Reducing the execution time of a benchmark by 85% or 7.03x | |
| | | | |
www.diegofreijo.com
|
|
| | | | | I made a Rust implementation of the Lox programming language introduced by the Crafting Interpreters book. | |
| | | | |
gilmi.me
|
|
| | | ?m.me - Implementing kind inference | ||
