Grammar Design form Regular Expression part-2
Duration: 7 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: 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
- Paper 2 | 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
- Paper 2 | Programming and 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
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: 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
- 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
- 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
- Paper 2 | DataBase Management System/DBMS: 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
- Paper 2 | 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 Hardware Basics
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The lecture focuses on constructing formal grammars for specific language constraints over the binary alphabet $\Sigma = \{a, b\}$. The instructor begins by addressing length-based constraints, specifically generating strings of length exactly 3, less than or equal to 3, and greater than or equal to 3. He then transitions to content-based constraints, such as strings containing exactly two 'a's, and positional constraints where the second character from the left must be 'b'. The session concludes with modular arithmetic constraints on string length, specifically generating strings where the length is a multiple of 3. Throughout the lecture, the instructor writes regular expressions and corresponding context-free grammar productions on the digital whiteboard to demonstrate the solution process for each distinct problem type.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the first problem: designing a grammar for strings where the length $|w|$ is exactly 3. He writes the regular expression $(a+b)^3$ to represent this set of strings. To convert this into a grammar, he defines a start symbol $S$ that produces three non-terminals, writing $S ightarrow AAA$. He then defines the non-terminal $A$ to generate either 'a' or 'b', writing $A ightarrow a/b$. This setup ensures that any string derived from $S$ will have exactly three characters, satisfying the condition $|w|=3$. He emphasizes that each 'A' must produce exactly one terminal symbol.
2:00 – 5:00 02:00-05:00
The lecture progresses to the second problem: strings where $|w| \le 3$. The instructor writes the grammar $S ightarrow AAA$ with the production $A ightarrow a/b/\epsilon$. This allows the non-terminals to optionally disappear via the empty string $\epsilon$, creating strings of length 0, 1, 2, or 3. Next, he addresses $|w| \ge 3$. He writes the regular expression $(a+b)^3(a+b)^*$ and constructs the grammar $S ightarrow AAAB$. Here, $A ightarrow a/b$ generates the first three characters, while $B ightarrow aB/bB/\epsilon$ generates the remaining zero or more characters recursively. He then briefly introduces a new problem regarding strings with exactly two 'a's, writing the regex $b^* a b^* a b^*$ to visualize the structure.
5:00 – 7:14 05:00-07:14
The instructor continues solving the "exactly two a's" problem by writing the grammar $S ightarrow BABAB$ where $B ightarrow bB/\epsilon$ generates any number of 'b's. He then moves to a positional constraint: "2nd from left end is always b". He writes the regex $(a+b)b(a+b)^*$ and the grammar $S ightarrow ABC$, with $A ightarrow a/b$, $B ightarrow b$, and $C ightarrow aC/bC/\epsilon$. The final problem is $|w| = 0 \pmod 3$. He writes $[(a+b)^3]^*$ and the grammar $S ightarrow AS/\epsilon$ and $A ightarrow BBB$ with $B ightarrow a/b$. At the very end, he starts a problem for $|w|_a = 2 \pmod 3$, writing a complex regex involving blocks of three 'a's to show the pattern.
The video provides a structured approach to designing grammars for various string properties. It moves from simple fixed-length constraints to more complex modular arithmetic and content-based constraints. The instructor consistently uses regular expressions as an intermediate step to visualize the language before defining the formal grammar rules. This method highlights the relationship between regular expressions and context-free grammars, showing how specific structural requirements can be translated into production rules. The progression from length constraints to content and position constraints demonstrates the versatility of grammars in defining formal languages.

