What is Inherently Ambiguous Grammar (2)
Duration: 5 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Database Management System: 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
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: 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
- 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
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- 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, Network Security, Hardware Basics
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- Theory Of Computation: 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
- 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
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
- Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
- English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video lecture focuses on the theoretical concepts of ambiguity within the domain of Formal Languages and Automata Theory, specifically concerning Context-Free Grammars (CFGs). The session begins by introducing the concept of "inherently ambiguous" Context-Free Languages (CFLs). The on-screen text explains that a CFL is called inherently ambiguous if there exists no unambiguous Context-Free Grammar (CFG) capable of generating that specific language. This concept is attributed to a proof by Rohit Parikh in 1961. A concrete mathematical example is provided on the slide: the language defined as the union of two sets, `{a^n b^m c^m d^n} U {a^n b^n c^m d^m}`. Additionally, the slide presents a crucial rule regarding recursion: a grammar that is both left and right recursive is always ambiguous. However, it clarifies that the converse is not true; an ambiguous grammar does not necessarily have to be both left and right recursive.
The instructor then moves to a whiteboard to provide a formal definition of ambiguous grammar. The text on the board states: "The grammar G is said to be ambiguous if there more than one derivation tree for any input string." It further clarifies that if there exist more than one Leftmost Derivation Tree (LMDT) or Rightmost Derivation Tree (RMDT), the grammar is considered ambiguous. To illustrate this, the grammar `S -> aS/Sa/a` is written on the board. The instructor draws a diagram to visualize the concept, showing two different grammars, labeled AG1 and G2, both generating the same language L. He writes `AG1` and `G2` and draws arrows pointing to `L`, circling the grammars to emphasize that distinct grammars can produce the same language.
Later in the video, the presentation returns to the initial slide. The instructor uses a red marker to underline key phrases to emphasize their importance. He underlines "inherently ambiguous," "no unambiguous CFG," "corresponding CFL," and "Rohit Parikh 1961." He also underlines the sentence "Grammar which is both left and right recursive is always ambiguous." Finally, a new slide appears displaying a complex set of production rules: `S -> SAB / e`, `A -> AaB / a`, and `B -> AS / b`. The instructor writes `S -> SAB` and `S -> AAS` on the whiteboard, likely setting up an analysis of this specific grammar's properties.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a slide defining "inherently ambiguous" CFLs, citing Rohit Parikh (1961) and the example `{a^n b^m c^m d^n} U {a^n b^n c^m d^m}`. It also states that left and right recursive grammars are always ambiguous. The instructor then switches to a whiteboard, defining ambiguous grammar as having more than one derivation tree (LMDT or RMDT) for an input string. He writes the example `S -> aS/Sa/a` and draws a diagram showing two grammars (AG1, G2) generating the same language L.
2:00 – 4:33 02:00-04:33
The lecture returns to the slide, where the instructor underlines key terms like "inherently ambiguous," "no unambiguous CFG," and "Rohit Parikh 1961" to reinforce the definitions. He also underlines the rule about left and right recursive grammars. The session concludes with a new slide showing production rules `S -> SAB / e`, `A -> AaB / a`, `B -> AS / b`. The instructor writes `S -> SAB` and `S -> AAS` on the board, preparing to analyze this new grammar.
The lecture systematically builds the understanding of ambiguity by first defining inherent ambiguity in languages, then defining ambiguity in grammars, and finally providing examples and rules. It connects the theoretical proof by Rohit Parikh with practical definitions involving derivation trees and recursion, culminating in the analysis of specific production rules. The visual progression from slide text to whiteboard diagrams helps clarify the abstract concepts of derivation trees and language generation.

