Greibeck Normal Form

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/NIACL-AO-IT-SPECIALIST/computer-architecture-it-specialist/grammar-cfg/normal-forms-bnf/asset-greibeck-normal-form after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Speed Mathematics and Basic Mathematics, Algebra, Percentage, Profit and Loss, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Partnership
  2. Reasoning Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Seating Arrangements, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Syllogisms, Blood Relations, Puzzle Solving (Puzzles), Inequality, Machine Input-Output
  3. English Language: Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Construction, Pronoun, Preposition, Conjunction, Adverb, Verb, Modals, Articles, Determiner, Interjection
  4. General Awareness: Evolution of Indian Banking (Banking & Financial Awareness), GK- Current Affairs, Static General Knowledge, Indian Economy
  5. C Concepts + MCQs (IT Specialist): C Programming by Yash Sir, C Language Core
  6. Java (IT Specialist): Java
  7. Python (IT Specialist): Python for Placements by Yash Sir, Python Basics
  8. OOPs (IT Specialist): Object Oriented Programming (OOPS)
  9. DBMS (IT Specialist): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  10. SQL (IT Specialist): SQL
  11. Software Engineering (IT Specialist): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Data Structure (IT Specialist): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  13. Operating System (IT Specialist): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  14. Compiler Design (IT Specialist): 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
  15. Computer Architecture (IT Specialist): Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  16. Data Communication & Networking (IT Specialist): 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 Security
  17. Descriptive Test (Main Exam): English Writing Ability
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…