Translators

Question 1

Different types of Translators

Answer 1

1) Compiler
2) Interpreter
3) Assembler

Question 2

Purpose of Translators

Answer 2

Convert from source code ……to object code. Detect errors in source code.

Question 3

Compiler

Answer 3

Translates whole program as a unit. Uses high-level source code. Gives list of errors at end of compilation. Creates an executable program or intermediate program when program is completed. Protects program from malicious use. They are architecture specific Can carry out optimisation which improves program speed and size. Compiler is no longer needed once executable code is produced.

Question 4

Interpreter

Answer 4

Translates and executes one line at a time. Uses high-level source code. Reports errors as they are found one at a time. Interpreter must be present each time program is run. Program runs more slowly due to translation

Question 5

Assembler

Answer 5

Translates whole program as a unit. Uses low-level source code. Gives list of errors at end of assembly.

Question 6

Advantages - Compilers

Answer 6

Results in an executable code that requires no further translation. Therefore compiled progs execute faster than interpreted.

Question 7

Disadvantages - Compilers

Answer 7

Use a lot of computer resources. Has to be loaded in the computer’s memory at the same time as the source code and there has to be sufficient memory to hold the object code. Has to be sufficient memory for working storage while the translation is taking place. Errors in the original program are difficult to pin-point.

Question 8

Advantages - Interpreters

Answer 8

Need less memory than compilers (useful in early computers - limited power and memory). Continual compilation of whole code is wasteful during testing particularly if very minor changes have been made. As each error message is produced on the line where the error was encountered, it is easier to identify the instruction causing the problem. Individual segments can be run without needing compile the whole program.

Question 9

Disadvantages-Interpreters

Answer 9

Slower execution (compared to compiled) as the original program has to be translated every time it is executed. Instructions inside a loop have to be translated each time the loop is entered.

Question 10

Interpreter error handling

Answer 10

Interpreter stops at first error, an error message is produced, error would be corrected, program can restart from any point, this is repeated until all errors are removed when program will run.

Question 11

Source code

Answer 11

The original code written by the programmer. Often in a high-level language. May be in assembly language. Source code can be understood by people…but cannot be executed (until translated).

Question 12

Object code

Answer 12

Could be machine code or intermediate code.

Question 13

Machine code

Answer 13

Binary notation (in executable form). Set of all instructions available. Instructions operate on bytes of data. Is dependent on architecture / processor design.

Question 14

Intermediate code

Answer 14

Simplified code which is partly translated. Can run on a variety of computers using an interpreter. This improves portability. The same intermediate code can be obtained from different high level languages. It is used in a virtual machine e.g. Java.

Question 15

Adv of Intermediate code

Answer 15

Allows sections of program to be written in different HLL. Platform independent so improves portability. Compiled - error free

Question 16

Disad of Intermediate code

Answer 16

Program runs more slowly than executable code because it has to be translated each time it is run. Need additional software e.g. interpreter or virtual machine.

Question 17

Virtual machine

Answer 17

Intermediate code is run using an interpreter (for the specific computer).

Question 18

Why compile to mach code

Answer 18

Compiled program is executable, they run quickly, do not need a translator to run the program, uses less memory.

Question 19

Assembly Language

Answer 19

Related closely to the computer being programmed. Low level language so machine specific. Uses descriptive names (for data stores), mnemonics (for instructions), labels to allow branching (selection). Each instruction is generally translated into one machine code instruction. Translated by an assembler. Typically used for writing drivers / easier than mc, but harder than HLL.

Question 20

Assemblers

Answer 20

Translate a program from assembly language into machine code. One assembly language instruction is (generally) changed into one machine code instruction.

Question 21

Assemblers - tasks

Answer 21

Reserves storage for instructions and data. Replaces mnemonic opcodes by machine codes. Replaces symbolic addresses by numeric addresses. Creates symbol table to match labels to addresses. Checks syntax and offers diagnostics for errors.

Question 22

Library Routines

Answer 22

Are pieces of software which perform common tasks such as sorting and searching. Library routines are compiled.

Question 23

Library Routines – why?

Answer 23

To perform common tasks. They are error free and tested. Ready to use, saves work and time. May be used multiple times
May have been written in a different source language. Use other programmers’ expertise.

Question 24

Use of Library Routines

Answer 24

Requires use of platform dependent utility programs – Linker and Loader.

Question 25

Linker

Answer 25

Is used…to combines modules / library routines…that are already compiled / in object code / in executable form…with program by completing address links to program.

Question 26

Loader

Answer 26

Copies modules into memory…from backing store…when program is to be run. It handles addresses ready for execution

Question 27

Linking errors

Answer 27

Occur when a compiled program is linked to library routines. E.g. if a particular subroutine is not present in the library or the number of parameters provided is wrong.

Question 28

Compiled code may not be executable

Answer 28

As it may need to be linked to library routines. e.g. library for I/O routines or for mathematical functions. It may create intermediate code…i.e. code for a virtual machine …depends on language used

Question 29

Compilation

Answer 29

Source Code → Lexical Analysis → Output from lexical analysis → Syntax Analysis → Output from syntax analysis → Code Generation and Optimisation → Machine code.

Question 30

Lexical analysis

Answer 30

Source code is used as input. Reserved words are replaced by tokens. A token is a string of binary digits of fixed length. Variable names are checked and entered in the symbol table. Constants are entered in the symbol table. Data type/space required is entered in the symbol table. Error reporting occurs. Unnecessary characters (white space, comments) are removed / program is formatted ready for the next stage (syntax analysis).

Question 31

Syntax analysis

Answer 31

Accepts output from lexical analysis. Statements, arithmetic expressions and tokens are checked against the rules of the language e.g. matching brackets . The parser checks the tokens generated by the lexical analyser to see if they are grammatically correct. Parse trees are generated (from which machine/executable/intermediate code can be generated). Further detail is added to the symbol table e.g. data type / scope / address. Errors are reported…as a list at the end of compilation to alert the programmer. Some reported errors may be spurious (not being what it purports to be; false or fake.) if no errors, code is passed to the code generator.

Question 32

Example Syntax Errors

Answer 32

Missing the end statement in a selection or iteration construct. E.g. missing closing part of a loop statement – Next i. E.g. missing closing part of an IF statement – End If.

Question 33

Code generation…

Answer 33

Occurs after syntax analysis and is the last phase of compilation. Produces machine code program, executable or intermediate code which is equivalent to the source program. Variables and constants are given addresses. Relative addresses are calculated.

Question 34

and optimisation

Answer 34

Makes code as efficient as possible. Improves processing speed. Reduces number of instructions. Programmer can choose between speed and size.