1.2.2 Applications Generation

Question 1

Lexical analysis

Answer 1

White space and comments are removed.

The keywords and identifiers are replaced with tokens and they are stored with each keyword in a symbol table

Question 2

Syntax Analysis

Answer 2

Abstract tree is produced, which is a representation of the source code in the form of a tree
Errors generated if token break any rules of the language.
Errors are reported as a list
Error diagnostic is given

Question 3

Machine Code Generator

Answer 3

Abstract syntax tree is converted to produce object code which is the machine code before final step

Question 4

Optimisation

Answer 4

Tweaks the code so it will run as quickly and use as little memory as possible. Redundant parts of the code are detected and removed.

Question 5

Linkers

Answer 5

Piece of software responsible for linking external modules and libraries within code

Question 6

Dynamic Linker

Answer 6

The loader retrieves the program when the program is run (files remain small and updates automatically)

Question 7

Loaders

Answer 7

Program provided by the OS. When a file is executed, the loader retrieves the library from given memory location

Question 8

Libraries

Answer 8

Precompiled programs that can be incorporated within other programs.
They are ready to use and error-free so saving development time and testing modules.
It can be reused in many programs.

Question 9

Utility

Answer 9

Performs a specific task relating to the upkeep of the OS ie disk defragmentation

Question 10

Translators

Answer 10

Program that converts high- level code into low level object code ready to be executed.

Question 11

Compiler

Answer 11

Translate high level code into machine code all at once.

Question 12

Interpreter

Answer 12

Translate and execute code line by line. They stop to produce an error if a line contains an error.

Question 13

Assembler

Answer 13

Next level from machine code is platform specific as instructions used are independent on instruction set of processor.