Pete's Log: my brain hurts

Entry #801, (Coding, Hacking, & CS stuff)
(posted when I was 22 years old.)

ow. So I've been doing battle today. Battle versus the IR code for compilers. And I've been holding my own, so far. 67 test cases. When today began, six of them failed. I've reached the point now where only two fail. It would be no exaggeration to say that I am a badass. But yet again, I've reached a stage where making the test cases work requires no little feat of black hacking. Already, I've annihilated various abstraction barriers.

Let's take a brief break and review algorithms today. I am a little less worried about this class now. I had some difficulty in undergrad algorithms, but have discovered that since I am actually going to class for grad algorithms, stuff is already making more sense. Bueno. Chen gave us this advice today: "don't be the slave of formulas." He also told us that he doesn't like it when he explains something to the class and they then look at him as though he's killed a rabbit. If that happens, he says he will try to keep explaining it until the class only looks at him as if he's killed a fly. And finally, a lesson I personally take out of today's class: When in doubt, take the log of both sides.

So back to the IR. Problem 1: recursion. One of the test cases that fails does so because of recursion issues. The solution: quit being stupid, Pete. Implementing solution: still working on that, may take a while. Problem 2: naming issues with fa loops. The solution: variable renaming. Implementing solution: still working on that too, tho it should be easier than the solution to problem 1. And now, it's implementin' time.