Understanding Derivation of String

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/compiler-design/grammar-cfg/derivation-recursion/asset-understanding-derivation-of-string 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 segment focuses on the theoretical foundations of compiler design, specifically the concepts of derivation and parsing. The instructor begins by defining 'Derivation' as the process of deriving a string from a grammar. He introduces the 'Derivation/syntax/parse tree' as the graphical representation of this process and 'Sentential form' as the intermediate steps involved. A detailed table is presented comparing Left Most Derivation (LMD) and Right Most Derivation (RMD) using a sample grammar for arithmetic expressions involving E, +, *, and id. The instructor actively demonstrates the concept by drawing a parse tree on the screen, starting with the root E and branching out to show how E * E is formed. He underlines key terms like 'string' and 'derivation' to emphasize their importance in the context of formal language theory.

Chapters

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

    The lecture starts with foundational definitions displayed on a slide. The text explicitly states, "The process of deriving a string is known as derivation." The instructor explains that the graphical representation is called a derivation tree or parse tree. He defines "Sentential form" as the intermediate steps involved in the derivation. A table is shown with columns labeled "LMD" and "RMD". The rows list production rules like E -> E + E, E -> E * E, and E -> id. The instructor draws a parse tree on the right side of the slide, starting with E at the top, branching to E * E, and further expanding the left E into E + E and eventually id. He uses a red pen to underline "Derivation" and "string" on the slide to highlight the core definition.

  2. 2:00 – 3:05 02:00-03:05

    The slide transitions to formal definitions of the derivation types. The text reads, "Left most derivation: - the process of construction of parse tree by expanding the left most non terminal is known as LMD." It also defines "Right most derivation" similarly, noting that the rightmost non-terminal is expanded. The slide mentions that the graphical representation of LMD is known as LMDT (Left Most Derivation Tree) and RMD as RMDT (Right Most Derivation Tree). The instructor gestures with his hands to explain the expansion process, emphasizing the difference between expanding the leftmost versus the rightmost non-terminal symbol in the string.

The video effectively bridges the gap between abstract definitions and visual representation. By first defining derivation and sentential forms, then showing a step-by-step table of LMD and RMD, and finally drawing the corresponding parse tree, the instructor provides a comprehensive view of how strings are generated. The transition to formal definitions of LMD and RMD solidifies the distinction between the two derivation methods, crucial for understanding parsing algorithms in compiler construction.

Loading lesson…