Type 3 Grammar

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/theory-of-computation/grammar/chomsky-basics/asset-type-3-grammar-3792 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
  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
  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)
  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, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  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), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  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.

The lecture focuses on Type 3 Grammar, also known as Regular Grammar. The instructor explains that this grammar type generates regular languages, which are accepted by finite machines. He distinguishes between two subtypes: left-linear and right-linear grammars. The core of the lesson involves defining the specific production rules allowed for each type. For left-linear grammars, the non-terminal must appear on the right side of the terminal (e.g., A → Ba). For right-linear grammars, the non-terminal appears on the left side (e.g., A → aB). The instructor emphasizes that mixing these rules results in a language that is no longer regular. He uses board writing to illustrate valid and invalid productions, reinforcing the strict constraints of Type 3 grammars.

Chapters

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

    The instructor introduces Type 3 Grammar, stating it is used to generate Regular Grammar which produces regular languages accepted by finite machines. He highlights that regular grammar has two types: left linear or right linear. On the slide, the text 'Left linear grammar, support two types of production' is visible, followed by the rule A → a / Ba. He underlines key terms like 'regular language' and 'finite machine' to emphasize their importance. The slide also lists constraints: A, B ∈ Vn, |A| = |B| = 1, and a ∈ Σ*. This section sets the foundational definitions for the lecture. He specifically points out that the non-terminals A and B must be from the set of non-terminals Vn.

  2. 2:00 – 3:30 02:00-03:30

    The focus shifts to Right regular grammar. The slide displays the production rule A → a / aB with the same constraints as the left-linear version. The instructor writes on the board, initially writing A → aAa and crossing it out to show it is not a valid regular grammar rule. He then writes A → aA / aB to demonstrate valid right-linear productions. He circles the production rules for both left and right linear grammars on the slide. Finally, he points out the text at the bottom: 'however, if left-linear rules and right-linear rules are combined, the language need no longer be regular,' warning against mixing the two types. He emphasizes that the length of the string 'a' must be exactly 1.

The video provides a clear distinction between left-linear and right-linear grammars within the context of Type 3 (Regular) Grammar. By defining specific production rules and illustrating invalid examples, the instructor clarifies the strict structural requirements needed to maintain a language as regular. The key takeaway is that while both types are regular individually, combining them breaks the regularity property. The visual aids, including underlined text and board annotations, reinforce the strict constraints on production rules.

Loading lesson…