Types of SDT

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/toc-compiler/semantic-analysis-sdt/attributes-sdt-types/asset-types-of-sdt after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: Introduction to CN, Data Communication, 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, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, 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. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment provides a detailed comparison between S-Attributed and L-Attributes Syntax Directed Translation (SDT) schemes. The instructor utilizes a structured table to outline key differences regarding attribute types, semantic action placement, and evaluation mechanisms. S-Attributed SDT is characterized by the exclusive use of synthesized attributes, whereas L-Attributes SDT incorporates both inherited and synthesized attributes. The lecture clarifies that while S-Attributed SDT is evaluated during Bottom-Up Parsing, L-Attributes SDT requires a depth-first left-to-right traversal of the parse tree.

Chapters

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

    The instructor presents a side-by-side comparison table for S-Attributed and L-Attributes SDT. He underlines the first row, noting S-Attributed uses only synthesized attributes, while L-Attributes uses both inherited and synthesized attributes. He specifically underlines the restriction for L-Attributes: inherited attributes must inherit from either the parent or the left sibling only. Moving to the third row, he explains semantic action placement. For S-Attributed, actions are at the extreme right end of the production. For L-Attributes, they can be placed anywhere on the right-hand side. He writes alpha -> a b [S] c on the screen to visualize this placement. Finally, he notes that S-Attributed attributes are evaluated during Bottom-Up Parsing (BUP).

  2. 2:00 – 2:45 02:00-02:45

    The discussion moves to the evaluation strategy for L-Attributes SDT. The instructor underlines the text: Attributes are evaluated by traversing parse tree depth first left to right. To clarify this, he draws a triangular diagram representing a parse tree. He sketches lines across the nodes of the triangle to demonstrate the traversal order. He emphasizes that unlike S-Attributed SDT which uses BUP, L-Attributes requires a specific depth-first traversal. He crosses out parts of his drawing to indicate the sequence of evaluation, reinforcing the concept that inherited attributes must be available before the node is processed.

The core distinction lies in attribute dependency and evaluation order. S-Attributed SDT is restricted to synthesized attributes evaluated bottom-up, making it suitable for simpler translations. In contrast, L-Attributes SDT allows inherited attributes but restricts their source to parents or left siblings, necessitating a depth-first traversal. This flexibility allows for more complex semantic analysis while maintaining a predictable evaluation order.

Loading lesson…