Save this video free

CSCD 420 Nov 19 2026

Chris Cain · 50:56 · Watch on YouTube

Part of Eastern Washington University CSCD 420. See all 32 lectures and search them

These notes were made with YouTube Collector. Paste any YouTube link and get the same: a summary, chapters and a searchable transcript.

Overview

Chris Cain surveys compiler stages, showing how a simple program moves from tokens through context-free grammar parsing, semantic type checking, intermediate code, optimization, and machine code. He then compares exponential exhaustive parsing with CYK's cubic-time approach and introduces top-down LL parsing, focusing on the FIRST function and how it identifies possible leading terminals for grammar symbols.

Key takeaways

Chapters

0:00 Course Schedule and the Compiler Pipeline
3:00 Writing a Context-Free Grammar for a Tiny Programming Language
11:21 Building a Parse Tree for Assignments and Print Statements
14:36 Type Checking and Compiler Decisions About Conversions
19:11 Bidirectional Type Checking and Intermediate Code Generation
22:00 Optimizing Intermediate Code and Generating Machine Instructions
27:15 Symbol Tables and Compiler Error Reporting
32:05 Why Compiler Parsing Needs Better Than Exhaustive Search
36:26 Top-Down Derivations Versus Bottom-Up Parsing
40:33 FIRST Sets: Predicting Possible Leading Terminals
47:17 Calculating FIRST(S) as {a, b, c}

Keep these chapters and the full searchable transcript in your own library.

Transcript excerpt

0:00 20. >> All right, we are getting started. Reminder, we have an assignment due tonight. We're going to be reviewing Monday and Tuesday of next week and then we'll take an exam the day we get back from Thanksgiving break. So, that's why I got that study guide to you early so that you can do some pre-review studying. Make sure you have some questions. I do have some practice problems that we can go over in class, but that will probably only take about half of the cumulative time that I want to have for review. So come, please come prepared with questions if you can fill up the remainder of that time. >> Any questions on schedule? >> Yeah.

0:51 >> Mentioned every day but tomorrow. What are we doing tomorrow? >> Continuing lecture. >> Okay. >> So, we have two more days of content getting as far as we can. Probably not quite getting deep enough to be able to reveal the LL parsing project. So, that will have to come after Thanksgiving. >> Does that not count as revealing it right there? >> I mean, revealing it on Canvas and having enough material dulged for you to you to be able to implement it successfully. All right, we are in the middle of talking about the compilation process. And I guess I'm just thinking about this now, but there's actually something. Maybe I should do this back in the other classroom where I know the sound is set up correctly. So maybe we'll do this

1:37 tomorrow. There's a short video that I wanted. It's 3 minutes. I want to show people on the difference between compilation and interpretation because I think that's an important thing to know as as a computer scientist. I haven't built it into these slides, but it's

This is the start of the transcript. Save this video free for the whole transcript, searchable and time-coded.

In this course

Related notes

Summary, takeaways, and chapters were generated by AI from the video's transcript and may contain errors. The video belongs to its creator, Chris Cain.

Want the full transcript?

Save this video in YouTube Collector to get its complete searchable transcript, your own AI summaries, and a library that keeps every video you collect in one place.