Process of making Grammar Compiler Friendly

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/compiler-design/grammar-cfg/derivation-recursion/asset-process-of-making-grammar-compiler-friendly after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer, Register Transfer and Microoperations
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Amplitude Modulation, Communication Fundamentals and Bandpass Signals, Random Processes, Angle Modulation, Superheterodyne Receivers and Phase-Locked Loops, Noise in Communication Systems, Pulse Modulation and Pulse Code Modulation, Baseband Digital Transmission, Signal Space and Optimum Detection, Digital Modulation, Information Theory and Source Coding, Error Control Coding, Multiplexing and Multiple Access, Wireless, Satellite and Optical Communication Systems, Impedance Matching and Microwave Networks, Continuous-Time Fourier Transform, Radio Links and Propagation, Continuous-Time Fourier Series, System Properties and LTI Systems, Data Converters, Sampling and Reconstruction
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References, OOPS with Java, Generic & Collections, Object Oriented Technology
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. 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
  9. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Linux OS, Windows OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | Computer Networks: Introduction to CN, 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, Application Layer, Hardware Basics
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Web Design & Development, Web Publishing & Hosting, Server Side & Security, HTML Basics, JavaScript-Basics, CSS, XML, HTML5, Basics of Computer Graphics
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends, Internet of Things, Network Security, Security in Mobile and Wireless Computing, Cyber Safety and Security, Cyber Threats and Malware Attacks, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Analogy and Classification, Prepositions and Conjunctions, Sentence Completion, Reading Comprehension, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Sentence Structure and Correction, Articles and Determiners, Narrative Sequencing, Subject-Verb Agreement, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Vocabulary, Verb, Sentence Construction, Modals, Adverb
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Mensuration and Geometry, Mental Ability, Arithmetic, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Analogy, Ratio and Proportion, Vocabulary, Averages, Mixtures and Alligation, Percentages, Geometry, Powers, Surds and Logarithms, Number System, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Alphabet and Word Tests, Sequences and Series, Trigonometry, Simplification and Approximation, Mathematical Operations, Constraint Puzzles, Numerical Reasoning, Series Completion, Patterns in Two-Dimensional Figures, Coding and Decoding, Direction Sense, Assembling and Grouping of Shapes, Cubes and Dice, Profit, Loss and Discount, Probability, Mensuration, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Logical Deduction and Induction, Clocks and Calendars, Time and Work, Algebra, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Combinatorics
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture focuses on the process of making a Context-Free Grammar (CFG) compiler-friendly by eliminating left recursion. The instructor explains that left recursion can cause compilers to enter an infinite loop during the parsing process. To resolve this issue, the lecture demonstrates a standard algorithm to convert left-recursive productions into equivalent right-recursive productions. The session begins with a theoretical explanation of the problem, highlighting the risks of infinite loops. It then transitions into a practical example involving the specific grammar rule $A

ightarrow A\alpha / eta$. The instructor visually derives the new grammar rules and illustrates the equivalence through detailed parse tree diagrams, ensuring students understand how the structural changes preserve the generated language while making it suitable for top-down parsers.

Chapters

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

    The video opens with a slide titled 'Process of making a CFG Compiler Friendly'. The text explicitly states that if a CFG contains left recursion, the compiler may go to an infinite loop. The instructor underlines the phrases 'left recursion' and 'infinite loop' in red to emphasize the core problem. He writes 'LR = RR' on the screen, signifying the goal of converting Left Recursion into Right Recursion. He draws a rough diagram to visualize the transformation process, setting the stage for the specific algorithm to be discussed. The slide also displays the logo 'Knowledge Gate Educator' and the instructor's name 'Sanchit Jain Sir'.

  2. 2:00 – 5:00 02:00-05:00

    The slide changes to a specific question: 'Consider the following Left recursive grammar and convert them into Corresponding Right recursive Grammar?'. The grammar shown is $A ightarrow A\alpha / eta$. The instructor draws parse trees for this left-recursive grammar, showing a left-heavy structure where $A$ expands to $A\alpha$ repeatedly, leading to a deep left branch. He then writes the solution: $A ightarrow eta A'$ and $A' ightarrow \alpha A' / \epsilon$. He draws the corresponding right-recursive parse trees, showing a right-heavy structure, to prove that both grammars generate the same language. The use of the epsilon symbol ($\epsilon$) is highlighted as the base case for the new non-terminal $A'$.

  3. 5:00 – 5:48 05:00-05:48

    The instructor concludes the example by circling the original grammar and the newly derived grammar rules in blue ink. He highlights the new non-terminal $A'$ which handles the repetition of $\alpha$. The visual comparison reinforces the concept that the left-recursive production $A ightarrow A\alpha$ is replaced by a right-recursive production involving $A'$. The lecture ends with a clear visual distinction between the problematic left-recursive form and the compiler-friendly right-recursive form, ensuring the student understands the final state of the conversion.

The lecture effectively bridges the gap between theoretical grammar problems and practical compiler design. By starting with the 'why' (infinite loops) and moving to the 'how' (conversion algorithm), the instructor provides a complete understanding of left recursion removal. The use of visual aids like parse trees and underlining key terms helps solidify the concept that $A ightarrow A\alpha / eta$ is equivalent to $A ightarrow eta A', A' ightarrow \alpha A' / \epsilon$. This transformation is crucial for making grammars suitable for top-down parsing techniques like Recursive Descent Parsing.

Loading lesson…