Computer Science 1.2

Lexical analysis

White space and comments are removed from the code. Remaining code is analysed for keywords and names of variables. These are replaced with token and info about the tokens are stored in a symbol table

Syntax analysis

Tokens are analysed against rules of the programming language. Any tokens breaking the rules are flagged and added to a list of errors. Semantic analysis finds any logic error

Code generation

Abstract syntax tree is used to produce machine code

Optimisation

Insignificant and redundant code is removed. Repeated code is grouped together and replaced with more efficient code

Linkers

Links external modules and libraries included in the code

Static linkers

Libraries are added directly to the file. This increases file size

Dynamic linkers

Library addresses are included in the file when referenced. Loader retrieves program at specified address so it can be executed

Loaders

Retrieves library from a given memory location

Feasibility

Is the problem solvable

Requirements

Working out what the solution needs to do

Analysis and design

working out how the solution needs to do it

Implementation

Coding the solution

Testing

Checking if it works

Deployment

Installing it in the target environment

Evaluation

Checking with the user to see if the solution is complete

Maintenance

Ensuring it continues to function properly

Waterfall lifecycle