SLR(1) Praser 1

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/compiler-design/syntax-analysis-bottom-up/slr1-parser-conflicts/asset-slr1-praser-1 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 provides a detailed lecture on SLR(1) parsing, a method used in compiler construction. It begins by defining the procedure for constructing an SLR(1) parse table, highlighting its similarities and differences with LR(0) parsing. The core distinction lies in the handling of reducing entries, which are restricted by the Follow sets of non-terminals. The lecture then transitions to a practical example, demonstrating the step-by-step construction of a parse table for a specific grammar, illustrating how to identify and resolve conflicts to determine if a grammar is SLR(1).

Chapters

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

    The instructor presents a slide titled 'SLR(1)' outlining the procedure for constructing the parse table. He notes that while the procedure is similar to LR(0), there is a specific restriction on reducing entries. He underlines the term 'LR(0)' to emphasize the comparison. He explains that whenever a final item exists in a state, the reduce entries are placed under the Follow symbol of the Left-Hand Side (LHS) symbol. He writes this rule clearly on the slide. He concludes this section by defining an SLR(1) grammar as one where the parse table is free from multiple entries (conflicts). He emphasizes that if multiple entries exist, the grammar is not SLR(1). He also mentions that the restriction applies specifically to reducing entries, distinguishing it from shift entries which follow standard LR(0) logic.

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

    The scene shifts to a whiteboard example with the grammar A -> aA / b. The instructor displays a DFA with states I0 through I4 and a corresponding parse table. He demonstrates filling the table, specifically focusing on state I3 which contains the final item A -> b.. He explains that the reduce action r2 (for A -> b) should be placed in the columns corresponding to the Follow set of A. He writes r2 in the table for state I3. He discusses the implications of these entries and how they relate to the grammar's structure, ensuring the table remains conflict-free for an SLR(1) grammar. He points to the table and the DFA states to connect the theoretical rules with the practical construction. He also writes down the grammar rules A' -> A, A -> aA, A -> b to clarify the production numbers used in the table.

This lecture segment effectively bridges the gap between theoretical definitions and practical application in compiler design. By first establishing the strict rules for SLR(1) table construction—specifically the use of Follow sets to resolve reduce entries—the instructor provides a clear framework. The subsequent example with the grammar A -> aA / b serves to solidify these concepts, showing exactly how final items in DFA states translate to reduce actions in the parse table. This progression from abstract rules to concrete table filling helps students understand how to identify SLR(1) grammars and avoid parsing conflicts. The visual aids, including the DFA diagram and the parse table, are crucial for visualizing the state transitions and action placements.

Loading lesson…