Non-Deterministic Grammar

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/left-factoring-prefixes/asset-non-deterministic-grammar 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.

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

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

Loading lesson…