Removal of Useless Symbols

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/HPSC-PGT-COMPUTER-SCIENCE/compiler-design/grammar-cfg/simplification-of-cfg/asset-removal-of-useless-symbols after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. HPSC Interview Preparation: Interview Preparation
  2. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  3. Data Structure & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Sorting Algorithms, Minimum Spanning Trees, Time Complexity Analysis, Graph Theory, Shortest Path Algos
  4. Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
  5. Computer System & Organisation: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  6. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Transaction Management, Concurrency Control
  7. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling
  8. Digital Logic & Circuits: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  9. Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Pushdown Automata & CFG, Turing Machines, Moore & Mealy Machines
  10. 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
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Data Warehousing & Mining
  12. Introduction to Emerging Trends: Emerging Tech Trends, Sets, Relations, Functions and Discrete Mathematics / समुच्चय, संबंध, फलन और विविक्त गणित, Trade, Marketing and Consumer Protection / व्यापार, विपणन एवं उपभोक्ता संरक्षण, Computer Networks, Internet of Things, Cloud Computing
  13. Digital Society & Cyber Law: Society, Law & Ethics, Cyber Safety and Security
  14. HPSC PGT Previous Year Paper:
  15. HPSC Assistant Professor Previous Year Paper:
  16. Live Sessions: HPSC Live Sessions, EMRS TGT/PGT Live Class
  17. Full Mock Test:
  18. HPSC PGT - MOCK Test Series:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture provides a comprehensive guide to the "Removal of useless symbols" technique in formal language theory. The instructor starts by defining useless symbols as variables not involved in deriving any string. He outlines a two-step method: first, remove variables unreachable from the start symbol; second, remove reachable variables that cannot derive terminals. He uses a slide with bullet points to structure this explanation and then moves to practical examples.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces the topic with a slide titled "Removal of useless symbols." He reads the definition: "The variables which are not involved in the derivation of any string is known as useless symbol." He lists two criteria for removal. First, "Select the variable that cannot be reached from the start symbol of the grammar and remove them along with their all production." Second, "Select variable that are reachable from the start symbol but which does not derive any terminal, remove them along with their productions." He then presents an example grammar: S -> aAB, A -> a, B -> b, C -> d. He explains that C is unreachable from S. He circles "C -> d" on the screen to show it is the useless production to be removed. He emphasizes that even if a variable is reachable, if it doesn't derive a terminal, it is useless.

  2. 2:00 – 2:43 02:00-02:43

    The slide changes to a new example: S -> aA / aB, A -> b. The instructor analyzes the production S -> aA / aB. He uses a pen to cross out "aB" on the screen. He explains that B is not defined, so it is unreachable. The video then cuts to a new slide with a complex grammar: S -> aA | aBB, A -> aaA | lambda, B -> bB | bbC, C -> B. A question appears: "After elimination of Unit, useless and lambda - productions, how may production remain in the resulting grammar?" with options a) 2, b) 3, c) 4, d) 5. The instructor begins to analyze this problem, indicating the start of a detailed walkthrough. He points out the different productions and starts thinking about which ones are unit or lambda productions.

The lesson progresses from theoretical definitions to practical application. It starts by establishing the rules for identifying useless symbols through clear text on a slide. It then moves to simple examples where the instructor visually demonstrates the removal process by circling or crossing out productions. Finally, it introduces a complex problem involving multiple types of production elimination (unit, useless, lambda), challenging the student to apply the previously learned concepts to a more intricate grammar structure.

Loading lesson…