Greibeck Normal Form

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/compiler-design/grammar-cfg/normal-forms-bnf/asset-greibeck-normal-form after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. 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, Complexity Theory
  13. 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture provides a detailed explanation of Greibach Normal Form (GNF) within the context of formal language theory. The instructor begins by defining the specific structural requirements for a grammar to be considered in GNF, emphasizing that every production rule must start with a terminal symbol. He then transitions to a practical example, demonstrating how to convert a standard context-free grammar into GNF by introducing new non-terminal symbols. The lecture covers the theoretical definition, the specific notation involved, and a step-by-step derivation process to illustrate the conversion method.

Chapters

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

    The instructor introduces the definition of Greibach Normal Form using a slide that displays the production rule "A -> a alpha". He breaks down the components: A is a non-terminal (A ∈ Vn), 'a' is a terminal symbol (a ∈ Σ), and alpha is a string of non-terminals (α ∈ Vn*). He draws a red box around the production rule to emphasize its structure. He explains that unlike other normal forms, GNF strictly requires the right-hand side to begin with a terminal symbol. He highlights that alpha can be a string of zero or more non-terminals, ensuring the production always starts with a terminal followed by non-terminals.

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

    The instructor works through a specific example grammar: S -> aSb / ab. He explains that this is not in GNF because the production S -> aSb contains a terminal 'b' after the non-terminal 'S'. To fix this, he introduces a new non-terminal B with the rule B -> b. He rewrites the productions as S -> aSB / aB. He demonstrates the derivation of the string "aabb" by showing the steps: S -> aSB -> aaBB -> aabb. He writes the length of the string |w| = 2 and then |w| = 4, relating it to the height of the derivation tree. He writes "2n-1" to describe the relationship between string length and tree height, drawing a tree structure to visualize the derivation S -> aSB. He emphasizes that the height of the tree grows linearly with the length of the string, which is a characteristic property of GNF.

The lecture effectively bridges the gap between theoretical definition and practical application. By defining the strict structure of GNF productions and then immediately applying it to a concrete example, the instructor clarifies how to transform standard grammars into this specific normal form. The focus on replacing terminals with non-terminals to maintain the "terminal-first" rule is a key takeaway for students learning about grammar conversions. Understanding the relationship between string length and derivation tree height, as shown in the example, provides deeper insight into the properties of GNF grammars.

Loading lesson…