Understanding Derivation of String
Duration: 3 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
- Quantitative Aptitude & Numerical Ability: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
- Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
- Data Structures- Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Python- Professional Knowledge: Python for Placements by Yash Sir, Collections & Strings, Functions & Modules, File Handling & Data Analysis, Python Basics
- Operating System- Professional Knowledge: Introduction to OS, Process Management, Process Synchronization, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Windows OS
- DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control, Relational Algebra, Relational Calculus, NoSQL, Data Warehousing & Mining
- Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security, Transport Layer Services, DLL: Flow Control, Cloud Computing
- Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer, Instr Formats & Modes
- Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
- Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
- Programming Languages- Professional Knowledge: C Programming by Yash Sir, Language Design, DMA, Macros, Scoping & File Handling, Object Oriented Programming (OOPS), Programming in C++, Java, HTML, C Language Core
- Emerging Tech- Professional Knowledge: Emerging Tech Trends, MS Office Applications
- Artificial Intelligence: Artificial Intelligence
- Image Processing: Digital Image Fundamentals
- Internet & Web Technology: Website, Browser & Services, Internet Fundamentals, Server Side & Security, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Cyber Safety and Security, Ethical Hacking
- Descriptive Paper: English Writing Ability
- Mains - Unit Tests:
- Mains - Full 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
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: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.

