Compiler - It is a software program that converts a program written in High-level language to a low-level language(object/ target language). It also reports errors present in source programs.
Types of compilers:
- Single-pass compilers: It is a type of compiler that processes the source code only once.
- Multi-pass compilers: It is a type of compiler that processes the source code multiple time(to convert High-level language to Low-level language) i.e. to convert source code to target/ object code.
There are two phases of the compilation process:
- Analysis: It breaks up the source code/program into small parts and creates an intermediate representation of the source program.
- Synthesis phase: It takes the intermediate representation of the source program as input and creates the desired target code/program.
There are five phases of a compiler:
Lexical analyzer
- Reads the program and converts it into tokens using the LEX tool.
- Tokens are defined by regular expressions which are understood by the lexical analyzer
- Removes white spaces, comments, tabs.
Syntax analyzer
- Constructs the parse tree.
- Takes the tokens one by one and uses CFG to construct the parse tree.
- Using these productions we can represent what the program actually is.
- The input has to be checked whether it is in the desired format or not.
Semantic analyzer
- Verifies the parse tree, whether it is meaningful or not.
- It uses the parse tree and info in the symbol table to check the source program for semantic consistency with the language definition.
Intermediate code generator
- Generates the intermediate code. Example: Three address codes.
- This code is converted to machine language using the last two phases which are platform dependent.
Code optimizer
- We can get optimized code.
- The code optimization phase attempts to improve the intermediate code so that it runs faster and consumes fewer resources.
Target code generator
- The final phase of the compiler generates the target code/assembly code.
Symbol Table
- The data structure is used by the compiler to store all the information related to identifiers, for example, their types, scope, location name, etc.
- It helps the compiler to function smoothly by finding the identifiers quickly.
- All the phases interact with the symbol table manager.
Error handler
It is a module that takes care of the events which are encountered during compilation and it takes care to continue the compilation process even if the error is encountered. The task of the error handling process is to detect each error, report it to the user and implement them to handle errors.
Grammars
It is basically a set of rules that defines the valid structure of a particular language.
A grammar consists of four components:
- Set of terminals: They are not replaced by any other thing further.
- Set of non-terminals: Values/variables that are replaced by terminals.
- Set of productions
- Start symbol: One of the non-terminals is designated as the start symbol from where the production begins.
Compiler Design MCQs
What of the following can recognize Context-sensitive grammar?
Real-Life Problems
Prep for Target Roles
Custom Plan Duration
Flexible Plans
What does LR stand for?
What does the lexical analyzer take as input?
What does the lexical analyzer take as output?
What is a linear analysis called in a compiler?
Explore InterviewBit’s Exclusive Live Events
What is the action of parsing the source program into proper syntactic classes known as?
What is the action of parsing the source program into proper syntactic classes known as?
Topic Buckets
Mock Assessments
Reading Material
Earn a Certificate
What is the bottom-up parsing method also known as?
What is the compiler called which runs on one machine and produces code for a different machine?
What is the graph called which shows basic blocks along with their successor relationship?
What is the process of finding a parse tree for a string of tokens called?
What is the process of searching for match tokens described using?
Interview Process
CTC & Designation
Projects on the Job
Referral System
2 Lakh+ Roadmaps Created
What is the role of optimizing the compiler?
What does a top-down parser generate?
When can semantic errors be detected?
When is an interpreter preferred over a compiler?
When is type checking done?
Which of the compiler allows the only modified sections of source code to be recompiled?
Which of the following errors can a compiler check?
Which parsing technique avoids backtracking?
Which part produces the target code from the intermediate representation of source code?
Why is handle pruning used?
Why is semantic analysis responsible for?
Why is the minimum Hamming distance method used?
Why is the symbol table used?
Identify the output of the assembler.
Check whether the following statement is true or false: Ambiguous grammar produces more than one parse tree for some sentence.
Identify the correct definition of lexical analysis?
Identify the correct phase of the compiler.
Identify the data structure which has minimum access time in case of symbol table implementation?
Identify the data structure which is based on the locality of reference used for implementation of the symbol table.
Identify the interpreted language.
Identify the language processor among the following.
Identify the method to determine whether tokens can be generated by a given grammar?
Identify the method which merges the bodies of two loops?
Identify the most general phase of structured grammar.
Identify the most powerful parser?
Another name of top-down parsing is?
Identify the technique used to replace run-time computations with compile-time computations.
Identify the term which is recognized as a sequence of characters in token.
Identify which among the following is used for grouping characters into tokens.
Identifying the class of statement when compiled does not produce any executable code.
In which class does recursive descent parsing belong?
In which does the compiler translate the source code?
In which language do users write the programs?
In which phase of the compiler is grammar checked?
On what basis is the phase syntax analysis modeled?
Through which type of grammar can synthesized attributes can be simulated?
What does a bottom-up parser generate?
