Explore >> Select a destination
|
You are here 
|
stefan-marr.de | ||
| | | | |
pointersgonewild.com
|
|
| | | | | The 1980s and 1990s saw the genesis of Perl, Ruby, Python, PHP and JavaScript: interpreted, dynamically-typed programming languages which favored ease of use and flexibility over performance. In many ways, these programming languages are a product of the surrounding context. The 90s were the peak of the dot-com hype, and CPU clock speeds were still... | |
| | | | |
herbsutter.com
|
|
| | | | | At CppCon 2018, I gave an update of my Lifetime analysis work that makes common cases of pointer/iterator/range/etc. dangling detectable at compile time (the spec is here in the C++ Core Guidelines GitHub repo). During that talk, we mentioned and demo'd two implementations: as a Visual C++ extension by Kyle Reed and Neil MacIntosh, and... | |
| | | | |
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. | |
| | | | |
craftinginterpreters.com
|
|
| | | [AI summary] The text discusses the implementation of a compiler for a simple programming language, focusing on parsing and bytecode generation. It covers topics such as recursive descent parsing, Pratt parsing, and the use of a parser table to handle operator precedence. The text also includes code snippets for the parser and compiler functions, as well as instructions for debugging and testing the compiler. The author emphasizes the importance of error handling and the use of a debug flag to enable the printing of generated bytecode. | ||
