Practice Questions
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
- English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
- Quantitative Aptitude & Numerical Ability: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
- Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
- Data Structures- Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Python- Professional Knowledge: Python for Placements by Yash Sir, Collections & Strings, Functions & Modules, File Handling & Data Analysis, Python Basics
- Operating System- Professional Knowledge: Introduction to OS, Process Management, Process Synchronization, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Windows OS
- DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control, Relational Algebra, Relational Calculus, NoSQL, Data Warehousing & Mining
- Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security, Transport Layer Services, DLL: Flow Control, Cloud Computing
- Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer, Instr Formats & Modes
- Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
- Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
- Programming Languages- Professional Knowledge: C Programming by Yash Sir, Language Design, DMA, Macros, Scoping & File Handling, Object Oriented Programming (OOPS), Programming in C++, Java, HTML, C Language Core
- Emerging Tech- Professional Knowledge: Emerging Tech Trends, MS Office Applications
- Artificial Intelligence: Artificial Intelligence
- Image Processing: Digital Image Fundamentals
- Internet & Web Technology: Website, Browser & Services, Internet Fundamentals, Server Side & Security, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Cyber Safety and Security, Ethical Hacking
- Descriptive Paper: English Writing Ability
- Mains - Unit Tests:
- Mains - Full Mock Tests:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture provides a comprehensive guide on removing left recursion from Context-Free Grammars (CFGs), a fundamental requirement for constructing top-down parsers like recursive descent parsers. The instructor begins with the standard algorithm for immediate left recursion, demonstrating it on a classic arithmetic expression grammar. He then advances to more complex scenarios, including ambiguous grammars and indirect left recursion, illustrating how to substitute non-terminals to expose hidden recursion before applying the elimination technique. The visual board work clearly shows the step-by-step transformation of production rules, making the abstract process concrete for students.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces a grammar with immediate left recursion: E -> E + T / T, T -> T * F / F, F -> (E) / id. He identifies E -> E + T as the source of left recursion. He applies the standard transformation algorithm: E -> T E' and E' -> + T E' / epsilon. Similarly, he transforms T -> F T' and T' -> * F T' / epsilon, while keeping F -> (E) / id unchanged. This section establishes the foundational method for eliminating immediate left recursion by factoring out the recursive part into a new non-terminal E'. The board clearly displays the original grammar in orange and the transformed grammar in blue. The instructor underlines the recursive part.
2:00 – 5:00 02:00-05:00
The lecture progresses to a more ambiguous grammar: E -> E + E / E * E / (E) / id. The instructor rewrites this to remove left recursion, resulting in E -> (E) E' / id E' and E' -> + E E' / * E E' / epsilon. He then tackles another example: R -> R * / R R / (R) / id. He transforms it into R -> (R) R' / id R' and R' -> * R' / R R' / epsilon. Finally, he addresses a list grammar: S -> (L) / a, L -> L, S / S. He transforms L into L -> S L' and L' -> , S L' / epsilon to remove the left recursion in L, ensuring the grammar is no longer left-recursive. The instructor uses underlining to highlight the recursive parts of the productions.
5:00 – 5:38 05:00-05:38
The final example involves indirect left recursion: S -> A a B, A -> S A c / a, B -> B a / b. The instructor substitutes S into A, revealing A -> A a B A c / a. He then removes left recursion from A, resulting in A -> a A' and A' -> a B A c A' / epsilon. He then substitutes A back into S. Alternatively, he substitutes A into S to get S -> S A c a B / a a B, then removes left recursion from S, resulting in S -> a a B S' and S' -> A c a B S' / epsilon. He also handles B -> B a / b by transforming it to B -> b B' and B' -> a B' / epsilon. The board shows the substitution process clearly. He underlines the recursive parts.
The lesson systematically builds from simple immediate left recursion to complex indirect cases. By substituting non-terminals, hidden left recursion is exposed and then eliminated using the standard algorithm, ensuring the grammar is suitable for recursive descent parsers. The visual progression on the whiteboard reinforces the logical steps required for each transformation, providing a clear roadmap for students to follow when dealing with similar grammatical structures in their own studies.

