Understanding Follow Function

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/compiler-design/syntax-analysis-top-down/first-and-follow-sets/asset-understanding-follow-function after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. 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, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
  7. 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
  8. 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
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed lecture on computing Follow sets within the context of Context-Free Grammars and compiler design. The instructor begins by defining Follow(A) as the set of terminals that can appear immediately to the right of a non-terminal A in any sentential form. He systematically presents four fundamental rules used to calculate these sets, covering cases for start symbols, productions with non-epsilon suffixes, and productions where the suffix can derive epsilon. The lecture then transitions into practical applications, solving examples of increasing complexity to demonstrate the application of these rules.

Chapters

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

    The lecture begins with the definition of Follow(A) displayed on the slide. The instructor explains that Follow(A) contains terminals following A in sentential grammars. He lists four specific rules: Rule 1 states that if A is the start symbol, Follow(A) includes the end marker $. Rule 2 applies when A is followed by a non-epsilon beta, setting Follow(A) to First(beta). Rule 3 handles the case where A is the last symbol in a production, equating Follow(A) to Follow(S). Rule 4 addresses the scenario where A is followed by a beta that can derive epsilon, combining First(beta) and Follow(S). The instructor uses hand-drawn diagrams with arrows and lines to visually represent derivations and the position of terminals relative to non-terminals.

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

    Next, the presenter moves to a simple example where S -> epsilon. He determines First(S) is {epsilon} and Follow(S) is {$} because S is the start symbol. He then introduces a slightly more complex grammar: S -> aA and A -> bA / epsilon. He calculates First(S) as {a} and First(A) as {b, epsilon}. For Follow sets, he establishes Follow(S) as {$}. To find Follow(A), he notes that A appears at the end of the production S -> aA. Applying Rule 3, he concludes that Follow(A) must equal Follow(S), which is {$}. He writes these values clearly on the slide to reinforce the concept.

  3. 5:00 – 7:06 05:00-07:06

    Subsequently, the class analyzes a grammar with multiple productions: S -> AaBb / BbAa, with A -> epsilon and B -> epsilon. The instructor calculates Follow(S) as {$}. For Follow(A), he observes that A is followed by 'a' in both productions, so Follow(A) = {a}. Similarly, B is followed by 'b' in both productions, so Follow(B) = {b}. Finally, he introduces a standard arithmetic expression grammar: E -> E+T / T, T -> T*F / F, F -> (E) / id. He begins calculating Follow sets for this recursive grammar. He determines Follow(E) = {$, +} based on the start symbol and the '+' in E -> E+T. He finds Follow(T) = {*, $, +} by combining the end marker, the '*' from T -> T*F, and the '+' from E -> E+T. He writes Follow(F) = {*, $, +}, indicating the terminals that can follow F in the derived strings.

The video effectively bridges theoretical definitions with practical calculation methods. By starting with abstract rules and moving to concrete examples, the instructor demonstrates how to handle epsilon productions and recursive structures. The progression from simple start symbol cases to complex arithmetic grammars provides a comprehensive guide for students learning to construct parsing tables or analyze grammars.

Loading lesson…