Linear Grammar

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/theory-of-computation/pushdown-automata-cfg/context-free-grammars/asset-linear-grammar after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. 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
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, 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, 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
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. 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, Complexity Theory
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture defines linear grammars as a specific type of context-free grammar where every production rule contains at most one nonterminal symbol on its right-hand side. The instructor uses the example S -> aSb to generate the language {a^n b^n}, illustrating that the nonterminal can be surrounded by terminals. The lecture then categorizes linear grammars into left-linear and right-linear types, which correspond to regular grammars. It establishes the hierarchy of languages, placing regular languages as a proper subset of linear languages, which in turn are a proper subset of context-free languages. The session concludes with a practice question from NET-JAN-2017 to test comprehension of these relationships.

Chapters

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

    The lecture begins with the definition of a linear grammar, explicitly stated on the slide as a context-free grammar with at most one nonterminal in the right-hand side of each production. The instructor presents a simple linear grammar G with start symbol S and rules S -> aSb and S -> epsilon, which generates the language L = {a^n b^n | n >= 0}. To visualize the rule structure, he writes alpha -> beta on the screen, noting that alpha is a single nonterminal and beta can contain zero or one nonterminal. He lists examples like S -> Sa and S -> aS to demonstrate that the nonterminal can appear at the start, end, or be absent, but never more than once. This section establishes the core constraint that differentiates linear grammars from general context-free grammars.

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

    The instructor introduces two special types of linear grammars: left-linear (or left-regular) and right-linear (or right-regular) grammars. The slide text explains that in left-linear grammars, nonterminals are at the left ends of right-hand sides, while in right-linear grammars, they are at the right ends. He writes examples like S -> Sa / aS / a to show how regular grammars fit this definition. He explains that regular grammars are a subset of linear grammars and discusses a general form where nonterminals can be at either end. The lecture concludes by outlining the language hierarchy: all regular languages are linear, and all linear languages are context-free. He notes that {a^n b^n} is linear but non-regular, while well-balanced bracket pairs are context-free but non-linear. Finally, a NET-JAN-2017 question is presented to apply these concepts.

The video systematically defines linear grammars by their constraint of having at most one nonterminal per production rule. It distinguishes between general linear grammars and the specific cases of left-linear and right-linear grammars, which are equivalent to regular grammars. By establishing the hierarchy where Regular < Linear < Context-Free, the lecture clarifies the position of linear languages within formal language theory. The use of specific examples like {a^n b^n} and the final practice question reinforce the theoretical distinctions and relationships between these language classes.

Loading lesson…