Skip to content
geeksforgeeks
  • Tutorials
    • Python
    • Java
    • Data Structures & Algorithms
    • ML & Data Science
    • Interview Corner
    • Programming Languages
    • Web Development
    • CS Subjects
    • DevOps And Linux
    • School Learning
    • Practice Coding Problems
  • Courses
    • DSA to Development
    • Get IBM Certification
    • Newly Launched!
      • Master Django Framework
      • Become AWS Certified
    • For Working Professionals
      • Interview 101: DSA & System Design
      • Data Science Training Program
      • JAVA Backend Development (Live)
      • DevOps Engineering (LIVE)
      • Data Structures & Algorithms in Python
    • For Students
      • Placement Preparation Course
      • Data Science (Live)
      • Data Structure & Algorithm-Self Paced (C++/JAVA)
      • Master Competitive Programming (Live)
      • Full Stack Development with React & Node JS (Live)
    • Full Stack Development
    • Data Science Program
    • All Courses
  • Aptitude
  • Engineering Mathematics
  • Discrete Mathematics
  • Operating System
  • DBMS
  • Computer Networks
  • Digital Logic and Design
  • C Programming
  • Data Structures
  • Algorithms
  • Theory of Computation
  • Compiler Design
  • Computer Org and Architecture
Open In App
Next Article:
Data flow analysis in Compiler
Next article icon

Introduction of Object Code in Compiler Design

Last Updated : 27 May, 2025
Comments
Improve
Suggest changes
Like Article
Like
Report

Let assume that you have a C program then, you give it to the compiler and compiler will produce the output in assembly code. Now, that assembly language code will be given to the assembler and assembler will produce some code and that code is known as Object Code. 

Object Code

Object Code is a key concept in the process of compiling a program. It refers to the intermediate code produced by the compiler after it translates the source code (written in a high-level programming language) into a lower-level, machine-readable format.

This object code is usually not directly executable and typically needs to be linked with other files to produce the final executable program.

OBJECT-CODE-2
Object code creation

Steps Involved in Compilation

The compilation of a program involves several stages, and object code is produced at a specific point in that process. The steps involved in the process are:

  1. Source Code: The programmer writes the program in a high-level programming language (like C, Java, Python, etc.).
  2. Lexical Analysis: The compiler performs lexical analysis to break the source code into tokens (keywords, operators, identifiers, etc.).
  3. Syntax and Semantic Analysis: Next, the compiler checks the structure (syntax) and meaning (semantics) of the code, ensuring that it follows the rules of the language and is logically correct.
  4. Intermediate Code Generation: The compiler may create an intermediate code that is not machine-specific, providing a way to optimize or analyze the program further. This is often a platform-independent representation.
  5. Code Generation (Object Code): Finally, the compiler translates the intermediate code into object code, which is machine-level code specific to the target machine architecture but still not fully executable.

Structure of Object Code

Object code is a binary file that contains machine instructions, but it's not directly executable yet. The object code is typically in a format that can be understood by the computer’s linker (a separate tool that helps to create an executable file). The main elements of object code include:

OBJECT-CODE
Object Code Structure
  • Header : The header will say what are the various parts present in this object code and then point that parts. So header will say where the text segment is going to start and a pointer to it and where the data segment going to start and it say where the relocation information and symbol information there.
  • Text segment : It is nothing but the set of instruction.
  • Data Sections: Object code may contain sections for data (variables, constants, etc.), including initialized data and uninitialized data (commonly called .data and .bss sections).
  • Relocation Information: Object code may include information on how addresses should be adjusted during the linking process. It’s used to modify addresses of variables and functions when combining multiple object files into a single executable.

Let us assume you have instruction 1, instruction 2, instruction 3, instruction 4,....

Now if you say somewhere Goto L4 (Even if you don't write Goto statement in the high-level language, the output of the compiler will write it), then that code will be converted into object code and L4 will be replaced by Goto 4.

compilation3

Now Goto 4 for the level L4 is going to work fine, as long as the program is going to be loaded starting at address no 0. But in most cases, the initial part of the RAM is going to be dedicated to the operating system. Even if it is not dedicated to the operating system.

Then might be some other process that will already be running at address no 0. So, when you are going to load the program into memory, means if the program has to be loaded in the main memory, it might be loaded anywhere. Let us say 1000 is the new starting address, then all the addresses have to be changed, that is known as Reallocation.

compilation4
Relocation of addresses
  • Symbol Table: The object code contains a symbol table that keeps track of all the variables, functions, and other symbols used in the program. This table is essential for linking because it helps the linker resolve references to functions or variables that are defined elsewhere (in other object files or libraries).
  • Debugging Information: Sometimes, object code also contains debugging information, allowing developers to debug the program after compilation (e.g., file names, line numbers, variable names).

Features of Object Code

  • Machine-readable format: Object code is in a format that can be executed directly by the processor without the need for further translation.
  • Architecture-specific: It is specific to a particular processor architecture, so it must be recompiled for other architectures.
  • Linking: It can be linked together with other object files and libraries to create a complete executable program.
  • Debugging information: It can include debugging information, such as line numbers and variable names, to aid in debugging the program.
  • Relocation information: It includes information about the addresses of symbols in the code, allowing the linker to adjust the addresses when the code is linked with other code.
  • Code optimization: It can be optimized by the compiler to improve performance, reduce code size, or both.
  • Assembly code: It can be disassembled into assembly code, which can be useful for understanding how the program works or for reverse engineering.

Advantages of Object Code

  • Efficiency: It is optimized for the specific target platform, which can result in more efficient code than would be possible with a high-level language.
  • Portability: It is typically platform-specific, but it can still be portable across different systems that use the same platform. This allows developers to write code once and compile it for multiple target systems.
  • Debugging: It can be easier to debug than source code, as it provides a low-level view of the program's execution. Developers can use object code to trace the execution of the program and identify errors or issues that may be present.
  • Protection: It can be protected through the use of obfuscation techniques, making it harder for others to reverse engineer the code or steal intellectual property.
  • Security: It is more secure than source code because it is not readable by humans, making it more difficult for attackers to reverse engineer the code.
  • Interoperability: It can be easily linked with other object files to create a complete executable program.

Disadvantages of Object Code

  • Platform-specific: It is specific to a particular platform, which means that it may not be compatible with other systems. This can limit the portability of the code and make it harder to deploy across multiple systems.
  • Limited readability: It is a low-level language that is harder to read and understand than source code. This can make it more difficult for developers to maintain and debug the code.
  • Limited control: It is generated by the compiler, and developers have limited control over the resulting code. This can limit the ability to optimize the code or tailor it to specific requirements.
  • Compatibility issues: It can sometimes be incompatible with other components of the system, which can cause errors or performance issues.
  • Code size: It is typically larger than source code because it contains additional information, such as symbols and relocation information.
  • Licensing: It may be subject to licensing restrictions that limit its use and distribution.

Next Article
Data flow analysis in Compiler

S

Samit Mandal
Improve
Article Tags :
  • Misc
  • Compiler Design
  • GATE CS
Practice Tags :
  • Misc

Similar Reads

    Compiler Design Tutorial
    A compiler is software that translates or converts a program written in a high-level language (Source Language) into a low-level language (Machine Language or Assembly Language). Compiler design is the process of developing a compiler.It involves many stages like lexical analysis, syntax analysis (p
    3 min read

    Introduction

    Introduction of Compiler Design
    A compiler is software that translates or converts a program written in a high-level language (Source Language) into a low-level language (Machine Language or Assembly Language). Compiler design is the process of developing a compiler.The development of compilers is closely tied to the evolution of
    9 min read
    Compiler construction tools
    The compiler writer can use some specialized tools that help in implementing various phases of a compiler. These tools assist in the creation of an entire compiler or its parts. Some commonly used compiler construction tools include: Parser Generator - It produces syntax analyzers (parsers) from the
    4 min read
    Phases of a Compiler
    A compiler is a software tool that converts high-level programming code into machine code that a computer can understand and execute. It acts as a bridge between human-readable code and machine-level instructions, enabling efficient program execution. The process of compilation is divided into six p
    10 min read
    Symbol Table in Compiler
    Every compiler uses a symbol table to track all variables, functions, and identifiers in a program. It stores information such as the name, type, scope, and memory location of each identifier. Built during the early stages of compilation, the symbol table supports error checking, scope management, a
    8 min read
    Error Detection and Recovery in Compiler
    Error detection and recovery are essential functions of a compiler to ensure that a program is correctly processed. Error detection refers to identifying mistakes in the source code, such as syntax, semantic, or logical errors. When an error is found, the compiler generates an error message to help
    6 min read
    Error Handling in Compiler Design
    During the process of language translation, the compiler can encounter errors. While the compiler might not always know the exact cause of the error, it can detect and analyze the visible problems. The main purpose of error handling is to assist the programmer by pointing out issues in their code. E
    5 min read
    Language Processors: Assembler, Compiler and Interpreter
    Computer programs are generally written in high-level languages (like C++, Python, and Java). A language processor, or language translator, is a computer program that convert source code from one programming language to another language or to machine code (also known as object code). They also find
    5 min read
    Generation of Programming Languages
    Programming languages have evolved significantly over time, moving from fundamental machine-specific code to complex languages that are simpler to write and understand. Each new generation of programming languages has improved, allowing developers to create more efficient, human-readable, and adapta
    6 min read

    Lexical Analysis

    Introduction of Lexical Analysis
    Lexical analysis, also known as scanning is the first phase of a compiler which involves reading the source program character by character from left to right and organizing them into tokens. Tokens are meaningful sequences of characters. There are usually only a small number of tokens for a programm
    6 min read
    Flex (Fast Lexical Analyzer Generator)
    Flex (Fast Lexical Analyzer Generator), or simply Flex, is a tool for generating lexical analyzers scanners or lexers. Written by Vern Paxson in C, circa 1987, Flex is designed to produce lexical analyzers that is faster than the original Lex program. Today it is often used along with Berkeley Yacc
    7 min read
    Introduction of Finite Automata
    Finite automata are abstract machines used to recognize patterns in input sequences, forming the basis for understanding regular languages in computer science. They consist of states, transitions, and input symbols, processing each symbol step-by-step. If the machine ends in an accepting state after
    4 min read
    Ambiguous Grammar
    Context-Free Grammars (CFGs) is a way to describe the structure of a language, such as the rules for building sentences in a language or programming code. These rules help define how different symbols can be combined to create valid strings (sequences of symbols).CFGs can be divided into two types b
    7 min read

    Syntax Analysis

    Introduction to Syntax Analysis in Compiler Design
    Syntax Analysis (also known as parsing) is the step after Lexical Analysis. The Lexical analysis breaks source code into tokens.Tokens are inputs for Syntax Analysis.The goal of Syntax Analysis is to interpret the meaning of these tokens. It checks whether the tokens produced by the lexical analyzer
    7 min read
    FIRST and FOLLOW in Compiler Design
    In compiler design, FIRST and FOLLOW are two sets used to help parsers understand how to process a grammar.FIRST Set: The FIRST set of a non-terminal contains all the terminal symbols that can appear at the beginning of any string derived from that non-terminal. In other words, it tells us which ter
    6 min read
    FIRST Set in Syntax Analysis
    The FIRST set is used in syntax analysis to identify which terminal symbols can appear at the start of strings derived from a non-terminal. It is crucial for LL and LR parsers, helping them decide which rules to apply.To compute the FIRST set:Add the terminal itself to the FIRST set for all terminal
    6 min read
    FOLLOW Set in Syntax Analysis
    The FOLLOW set in Syntax Analysis is a group of symbols that can come right after a non-terminal in a grammar. It helps parsers figure out what should appear next in the input while checking if the grammar is correct. The FOLLOW set is important for building parsing tables, especially in LL(1) parse
    5 min read
    Classification of Context Free Grammars
    A Context-Free Grammar (CFG) is a formal rule system used to describe the syntax of programming languages in compiler design. It provides a set of production rules that specify how symbols (terminals and non-terminals) can be combined to form valid sentences in the language. CFGs are important in th
    4 min read

    Parsers

    Parsing - Introduction to Parsers
    Parsing, also known as syntactic analysis, is the process of analyzing a sequence of tokens to determine the grammatical structure of a program. It takes the stream of tokens, which are generated by a lexical analyzer or tokenizer, and organizes them into a parse tree or syntax tree.The parse tree v
    6 min read
    Classification of Top Down Parsers
    Top-down parsing is a way of analyzing a sentence or program by starting with the start symbol (the root of the parse tree) and working down to the leaves (the actual input symbols). It tries to match the input string by expanding the start symbol using grammar rules. The process of constructing the
    4 min read
    Bottom-up Parsers
    Bottom-up parsing is a type of syntax analysis method where the parser starts from the input symbols (tokens) and attempts to reduce them to the start symbol of the grammar (usually denoted as S). The process involves applying production rules in reverse, starting from the leaves of the parse tree a
    13 min read
    Shift Reduce Parser in Compiler
    Shift-reduce parsing is a popular bottom-up technique used in syntax analysis, where the goal is to create a parse tree for a given input based on grammar rules. The process works by reading a stream of tokens (the input), and then working backwards through the grammar rules to discover how the inpu
    11 min read
    SLR Parser (with Examples)
    LR parsers is an efficient bottom-up syntax analysis technique that can be used to parse large classes of context-free grammar is called LR(k) parsing. L stands for left-to-right scanningR stands for rightmost derivation in reversek is several input symbols. when k is omitted k is assumed to be 1.Ad
    4 min read
    CLR Parser (with Examples)
    LR parsers :It is an efficient bottom-up syntax analysis technique that can be used to parse large classes of context-free grammar is called LR(k) parsing. L stands for the left to right scanningR stands for rightmost derivation in reversek stands for no. of input symbols of lookahead Advantages of
    7 min read
    Construction of LL(1) Parsing Table
    Parsing is an essential part of computer science, especially in compilers and interpreters. From the various parsing techniques, LL(1) parsing is best. It uses a predictive, top-down approach. This allows efficient parsing without backtracking. This article will explore parsing and LL(1) parsing. It
    6 min read
    LALR Parser (with Examples)
    LALR Parser :LALR Parser is lookahead LR parser. It is the most powerful parser which can handle large classes of grammar. The size of CLR parsing table is quite large as compared to other parsing table. LALR reduces the size of this table.LALR works similar to CLR. The only difference is , it combi
    6 min read

    Syntax Directed Translation

    Syntax Directed Translation in Compiler Design
    Syntax-Directed Translation (SDT) is a method used in compiler design to convert source code into another form while analyzing its structure. It integrates syntax analysis (parsing) with semantic rules to produce intermediate code, machine code, or optimized instructions.In SDT, each grammar rule is
    8 min read
    S - Attributed and L - Attributed SDTs in Syntax Directed Translation
    In Syntax-Directed Translation (SDT), the rules are those that are used to describe how the semantic information flows from one node to the other during the parsing phase. SDTs are derived from context-free grammars where referring semantic actions are connected to grammar productions. Such action c
    4 min read
    Parse Tree in Compiler Design
    In compiler design, the Parse Tree depicts the syntactic structure of a string in accordance with a given grammar. It was created during the parsing phase of compilation, wherein syntax of the input source code is analyzed. A parse tree is a useful way of showing how a string or program would be der
    4 min read
    Parse Tree and Syntax Tree
    Parse Tree and Syntax tree are tree structures that represent the structure of a given input according to a formal grammar. They play an important role in understanding and verifying whether an input string aligns with the language defined by a grammar. These terms are often used interchangeably but
    4 min read

    Code Generation and Optimization

    Code Optimization in Compiler Design
    Code optimization is a crucial phase in compiler design aimed at enhancing the performance and efficiency of the executable code. By improving the quality of the generated machine code optimizations can reduce execution time, minimize resource usage, and improve overall system performance. This proc
    9 min read
    Intermediate Code Generation in Compiler Design
    In the analysis-synthesis model of a compiler, the front end of a compiler translates a source program into an independent intermediate code, then the back end of the compiler uses this intermediate code to generate the target code (which can be understood by the machine). The benefits of using mach
    6 min read
    Issues in the design of a code generator
    A code generator is a crucial part of a compiler that converts the intermediate representation of source code into machine-readable instructions. Its main task is to produce the correct and efficient code that can be executed by a computer. The design of the code generator should ensure that it is e
    7 min read
    Three address code in Compiler
    TAC is an intermediate representation of three-address code utilized by compilers to ease the process of code generation. Complex expressions are, therefore, decomposed into simple steps comprising, at most, three addresses: two operands and one result using this code. The results from TAC are alway
    6 min read
    Data flow analysis in Compiler
    Data flow is analysis that determines the information regarding the definition and use of data in program. With the help of this analysis, optimization can be done. In general, its process in which values are computed using data flow analysis. The data flow property represents information that can b
    6 min read
    Compiler Design | Detection of a Loop in Three Address Code
    Prerequisite - Three address code in Compiler  Loop optimization is the phase after the Intermediate Code Generation. The main intention of this phase is to reduce the number of lines in a program. In any program majority of the time is spent actually inside the loop for an iterative program. In the
    3 min read
    Introduction of Object Code in Compiler Design
    Let assume that you have a C program then, you give it to the compiler and compiler will produce the output in assembly code. Now, that assembly language code will be given to the assembler and assembler will produce some code and that code is known as Object Code. Object CodeObject Code is a key co
    6 min read
    Data flow analysis in Compiler
    Data flow is analysis that determines the information regarding the definition and use of data in program. With the help of this analysis, optimization can be done. In general, its process in which values are computed using data flow analysis. The data flow property represents information that can b
    6 min read

    Runtime Environments

    Static and Dynamic Scoping
    The scope of a variable x in the region of the program in which the use of x refers to its declaration. One of the basic reasons for scoping is to keep variables in different parts of the program distinct from one another. Since there are only a small number of short variable names, and programmers
    6 min read
    Runtime Environments in Compiler Design
    A translation needs to relate the static source text of a program to the dynamic actions that must occur at runtime to implement the program. The program consists of names for procedures, identifiers, etc., that require mapping with the actual memory location at runtime. Runtime environment is a sta
    8 min read
    Linker
    A linker is an essential tool in the process of compiling a program. It helps combine various object modules (output from the assembler) into a single executable file that can be run on a system. The linker’s job is to manage and connect different pieces of code and data, ensuring that all reference
    8 min read
    Loader in C/C++
    The loader is the program of the operating system which loads the executable from the disk into the primary memory(RAM) for execution. It allocates the memory space to the executable module in the main memory and then transfers control to the beginning instruction of the program. The loader is an im
    3 min read

    Compiler Design LMN

    Last Minute Notes - Compiler Design
    In computer science, compiler design is the study of how to build a compiler, which is a program that translates high-level programming languages (like Python, C++, or Java) into machine code that a computer's hardware can execute directly. The focus is on how the translation happens, ensuring corre
    13 min read

    Compiler Design GATE PYQ's and MCQs

    Compiler Design - GATE CSE Previous Year Questions
    In this article, we are mainly focusing on the Compiler Design GATE Questions that have been asked in Previous Years, with their solutions. And where an explanation is required, we have also provided the reason. Topic-Wise Quizzes to Practice Previous Year's QuestionsLexical AnalysisParsingSyntax-Di
    1 min read
geeksforgeeks-footer-logo
Corporate & Communications Address:
A-143, 7th Floor, Sovereign Corporate Tower, Sector- 136, Noida, Uttar Pradesh (201305)
Registered Address:
K 061, Tower K, Gulshan Vivante Apartment, Sector 137, Noida, Gautam Buddh Nagar, Uttar Pradesh, 201305
GFG App on Play Store GFG App on App Store
Advertise with us
  • Company
  • About Us
  • Legal
  • Privacy Policy
  • In Media
  • Contact Us
  • Advertise with us
  • GFG Corporate Solution
  • Placement Training Program
  • Languages
  • Python
  • Java
  • C++
  • PHP
  • GoLang
  • SQL
  • R Language
  • Android Tutorial
  • Tutorials Archive
  • DSA
  • Data Structures
  • Algorithms
  • DSA for Beginners
  • Basic DSA Problems
  • DSA Roadmap
  • Top 100 DSA Interview Problems
  • DSA Roadmap by Sandeep Jain
  • All Cheat Sheets
  • Data Science & ML
  • Data Science With Python
  • Data Science For Beginner
  • Machine Learning
  • ML Maths
  • Data Visualisation
  • Pandas
  • NumPy
  • NLP
  • Deep Learning
  • Web Technologies
  • HTML
  • CSS
  • JavaScript
  • TypeScript
  • ReactJS
  • NextJS
  • Bootstrap
  • Web Design
  • Python Tutorial
  • Python Programming Examples
  • Python Projects
  • Python Tkinter
  • Python Web Scraping
  • OpenCV Tutorial
  • Python Interview Question
  • Django
  • Computer Science
  • Operating Systems
  • Computer Network
  • Database Management System
  • Software Engineering
  • Digital Logic Design
  • Engineering Maths
  • Software Development
  • Software Testing
  • DevOps
  • Git
  • Linux
  • AWS
  • Docker
  • Kubernetes
  • Azure
  • GCP
  • DevOps Roadmap
  • System Design
  • High Level Design
  • Low Level Design
  • UML Diagrams
  • Interview Guide
  • Design Patterns
  • OOAD
  • System Design Bootcamp
  • Interview Questions
  • Inteview Preparation
  • Competitive Programming
  • Top DS or Algo for CP
  • Company-Wise Recruitment Process
  • Company-Wise Preparation
  • Aptitude Preparation
  • Puzzles
  • School Subjects
  • Mathematics
  • Physics
  • Chemistry
  • Biology
  • Social Science
  • English Grammar
  • Commerce
  • World GK
  • GeeksforGeeks Videos
  • DSA
  • Python
  • Java
  • C++
  • Web Development
  • Data Science
  • CS Subjects
@GeeksforGeeks, Sanchhaya Education Private Limited, All rights reserved
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox
Improvement
Suggest Changes
Help us improve. Share your suggestions to enhance the article. Contribute your expertise and make a difference in the GeeksforGeeks portal.
geeksforgeeks-suggest-icon
Create Improvement
Enhance the article with your expertise. Contribute to the GeeksforGeeks community and help create better learning resources for all.
geeksforgeeks-improvement-icon
Suggest Changes
min 4 words, max Words Limit:1000

Thank You!

Your suggestions are valuable to us.

What kind of Experience do you want to share?

Interview Experiences
Admission Experiences
Career Journeys
Work Experiences
Campus Experiences
Competitive Exam Experiences