History of Compiler

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-POLYTECHNIC-LECTURER-COMPUTER-SCIENCE/paper-2-compiler-design/intro-to-compilers/lang-processing-system/asset-history-of-compiler after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  2. Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
  4. Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  5. Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  6. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  7. Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
  8. 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  9. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
  10. Database Management Systems: 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, ORDBMS, NoSQL
  11. Computer Networks: 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
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture provides a detailed historical overview of the development of compilers in computer science, focusing on key milestones and the individuals responsible for them. It begins by distinguishing between early implementations and the modern concept of a compiler. The instructor highlights key figures like Corrado Böhm and Grace Hopper, clarifying the specific nature of their contributions and correcting common misconceptions about the term 'compiler.' The discussion then transitions to the development of the first compiler in the modern sense by Alick Glennie and the first commercially available compiler by the FORTRAN team at IBM, marking significant steps in the industry's evolution.

Chapters

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

    The instructor discusses the first practical compiler written by Corrado Böhm in 1951 for his PhD thesis, as shown on the slide. He then moves to Grace Hopper, noting she wrote the first implemented compiler and coined the term 'compiler' for her A-0 system. The instructor emphasizes that Hopper's system functioned as a loader or linker, not the modern notion of a compiler, underlining these specific phrases on the screen to clarify the distinction. He specifically underlines 'PhD thesis' and 'modern notion of a compiler' to ensure students understand the nuance between early systems and what we consider a compiler today. The visual aid includes a photo of Corrado Böhm and Grace Hopper in uniform.

  2. 2:00 – 2:35 02:00-02:35

    The slide updates to discuss the first Autocode and compiler in the modern sense developed by Alick Glennie in 1952 at the University of Manchester for the Mark 1 computer. The instructor underlines Glennie's name and the year 1952. Finally, the lecture covers the FORTRAN team led by John W. Backus at IBM, who introduced the first commercially available compiler in 1957, noting it took 18 person-years to create, which the instructor underlines for emphasis. This section highlights the shift from academic research to commercial application, marking a pivotal moment in software development history. The slide features black and white photos of Alick Glennie and John Backus.

The video traces the evolution of compiler technology from early academic theses and loader systems to the first modern compilers and commercial products. It emphasizes the distinction between early implementations like Hopper's A-0 and the true modern compiler concept established by Glennie and Backus. This progression illustrates the maturation of programming tools from theoretical concepts to practical, industry-standard software.

Loading lesson…