3 ms·
>> You need automata theory... Turing-completeness... PDAs and FSAs... > Why? So you can write parsers. To give a real-world example, so you can know immedia
by lisper 11y ago
>> You need automata theory... Turing-completeness... PDAs and FSAs...
> Why?
So you can write parsers. To give a real-world example, so you can know immediately why trying to parse HTML with a regular expression can't possibly work.
>> You need to know how to compile a high-level language down to an RTL.
>Why?
So that when your compiler screws up you can look at its output, figure out what it did wrong, and fix it.
>> You need to understand what a fixed point is and why it matters.
> Well, I don't, and I don't. I request a pointer to suitable study material
http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-001-structure-and-interpretation-of-computer-programs-spring-2005/video-lectures/ http://ocw.mit.edu/courses/electrical-engineering-and-comput...
Particularly lectures 2A and 7A.