A compiler is a program that reads a program in one language, the source language and translates into an equivalent program in another language, the target language.
The translation process should also report the presence of errors in the source program.
Source Program | → | Compiler | → | Target Program |
↓ | ||||
Error Messages |
There are two parts of compilation.
The analysis part breaks up the source program into constant piece and creates an intermediate representation of the source program.
The synthesis part constructs the desired target program from the intermediate representation.
Phases of CompilerThe compiler has a number of phases plus symbol table manager and an error handler.
The cousins of the compiler are
The front end includes all analysis phases end the intermediate code generator.
The back end includes the code optimization phase and final code generation phase.
The front end analyzes the source program and produces intermediate code while the back end synthesizes the target program from the intermediate code.
A naive approach (front force) to that front end might run the phases serially.
Input Source Program | ||||
↓ | ||||
Lexical Analyzer | ||||
↓ | ||||
Syntax Analyzer | ||||
↓ | ||||
Symbol Table Manager | Semantic Analyzer | Error Handler | ||
↓ | ||||
Intermediate Code Generator | ||||
↓ | ||||
Code Optimizer | ||||
↓ | ||||
Code Generator | ||||
↓ | ||||
Out Target Program |
- Preprocessor.
- Assembler.
- Loader and Link-editor.
The front end includes all analysis phases end the intermediate code generator.
The back end includes the code optimization phase and final code generation phase.
The front end analyzes the source program and produces intermediate code while the back end synthesizes the target program from the intermediate code.
A naive approach (front force) to that front end might run the phases serially.
- Lexical analyzer takes the source program as an input and produces a long string of tokens.
- Syntax Analyzer takes an out of lexical analyzer and produces a large tree.
- Semantic analyzer takes the output of syntax analyzer and produces another tree.
- Similarly, intermediate code generator takes a tree as an input produced by semantic analyzer and produces intermediate code.
- Requires enormous amount of space to store tokens and trees.
- Very slow since each phase would have to input and output to and from temporary disk
- use syntax directed translation to inter leaves the actions of phases.
- Compiler construction tools.
- Parser Generators:
- The specification of input based on regular expression. The organization is based on finite automation.
- Scanner Generator:
- The specification of input based on regular expression. The organization is based on finite automation.
- Syntax-Directed Translation:
- It walks the parse tee and as a result generate intermediate code.
- Automatic Code Generators:
- Translates intermediate rampage into machine language.
- Data-Flow Engines:
- It does code optimization using data-flow analysis.
No comments:
Post a Comment