サクサク読めて、アプリ限定の機能も多数！
トップへ戻る
ブラックフライデー
www.cs.cornell.edu/~asampson
Last time, we saw how deleting stuff from a test case can be an easy and fun route to the root cause of a bug. It’s less easy and less fun when the test cases get big. The inner loop of test-case reduction can get old quickly: delete stuff, run the special command, check the output to decide whether to backtrack or proceed. It’s rote, mechanical, and annoyingly error prone. Let’s make the computer
Flattening ASTs (and Other Compiler Data Structures) May 1, 2023 Normal and flattened ASTs for the expression a * b + c. Arenas, a.k.a. regions, are everywhere in modern language implementations. One form of arenas is both super simple and surprisingly effective for compilers and compiler-like things. Maybe because of its simplicity, I haven’t seen the basic technique in many compiler courses—or a
Statistical Mistakes and How to Avoid Them November 23, 2016 Computer scientists in systemsy fields, myself included, aren’t great at using statistics. Maybe it’s because there are so many other potential problems with empirical evaluations that solid statistical reasoning doesn’t seem that important. Other subfields, like HCI and machine learning, have much higher standards for data analysis. Let
LLVM for Grad Students August 3, 2015 This is an introduction to doing research with the LLVM compiler infrastructure. It should be enough for a grad student to go from mostly uninterested in compilers to excited to use LLVM to do great work. What is LLVM? LLVM is a compiler. It’s a really nice, hackable, ahead-of-time compiler for “native” languages like C and C++. Of course, since LLVM is so awe
このページを最初にブックマークしてみませんか？
『www.cs.cornell.edu』の新着エントリーを見る
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
