Designing LL(1) Parser Part-2
Duration: 6 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
- Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: Introduction to TOC Deterministic FA (DFA) Non-Deterministic FA Regular Expressions Grammar Regular Language Properties Moore & Mealy Machines Pushdown Automata & CFG Turing Machines Complexity Theory
- Paper 2 | Compiler Design: Intro to Compilers Lexical Analysis Grammar & CFG Syntax Analysis: Top-Down Syntax Analysis: Bottom-Up Semantic Analysis & SDT Intermediate Code Gen Code Optimization Run Time Environment
- Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
- Paper 2 | DataBase Management System/DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF File Organization & Indexing Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery
- Paper 2 | Computer Networks: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control DLL: Framing Data Link Layer - Ethernet Net Layer: IPv4 & Proto Net Layer: IP Addressing Net Layer:Routing Protocol Transport Layer Services TL: Congestion & UDP Application Layer Hardware Basics
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture provides a comprehensive guide to constructing a predictive parsing table for a context-free grammar used in compiler design. The instructor starts by presenting a standard arithmetic expression grammar involving addition, multiplication, parentheses, and identifiers. He demonstrates the critical step of eliminating left recursion to transform the grammar into a form suitable for LL(1) parsing. Following this transformation, he systematically calculates the First and Follow sets for all non-terminals, including E, E', T, T', and F. The core of the lecture involves filling out a parsing table based on these sets, placing production rules into specific cells determined by the terminal symbols. The instructor verifies that the resulting table is conflict-free, confirming the grammar's LL(1) property, which is essential for deterministic top-down parsing.
Chapters
0:00 – 2:00 00:00-02:00
The instructor begins by writing the original grammar rules on the left side of the board: E -> E + T / T, T -> T * F / F, and F -> (E) / id. He explains the need to remove left recursion to make the grammar suitable for predictive parsing. He then writes the transformed grammar: E -> T E', E' -> + T E' / epsilon, T -> F T', T' -> * F T' / epsilon, and F -> (E) / id. Below this, he systematically calculates the First and Follow sets for each non-terminal. Visible sets include First(E) = {(, id}, Follow(E) = {$, )}, First(E') = {+, epsilon}, and Follow(E') = {$, )}. He also lists First(T) = {(, id}, Follow(T) = {+, *, ), $}, First(T') = {*, epsilon}, Follow(T') = {+, *, ), $}, First(F) = {(, id}, and Follow(F) = {+, *, ), $}. He then begins the process of constructing the parsing table by identifying the terminals +, *, (, ), id, and $. He places the production E -> T E' into the cells corresponding to the First set of E, which are ( and id.
2:00 – 5:00 02:00-05:00
The instructor proceeds to fill the remaining cells of the parsing table. For the non-terminal E', he places the production E' -> + T E' in the column for the terminal +. He then places the epsilon production E' -> epsilon in the columns corresponding to the Follow set of E', which are ) and $. Moving to the row for T, he places T -> F T' in the ( and id columns, matching the First set of T. For the non-terminal T', he places T' -> * F T' in the * column. He then fills the epsilon production T' -> epsilon into the columns for +, *, ), and $, which correspond to the Follow set of T'. Finally, for the row F, he places F -> (E) in the ( column and F -> id in the id column.
5:00 – 6:18 05:00-06:18
The instructor completes the final entries in the parsing table, ensuring that all epsilon productions are correctly mapped to the Follow sets of their respective non-terminals. He reviews the entire table, pointing out that every cell contains at most one production rule. He states that the absence of conflicts in the table confirms that the grammar is LL(1). He explains that this property allows the parser to make deterministic decisions without backtracking. He concludes the lecture by summarizing the importance of the predictive parsing table in compiler construction.
This lecture connects grammar transformation with parsing table construction. By removing left recursion and calculating First and Follow sets, the instructor shows how to build a predictive parsing table. The final conflict-free table demonstrates that the grammar is LL(1), allowing for efficient parsing without backtracking. This process is fundamental for understanding how compilers analyze and translate source code.

