Compiler 3.2

transcript

Compiler 3.2

A Level computing

So, Sir what is a compiler?

S ou rce P rog ram C om p ile r O b jec t P rog ram

The Structure of a Compiler

Source Tokens

Interm.Language

Lexicalanalysis

Parsing

CodeGen.

MachineCode

Today we start

Optimization

Lexical Analysis (scanner)

• Scanner reads characters from the source program• Scanner groups the characters into lexemes • The scanner is called by parser• Each lexeme corresponds to a token• Example:

if (i == j)z = 0;

elsez = 1;

• The input is just a sequence of characters:\tif (i == j)\n\t\tz = 0;\n\t\telse\n\t\tz = 1;

lexemes

Sir, what the hell then you mean by Token and Lexeme ?

A token is a syntactic category– In English:

noun, verb, adjective, …

– In a programming language:Identifier, Integer, Keyword, Whitespace, …

– Given the source code I = I + rate * 60;A Java scanner would return the following

sequence of tokens…

IDENT ASSIGN IDENT PLUS IDENT TIMES INT-LIT SEMI-COLON

tokens

The Parser

• Group of tokens into “grammatical phrases”, discovering the underlying structure of the source program

• Finds syntax errors. For example, in java source code

• I = * 5;Corresponds to the following sequence of

tokensIDENT ASSIGN TIMES INT-LIT SEMI COLON

All are legal tokens, but sequence of token is erroneous.

Once again Sir, what the hell does the parser do finally?

• Might find some “static semantic” errors, e.g., use of an undeclared variable, or operands that are wrongly used with variables.

• Might generate code, or build some intermediate representation of the program such as an abstract-syntax tree.

num num+

( )*num

<expr>

<expr>

num ‘*’ ‘(‘ num ‘+’ num ‘)’

Syntax Analyzer (Parser)

Semantic Analyzer

Consider the Source code: I = I + rate * 60; =

(float) I + (float)

(float) I + (float) rate* 60

(float) rate * 60 (int)

The semantic analyzer checks for more “static semantic” errors. It may also annotate and or change the abstract syntax tree.

The Intermediate Code Generator

• The ICG translates from abstract-syntax tree to intermediate code. One possibility is 3-address code.

• Example: temp1 = 60 temp2 = rate * temp1 temp3 = I + temp2

I = temp3

The Optimizer

• The Optimizer tries to improve code generated by the intermediate code generator. The optimizer may also try to reduce the code smaller

• So.. The previous intermediate code thus becomes

temp2 = rate * temp1 I = I + temp2

The Code Generator generates object code finally from the (optimized) intermediate code.Example:

sumcalc: xorl %r8d, %r8d

xorl %ecx, %ecx movl %edx, %r9d cmpl %edx, %r8d jg .L7 sall $2, %edi.L5: movl %edi, %eax cltd idivl %esi leal 1(%rcx), %edx movl %eax, %r10d imull %ecx, %r10d movl %edx, %ecx imull %edx, %ecx leal (%r10,%rcx), %eax movl %edx, %ecx addl %eax, %r8d cmpl %r9d, %edx jle .L5.L7: movl %r8d, %eax ret

int sumcalc(int a, int b, int N){ int i;

int x, t, u, v; x = 0;

u = ((a<<2)/b); v = 0;

for(i = 0; i <= N; i++) { t = i+1;

x = x + v + t*t; v = v + u;

} return x;}

S ou rce P rog ram C om p ile r O b jec t P rog ram

So what?

So the compiler converts the source program into object program. When doing this process of converting (source to object) it takes the sources code and passes it to different stages: lexical analysis, which reads the source Code character by character and coins it to form the lexemes and these lexemes then are framed into bits of tokens which are then called by Parser. The parser then groups these token into meaningful “grammatical phrases”, finds syntax errors if any and then built a intermediate representation of the program as an “abstract-syntax” tree. This now is passed through another process called Semantic analyzer, which further annotates and augments the “abstract-syntax tree”. Now this “abstract-syntax” tree is translated to an intermediate code by the Intermediate Code Generator. The outcome of the Intermediate code is further optimized by Optimizer. The optimizer can further simplify the codes and passes it to the Code Generator, which generates the desired Object code. These object code are then linked by the linkers and loaded into the memory for execution by the loader.

Anatomy of a Computer Step by Step (We shall see what happens)

Lexical Analyzer (Scanner)

Token Stream

Program (character stream)Lexical Analyzer (Scanner)

Token Stream

Program (character stream)

Num(234) mul_op lpar_op Num(11) add_op rpar_op

2 3 4 * ( 1 1 + - 2 2 )

Num(-22)

18..23 + val#ue

Num(234) mul_op lpar_op Num(11) add_op rpar_op

2 3 4 * ( 1 1 + - 2 2 )

Num(-22)

Not a number Variable names cannot have ‘#’ character

Anatomy of a Computer

Syntax Analyzer (Parser)Token Stream

Parse Tree

num num+

( )*num

<expr>

<expr>

num ‘*’ ‘(‘ num ‘+’ num ‘)’

int * foo(i, j, k))

int i;

int j;

for(i=0; i j) {

fi(i>j)

return j;

Extra parentheses

Missing increment

Not an expression

Not a keyword

Intermediate Representation

Semantic Analyzer

Parse Tree

Semantic AnalyzerParse Tree

Semantic Analyzer

int * foo(i, j, k)

int i;

int j;

int x;

x = x + j + N;

return j;

Type not declared

Mismatched return type

Uninitialized variable used

Undeclared variable

Code Optimizer

Optimized Intermediate Representation

Semantic Analyzer

Parse Tree

Code Optimizer

Optimized Intermediate Representation

Optimizer

int x, t, u, v; x = 0; u = ((4*a)b*i); v = 0; for(i = 0; i <= N; i++) { t = i+1; x = x + u + t*t;

} return x;}

int sumcalc(int a, int b, int N)

int i;

int x, y;

x = 0;

y = 0;

for(i = 0; i <= N; i++) {

x = x+4*a/b*i+(i+1)*(i+1);

return x;

Code Optimizer

Code GeneratorOptimized Intermediate Representation

Assembly code

Semantic Analyzer

Parse Tree

Code GeneratorOptimized Intermediate Representation

Assembly code

Code Generator

sumcalc: xorl %r8d, %r8d

xorl %ecx, %ecx movl %edx, %r9d cmpl %edx, %r8d jg .L7 sall $2, %edi.L5: movl %edi, %eax cltd idivl %esi leal 1(%rcx), %edx movl %eax, %r10d imull %ecx, %r10d movl %edx, %ecx imull %edx, %ecx leal (%r10,%rcx), %eax movl %edx, %ecx addl %eax, %r8d cmpl %r9d, %edx jle .L5.L7: movl %r8d, %eax ret

int x, t, u, v; x = 0;

u = ((a<<2)/b); v = 0;

for(i = 0; i <= N; i++) { t = i+1;

x = x + v + t*t; v = v + u;

} return x;}

Compiler 3.2

Documents