COMPILER DESIGN

Malla Reddy College of Engineering & Technology - Compiler Design Lecture Notes

Name: Malla Reddy College of Engineering & Technology
Status: Autonomous Institution – UGC, Govt. of India
Location: Maisammaguda, Dhulapally, Secunderabad, Telangana State, India.
Affiliations: Affiliated to JNTUH, Hyderabad. Approved by AICTE, Accredited by NBA & NAAC (‘A’ Grade). ISO 9001:2015 Certified

To be a premier center for academic excellence and research through innovative interdisciplinary collaborations,
contributing significantly to the community and society.

To impart cutting-edge Artificial Intelligence technology in line with industry standards.
To cultivate students' research capabilities for addressing complex technical challenges in industry.
To foster graduates who take responsibility for their professional growth and commit to lifelong learning.

To provide sophisticated technical infrastructure inspiring students to reach their potentials.
To create a solid academic and research environment for comprehensive learning experiences.

UNIT I: Basics of language translation; Types of translators; Compiler phases; Lexical and syntax analysis.
UNIT II: Top-down and bottom-up parsing techniques; Error recovery; Parser generators.
UNIT III: Semantic analysis; Intermediate code generation; Symbol tables and their approaches.
UNIT IV: Runtime environments; Coding optimization strategies; Storage allocation mechanisms.
UNIT V: Control flow analysis; Data flow equations; Optimization of object codes; General code generation practices.

As computer usage has become essential in everyday life, multiple programming languages with more advanced features have emerged to enhance user communication with machines. This evolution propels the development of translator software crucial for bridging the gap between machine and human understanding.

Definition: Computer program translating a source language to an equivalent target language.
Types of Language Translators:
- Compiler: Translates source code to executable machine code with error reporting.
- Interpreter: Executes statements of the source program directly without creating an executable program.

Preprocessor: Expands macros and processes skeletal source programs.
Compiler: Converts high-level language code into machine code and identifies errors for user rectification.
Assembler: Converts assembly language programs into machine code.
Loader/Linker: Collects relocatable code, modifying addresses to create executable code.

Definition: Constructs parse trees starting from the root and moving downwards.
Types of Parsers: LL(1), Recursive descent, Predictive parsing.
Limitations: Backtracking, difficulty with ambiguous grammar.

Validates and checks the meanings of constructed syntax trees against a language’s rules.

Converts high-level constructs into more manageable intermediate formats such as three-address code, particularly useful for optimizations.

Enhances the execution efficiency of code by reducing time and space overhead. Techniques include common sub-expression elimination, constant folding, and variable propagation.

Activation Records: Contain local variables, parameters, return addresses, and temporary data used during procedure execution.
Storage Allocation: Varies between methods such as static, dynamic, and stack allocation, affecting performance based on variable lifetime and visibility.

Data Flow Analysis: Examines how variables are used and defined across control flow graphs to optimize program execution by minimizing dead code and re-evaluations.

Symbol Table: A data structure maintaining information about variables, functions, and their properties (type, scope, lifetime).
Storage Methods: Can include linear lists, hash tables, and trees depending on the scope requirements.

Machine-independent and dependent code generation: Targets different architectures considering their particular features.
Key Processes: Register allocation, instruction scheduling, and peephole optimizations for effective execution.