Explore >> Select a destination
|
You are here 
|
www.humprog.org | ||
| | | | |
www.timdbg.com
|
|
| | | | | ||
| | | | |
jborza.com
|
|
| | | | | CHIP-8 is one of the most popular target architectures for aspiring emulator writers. Im planning to implement it in hardware, so I thought that writing a software emulator/interpreter would be enlightening. I was also looking for some practice before implementing CHIP-8 in hardware in Verilog :) CHIP-8 Virtual machine description: 64x32 pixel monochrome display 4K of 8-bit RAM 16 8-bit variable registers V0-VF I 16-bit address register Stack of 16-bit addresses for call/return 16-bit PC - program counte... | |
| | | | |
werat.dev
|
|
| | | | | Conditional breakpoints are extremely useful, but everyone knows [citation needed] that they're super slow, to the point where people stop using them. Visual Studio recently did some good improvements and @ryanjfleury still dunked on it for being too slow. But even raddbg takes ~2 seconds to execute 10000 iterations of a simple loop with conditional breakpoints inside. For comparison, the same loop without breakpoints takes less than 1ms. So why is it so damn slow? Let's explore how conditional breakpoints are typically implemented in modern debuggers, where the performance problems come from and what can be done to make things go fast. | |
| | | | |
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. | ||
