Non-Deterministic Grammar
Duration: 5 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 lecture introduces the concept of Non-Deterministic Grammars, specifically focusing on grammars that contain common prefixes in their production rules. The instructor explains that such grammars are problematic because they require backtracking during parsing, which is inefficient. The core of the lesson is the introduction of Left Factoring as a method to eliminate these common prefixes, thereby converting a non-deterministic grammar into a deterministic one.
Chapters
0:00 – 2:00 00:00-02:00
The video begins with a slide titled Non-Deterministic Grammar. The text states, The grammar with common prefix is known as Non-Deterministic Grammar. An example production rule is displayed: A -> αβ1 / αβ2. The instructor emphasizes the term common prefix by underlining it in red. He explains that when two productions for a non-terminal A start with the same symbol sequence α, the parser cannot immediately decide which production to use. To illustrate this, he draws the symbol α followed by β on the right side of the screen. He circles the terms αβ1 and αβ2 to highlight the shared prefix α. This visual aid helps students understand that the ambiguity arises from the identical starting symbols.
2:00 – 4:53 02:00-04:53
The slide content changes to discuss the implications of common prefixes. The text reads, The grammar with common prefixes requires a lot of Back-tracking, back-tracking is very time consuming. It further states, To avoid the back-tracking, we need to remove the common prefixes, i.e. we need to convert the non-deterministic Grammar into Deterministic. The instructor then demonstrates the solution by writing new rules on the slide. He introduces a new non-terminal B and rewrites the rules as A -> αB and B -> β1 / β2. He circles these new rules and writes Left factoring underneath. Finally, a definition slide appears: Left Factoring: - The process of conversion of Non-Deterministic grammar into deterministic grammar is known as Left-Factoring. It shows the general transformation pattern.
The lecture logically progresses from identifying a problem common prefixes causing non-determinism to providing a specific algorithmic solution Left Factoring. By extracting the common prefix into a new production rule, the grammar becomes deterministic, allowing for more efficient parsing without backtracking.

