Compiler Design and Construction - Syllabus

Analysis and Synthesis Model of Compilation, including different sub-phases within analysis and synthesis phases.

Basic concepts related to Compiler, including interpreter, simple One-Pass Compiler, preprocessor, macros, symbol table, and error handler.

Review of search structures including heaps, balanced trees, and hash tables.

This topic introduces the foundations of knowledge management, its multidisciplinary nature, and its cultural and technological aspects.

This topic covers the phases of decision making, components of decision support systems, and group decision support systems.

This topic discusses the key challenges facing the evolution of knowledge management, including security, technology, motivation, and data accuracy.

This topic covers the ethics of knowledge management research, intellectual property rights, and the importance of ethical considerations in knowledge management.

The process of breaking the source code into a series of tokens. It involves the specification and recognition of tokens, input buffer, and finite automata relevant to compiler construction.

The process of analyzing the syntax of the source code. It involves basic parsing techniques, problem of left recursion, left factoring, ambiguous grammar, top-down parsing, bottom-up parsing, and LR parsing.

Study of context-free grammar, including parse trees, derivation, and ambiguity. Normal forms of context-free grammar, such as CNF and GNF, are also explored.

Introduction to regular grammars and their properties, including closure properties of context-free languages.

Definition and properties of push down automata (PDA), including language of PDA and equivalence with CFGs.

Study of deterministic and non-deterministic push down automata, including their properties and applications.

Exploration of the equivalence between push down automata and context-free grammars, including conversion techniques.

Function of Symbol Table, Information provided by Symbol Table, Attributes and Data Structures for symbol table

Managing storage during runtime

Introduction to Turing Machines, including their basic concept and computation process.

Exploration of different variants of Turing Machines, including their characteristics and applications.

Study of non-deterministic Turing Machines, including their properties and differences from deterministic machines.

Explanation of Church's Thesis and its significance in the theory of computation, including the concept of algorithm.

Study of undecidable problems and languages, including recursive and recursively enumerable languages, universal language, and unsolvable problems by Turing machines.

Techniques for encoding Turing machines, including unrestricted grammars and Chomsky hierarchy.

Problems that cannot be solved by Turing machines, including Post's Correspondence Problem.

Measuring the complexity of computational problems, including class P and class NP.

Problems that are difficult or impossible to solve in a reasonable amount of time, including NP-complete problems.

Techniques for reducing problems to NP-complete problems, and the implications for computational complexity.

Assignment statements are used to assign a value to a variable in a program.

Addressing array elements involves accessing and manipulating individual elements of an array in a program.

Boolean expressions are used to evaluate conditions and make decisions in a program.

Case statements are used to execute different blocks of code based on the value of an expression.

Procedure calls involve invoking a subroutine or function in a program.

Backpatching is a technique used to fill in missing information in a program during the compilation process.

Basic blocks and flow graphs are used to represent the control flow of a program.

Next use information is used to determine when a variable is next used in a program.

A simple code generator is a basic code generator that generates code for a target machine.

Peephole optimization is a technique used to optimize code by examining a small window of instructions.