Type 1 Grammar

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/part-3-theory-of-computation/grammar/chomsky-basics/asset-type-1-grammar after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video introduces Type 1 Grammar, also known as Context-Sensitive Grammar. It defines the grammar as non-contracting and length-increasing, used to generate languages accepted by Linear Bounded Automata. The instructor explains the two standard forms of production rules and emphasizes the length constraint where the right-hand side must be at least as long as the left-hand side.

Chapters

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

    The video begins with a slide titled 'Type 1 Grammar'. The text defines it as 'case sensitive Grammar, length increasing grammar, non-contracting grammar'. It states it is 'used to generate context sensitive language which is accepted by a linear bounded automaton'. The slide presents the general production rule form $\alpha A eta ightarrow \alpha \delta eta$. Below this, constraints are listed: $\alpha, eta \in \{\Sigma \cup V_n\}^*$, $A \in V_n$, and $\delta \in \{\Sigma \cup V_n\}^+$. The instructor verbally introduces these terms, setting the stage for understanding the structural properties of this grammar type. He emphasizes that this grammar is also known as context-sensitive grammar.

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

    The instructor moves to the second form of the rule, shown as $\alpha ightarrow eta$ under the word 'or'. He explains the constraints: $\alpha \in \{\Sigma \cup V_n\}^* \cap \{\Sigma \cup V_n\}^+$, $eta \in \{\Sigma \cup V_n\}^+$, and crucially $|\alpha| \le |eta|$. He writes on the digital whiteboard to demonstrate invalid rules. He writes $A ightarrow \epsilon$ and marks it with a cross, explaining that length cannot decrease. He also writes $A ightarrow B$ and marks it with a cross, noting that while length is equal, it's generally restricted unless specific conditions are met, but primarily focuses on the non-contracting aspect. He emphasizes that the length of the right-hand side must be greater than or equal to the left-hand side. He specifically points to the text 'or' on the slide to indicate the alternative form.

  3. 5:00 – 5:46 05:00-05:46

    In the final segment, the instructor highlights the exception to the non-contracting rule. He circles the condition $|\alpha| \le |eta|$ and then writes $S ightarrow \epsilon$ on the side, circling it to show it is allowed. He explains that the start symbol $S$ can produce an empty string $\epsilon$ provided $S$ does not appear on the right-hand side of any rule. He writes examples like $S ightarrow aSb$ to illustrate valid context-sensitive productions where the string length increases. He concludes by reinforcing that Type 1 grammars are non-contracting, meaning the string length never decreases during derivation, except for the specific $S ightarrow \epsilon$ case.

The lecture provides a comprehensive overview of Type 1 Grammar, focusing on its alternative names like non-contracting and length-increasing grammar. It establishes the connection to Linear Bounded Automata and Context-Sensitive Languages. The core teaching point is the restriction on production rules, specifically that the length of the right-hand side must be greater than or equal to the left-hand side ($|\alpha| \le |eta|$). The instructor uses visual aids and handwritten notes to clarify valid and invalid rules, highlighting the special exception for the start symbol producing an empty string.

Loading lesson…