21CS61 Dayananda Sagar University • Computer Science & Engineering (Semester 6)

System Software and Compiler Design

💡 DSU Exam Strategy & Guidance

Phases of Compiler, Lexical Analysis, LL(1) Parsing tables, LR(0)/SLR(1) Parsing, Intermediate Code Generation (Three-Address Code), and Code Optimization (DAG).

High-Yield Passing Strategy: Compute First & Follow sets accurately and construct the LL(1) parse table step-by-step.
Most Repeated Question Topics:
First and Follow Set ComputationLL(1) Parsing Table ConstructionLR(0) Canonical Items and SLR(1) TableThree-Address Code Generation (Quadruples/Triples)Directed Acyclic Graph (DAG) for Basic Blocks

🔥 Most Predictable Exam Questions (1)

Guaranteed Every Year 8 Marks Module 2: Syntax Analysis & Top-Down Parsing

Q1. For the grammar: E -> T E_prime, E_prime -> + T E_prime | epsilon, T -> F T_prime, T_prime -> * F T_prime | epsilon, F -> ( E ) | id. Compute FIRST and FOLLOW sets for all non-terminals and construct the LL(1) predictive parsing table.

Key Points: FIRST(E) = FIRST(T) = FIRST(F) = {(, id}. FIRST(E_prime) = {+, eps}. FIRST(T_prime) = {*, eps}. FOLLOW(E) = FOLLOW(E_prime) = {$, )}. FOLLOW(T) = FOLLOW(T_prime) = {+, $, )}. FOLLOW(F) = {*, +, $, )}. Build 5x6 LL(1) table; verify no multiple entries => Grammar is LL(1).

🎓 Open Source Courses & Video Playlists (2)

Stanford Online

Stanford CS143: Compilers (Prof. Alex Aiken)

Watch Course ↗
YouTube (Gate Smashers)

Gate Smashers: Compiler Design Full Course

Watch Course ↗

📄 Previous Year Question Papers (2)

END_SEM • 2024

End Semester Exam 2024

View PDF ↗
END_SEM • 2023

End Semester Exam 2023

View PDF ↗

Turn 21CS61 Notes into AI Flashcards

Upload your System Software and Compiler Design lecture slides to generate spaced repetition study cards in seconds.

Start Free →
MindFlow
DSU Hub Sign In

Structured Active Recall for Complex Coursework.

Turn your lecture PDFs into flashcards, adaptive quizzes, and spaced repetition reviews in seconds.

Start Free Sprint →