CS 241E

#class

Foundations of Sequential Programs (Enriched)

Prereqs: CS 138

42

Funny story, when I was in my 1A here, I got a 45 on the calc midterm and a lot of people dropped the course. Then they decided to curve it so it ended up being out of 40 instead of 100.

• Prof. Ondřej Lhoták

Yeah that's my other story as a kid, I failed grade 1 because of my handwriting
- Ondřej Lhoták

Yeah, Ed’s in Portugal. Good for him. Bad for me. Everyone’s at OOPSLA, except for me. Not to blame you all.
- Ondřej Lhoták

This stupid 241 course is supposed to have arrays. Wait, I didn't say that.
- Ondřej Lhoták

Student: asks question
Lhoták (loudly): EUGHHHH... because

With DFAs, you have to draw those stupid bubbles
- Ondřej Lhoták

Let's prove this by example
- Ondřej Lhoták

Uhh I was gonna do this quickly, but here we are..
- Ondřej Lhoták

You built a cool thing (compiler), you should be proud of that. Sorry I don't know if that answered your question.
- Ondřej Lhoták

And as a bonus, you get a freebee, I guess black Friday is coming up right, you also get a garbage collector.
- Ondřej Lhoták

This is a stupid analogy but if you move away for co-op, and you get mail.......... does anyone use.. paper mail anymore... anyways
- Ondřej Lhoták

My first co-op work term, you know, I was writing C code, and I used a goto, and my boss looked at the code, and he said "what's this, what are you doing?", and you know it made sense, and then he deleted it, and then he put it back, and he said "you're a co-op, you're not allowed to use gotos, but I'm a senior guy so it's ok".
- Ondřej Lhoták

They're used to evaluate the courses, they're used to evaluate the instructors... they do effect my salary... but uh
- Ondřej Lhoták

1. Introduction
   • Binary
2. The MIPS computer
   • Architecture
   • MIPS
   • Assembly
   • MIPS Assembly
   • Linking and Relocation
3. Variables
   • The Stack
4. Expressions
   • Arrays
   • Register Allocation
   • Conditional Structures
5. Subroutines (Procedures)
6. More procedures
   • Subroutines#Nested Procedures
   • Closures
   • Objects
   • Tail Call Optimization
7. Scanning and Regular Languages
   • Formal Languages
   • Finite Automata
   • Regular Expressions
   • Regular Languages and Kleene's Theorem
   • Scanning
8. Parsing and Context-Free Languages
   • Context-Free Grammars
   • Parsing
   • CYK Parsing
9. Context-Sensitive Analysis and Types
   • Contextual Analysis
   • Type Analysis
10. Compiler Structure
    • Compilers
    • The Heap
    • Cheney's Copying Garbage Collector