What is Inherently Ambiguous Grammar (2)

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/compiler-design/grammar-cfg/ambiguity-inherent-amb/asset-what-is-inherently-ambiguous-grammar-2 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | 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
  13. 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
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

  1. 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. 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.

Loading lesson…