Presentation is loading. Please wait.

Presentation is loading. Please wait.

Saman Amarasinghe 16.035 ©MIT Fall 1998 Outline Course Administration Information Introduction to computer language engineering –What are compilers? –

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Saman Amarasinghe 16.035 ©MIT Fall 1998 Outline Course Administration Information Introduction to computer language engineering –What are compilers? –"— Presentation transcript:

1 Saman Amarasinghe 16.035 ©MIT Fall 1998 Outline Course Administration Information Introduction to computer language engineering –What are compilers? – Why should we learn about them? –Anatomy of a compiler

2 Saman Amarasinghe 26.035 ©MIT Fall 1998 Optional Textbooks Modern Compiler Implementation in Java by A.W. Appel Cambridge University Press, 1998 Advanced Compiler Design and Implementation by Steven Muchnick Morgan Kaufman Publishers, 1997 Compilers -- Principles, Techniques and Tools by Aho, Sethi and Ullman Addison-Wesley, 1988 Tiger Book Whale Book Dragon Book

3 Saman Amarasinghe 36.035 ©MIT Fall 1998 The Five Segments  Lexical and Syntax Analysis  Semantic Analysis  Code Generation  Data-flow Optimizations  Instruction Optimizations

4 Saman Amarasinghe 46.035 ©MIT Fall 1998 What is Computer Language Engineering 1. How to give instructions to a computer 2. How to make the computer carryout the instructions efficiently

5 Saman Amarasinghe 56.035 ©MIT Fall 1998 Power of a Language Can use to describe any action –Not tied to a “context” Many ways to describe the same action –Flexible

6 Saman Amarasinghe 66.035 ©MIT Fall 1998 How to instruct a computer How about natural languages? –E–English?? –“–“Open the pod bay doors, Hal.” –“–“I am sorry Dave, I am afraid I cannot do that” –W–We are not there yet!! Natural Languages: –S–Same expression describes many possible actions –A–Ambiguous

7 Saman Amarasinghe 76.035 ©MIT Fall 1998 How to instruct a computer How about natural languages? –English?? –“Open the pod bay doors, Hal.” –“I am sorry Dave, I am afraid I cannot do that” –We are not there yet!! Use a programming language –Examples: Java, C, C++, Pascal, BASIC, Scheme

8 Saman Amarasinghe 86.035 ©MIT Fall 1998 Programming Languages Properties –need to be unambiguous –need to be precise –need to be concise –need to be expressive –need to be at a high-level (lot of abstractions)

9 Saman Amarasinghe 96.035 ©MIT Fall 1998 High-level Abstract Description to Low-level Implementation Details Foot Soldier President My poll ratings are low, lets invade a small nation General Cross the river and take defensive positions Sergeant Forward march, turn left Stop!, Shoot

10 Saman Amarasinghe 106.035 ©MIT Fall 1998 1. How to instruct the computer Compiler Assembly Language Translation Microprocessors talk in assembly language –Low-level Implementation Details Program written in a Programming Languages Write a program using a programming language – High-level Abstract Description

11 Saman Amarasinghe 116.035 ©MIT Fall 1998 1. How to instruct the computer Input: High-level programming language Output: Low-level assembly instructions Compiler has to: –Read and understand the program –Precisely determine what actions it require –Figure-out how to carry-out those actions –Instruct the computer to carry out those actions

12 Saman Amarasinghe 126.035 ©MIT Fall 1998 Example (input program) int expr(int n) { int d; d = 4 * n * n * (n + 1) * (n + 1); return d; }

13 Saman Amarasinghe 136.035 ©MIT Fall 1998 Example (Output assembly code) lda $30,-32($30) stq $26,0($30) stq $15,8($30) bis $30,$30,$15 bis $16,$16,$1 stl $1,16($15) lds $f1,16($15) sts $f1,24($15) ldl $5,24($15) bis $5,$5,$2 s4addq $2,0,$3 ldl $4,16($15) mull $4,$3,$2 ldl $3,16($15) addq $3,1,$4 mull $2,$4,$2 ldl $3,16($15) addq $3,1,$4 mull $2,$4,$2 stl $2,20($15) ldl $0,20($15) br $31,$33 $33: bis $15,$15,$30 ldq $26,0($30) ldq $15,8($30) addq $30,32,$30 ret $31,($26),1

14 Saman Amarasinghe 146.035 ©MIT Fall 1998 Efficient Execution of the Actions Foot Soldier General Cross the river and take defensive positions Sergeant

15 Saman Amarasinghe 156.035 ©MIT Fall 1998 Efficient Execution of the Actions Foot Soldier General Cross the river and take defensive positions Sergeant Where to cross the river? Use the bridge upstream or surprise the enemy by crossing downstream? How do I minimize the casualties??

16 Saman Amarasinghe 166.035 ©MIT Fall 1998 Efficient Execution of the Actions President My poll ratings are low, lets invade a small nation General Russia or Bermuda? Or just stall for his poll numbers to go up?

17 Saman Amarasinghe 176.035 ©MIT Fall 1998 Efficient Execution of the Actions Mapping from High to Low –Simple mapping of a program to assembly language produces inefficient execution –Higher the level of abstraction  more inefficiency If not efficient –High-level abstractions are useless Need to: –provide a high level abstraction –with performance of giving low-level instructions

18 Saman Amarasinghe 186.035 ©MIT Fall 1998 Example 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); x = x + b*y; } return x; }

19 Saman Amarasinghe 196.035 ©MIT Fall 1998 test: subu $fp, 16 sw zero, 0($fp)# x = 0 sw zero, 4($fp)# y = 0 sw zero, 8($fp)# i = 0 lab1:# for(i=0;i<N; i++) mul $t0, $a0, 4# a*4 div $t1, $t0, $a1# a*4/b lw $t2, 8($fp)# i mul $t3, $t1, $t2# a*4/b*i lw $t4, 8($fp)# i addui$t4, $t4, 1# i+1 lw $t5, 8($fp)# i addui$t5, $t5, 1# i+1 mul $t6, $t4, $t5# (i+1)*(i+1) addu $t7, $t3, $t6# a*4/b*i + (i+1)*(i+1) lw $t8, 0($fp)# x add $t8, $t7, $t8# x = x + a*4/b*i + (i+1)*(i+1) sw $t8, 0($fp) lw $t0, 4($fp)# y mul $t1, $t0, a1# b*y lw $t2, 0($fp)# x add $t2, $t2, $t1# x = x + b*y sw $t2, 0($fp) lw $t0, 8($fp)# i addui$t0, $t0, 1# i+1 sw $t0, 8($fp) ble $t0, $a3, lab1 lw $v0, 0($fp) addu $fp, 16 b $ra 45

20 Saman Amarasinghe 206.035 ©MIT Fall 1998 Lets Optimize... 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); x = x + b*y; } return x; }

21 Saman Amarasinghe 216.035 ©MIT Fall 1998 Constant Propagation 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); x = x + b*y; } return x; }

22 Saman Amarasinghe 226.035 ©MIT Fall 1998 Constant Propagation 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); x = x + b*y; } return x; }

23 Saman Amarasinghe 236.035 ©MIT Fall 1998 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); x = x + b*y; } return x; } Constant Propagation

24 Saman Amarasinghe 246.035 ©MIT Fall 1998 Constant Propagation 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); x = x + b*y; } return x; }

25 Saman Amarasinghe 256.035 ©MIT Fall 1998 Constant Propagation 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); x = x + b*0; } return x; }

26 Saman Amarasinghe 266.035 ©MIT Fall 1998 Algebraic Simplification 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); x = x + b*0; } return x; }

27 Saman Amarasinghe 276.035 ©MIT Fall 1998 Algebraic Simplification 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); x = x + b*0; } return x; }

28 Saman Amarasinghe 286.035 ©MIT Fall 1998 Algebraic Simplification 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); x = x + 0; } return x; }

29 Saman Amarasinghe 296.035 ©MIT Fall 1998 Algebraic Simplification 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); x = x + 0; } return x; }

30 Saman Amarasinghe 306.035 ©MIT Fall 1998 Algebraic Simplification 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); x = x + 0; } return x; }

31 Saman Amarasinghe 316.035 ©MIT Fall 1998 Algebraic Simplification 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); x = x; } return x; }

32 Saman Amarasinghe 326.035 ©MIT Fall 1998 Copy Propagation 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); x = x; } return x; }

33 Saman Amarasinghe 336.035 ©MIT Fall 1998 Copy Propagation 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; }

34 Saman Amarasinghe 346.035 ©MIT Fall 1998 Common Subexpression Elimination 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; }

35 Saman Amarasinghe 356.035 ©MIT Fall 1998 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; } Common Subexpression Elimination

36 Saman Amarasinghe 366.035 ©MIT Fall 1998 int sumcalc(int a, int b, int N) { int i; int x, y, t; x = 0; y = 0; for(i = 0; i <= N; i++) { t = i+1; x = x + (4*a/b)*i + (i+1)*(i+1); } return x; } Common Subexpression Elimination

37 Saman Amarasinghe 376.035 ©MIT Fall 1998 int sumcalc(int a, int b, int N) { int i; int x, y, t; x = 0; y = 0; for(i = 0; i <= N; i++) { t = i+1; x = x + (4*a/b)*i + t*t; } return x; } Common Subexpression Elimination

38 Saman Amarasinghe 386.035 ©MIT Fall 1998 Dead Code Elimination int sumcalc(int a, int b, int N) { int i; int x, y, t; x = 0; y = 0; for(i = 0; i <= N; i++) { t = i+1; x = x + (4*a/b)*i + t*t; } return x; }

39 Saman Amarasinghe 396.035 ©MIT Fall 1998 Dead Code Elimination int sumcalc(int a, int b, int N) { int i; int x, y, t; x = 0; y = 0; for(i = 0; i <= N; i++) { t = i+1; x = x + (4*a/b)*i + t*t; } return x; }

40 Saman Amarasinghe 406.035 ©MIT Fall 1998 Dead Code Elimination int sumcalc(int a, int b, int N) { int i; int x, y, t; x = 0; for(i = 0; i <= N; i++) { t = i+1; x = x + (4*a/b)*i + t*t; } return x; }

41 Saman Amarasinghe 416.035 ©MIT Fall 1998 Dead Code Elimination int sumcalc(int a, int b, int N) { int i; int x, t; x = 0; for(i = 0; i <= N; i++) { t = i+1; x = x + (4*a/b)*i + t*t; } return x; }

42 Saman Amarasinghe 426.035 ©MIT Fall 1998 Loop Invariant Removal int sumcalc(int a, int b, int N) { int i; int x, t; x = 0; for(i = 0; i <= N; i++) { t = i+1; x = x + (4*a/b)*i + t*t; } return x; }

43 Saman Amarasinghe 436.035 ©MIT Fall 1998 Loop Invariant Removal int sumcalc(int a, int b, int N) { int i; int x, t; x = 0; for(i = 0; i <= N; i++) { t = i+1; x = x + (4*a/b)*i + t*t; } return x; }

44 Saman Amarasinghe 446.035 ©MIT Fall 1998 Loop Invariant Removal int sumcalc(int a, int b, int N) { int i; int x, t, u; x = 0; u = (4*a/b); for(i = 0; i <= N; i++) { t = i+1; x = x + u*i + t*t; } return x; }

45 Saman Amarasinghe 456.035 ©MIT Fall 1998 Strength Reduction int sumcalc(int a, int b, int N) { int i; int x, t, u; x = 0; u = (4*a/b); for(i = 0; i <= N; i++) { t = i+1; x = x + u*i + t*t; } return x; }

46 Saman Amarasinghe 466.035 ©MIT Fall 1998 Strength Reduction int sumcalc(int a, int b, int N) { int i; int x, t, u; x = 0; u = (4*a/b); for(i = 0; i <= N; i++) { t = i+1; x = x + u*i + t*t; } return x; } u*0, u*1, u*2, u*3, u*4,... v=0, v=v+u,...

47 Saman Amarasinghe 476.035 ©MIT Fall 1998 Strength Reduction int sumcalc(int a, int b, int N) { int i; int x, t, u, v; x = 0; u = (4*a/b); v = 0; for(i = 0; i <= N; i++) { t = i+1; x = x + u*i + t*t; v = v + u; } return x; }

48 Saman Amarasinghe 486.035 ©MIT Fall 1998 Strength Reduction int sumcalc(int a, int b, int N) { int i; int x, t, u, v; x = 0; u = (4*a/b); v = 0; for(i = 0; i <= N; i++) { t = i+1; x = x + v + t*t; v = v + u; } return x; }

49 Saman Amarasinghe 496.035 ©MIT Fall 1998 Strength Reduction int sumcalc(int a, int b, int N) { int i; int x, t, u, v; x = 0; u = (4*a/b); v = 0; for(i = 0; i <= N; i++) { t = i+1; x = x + v + t*t; v = v + u; } return x; }

50 Saman Amarasinghe 506.035 ©MIT Fall 1998 Strength Reduction int sumcalc(int a, int b, int N) { int i; int x, t, u, v; x = 0; u = (4*a/b); v = 0; for(i = 0; i <= N; i++) { t = i+1; x = x + v + t*t; v = v + u; } return x; }

51 Saman Amarasinghe 516.035 ©MIT Fall 1998 Strength Reduction 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; }

52 Saman Amarasinghe 526.035 ©MIT Fall 1998 Register Allocation fp Local variable X Local variable Y Local variable I

53 Saman Amarasinghe 536.035 ©MIT Fall 1998 Register Allocation $t9 = X $t8 = t $t7 = u $t6 = v $t5 = i fp Local variable X Local variable Y Local variable I

54 Saman Amarasinghe 546.035 ©MIT Fall 1998 Optimized Example 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; }

55 Saman Amarasinghe 556.035 ©MIT Fall 1998 test: subu $fp, 16 add $t9, zero, zero# x = 0 sll $t0, $a0, 2# a<<2 div $t7, $t0, $a1# u = (a<<2)/b add $t6, zero, zero# v = 0 add $t5, zero, zero# i = 0 lab1:# for(i=0;i<N; i++) addui$t8, $t5, 1# t = i+1 mul $t0, $t8, $t8# t*t addu $t1, $t0, $t6# v + t*t addu $t9, t9, $t1# x = x + v + t*t addu $6, $6, $7# v = v + u addui$t5, $t5, 1# i = i+1 ble $t5, $a3, lab1 addu $v0, $t9, zero addu $fp, 16 b $ra

56 Saman Amarasinghe 566.035 ©MIT Fall 1998 test: subu $fp, 16 add $t9, zero, zero sll $t0, $a0, 2 div $t7, $t0, $a1 add $t6, zero, zero add $t5, zero, zero lab1: addui $t8, $t5, 1 mul $t0, $t8, $t8 addu $t1, $t0, $t6 addu $t9, t9, $t1 addu $6, $6, $7 addui $t5, $t5, 1 ble $t5, $a3, lab1 addu $v0, $t9, zero addu $fp, 16 b $ra test: subu $fp, 16 sw zero, 0($fp) sw zero, 4($fp) sw zero, 8($fp) lab1: mul $t0, $a0, 4 div $t1, $t0, $a1 lw $t2, 8($fp) mul $t3, $t1, $t2 lw $t4, 8($fp) addui $t4, $t4, 1 lw $t5, 8($fp) addui $t5, $t5, 1 mul $t6, $t4, $t5 addu $t7, $t3, $t6 lw $t8, 0($fp) add $t8, $t7, $t8 sw $t8, 0($fp) lw $t0, 4($fp) mul $t1, $t0, a1 lw $t2, 0($fp) add $t2, $t2, $t1 sw $t2, 0($fp) lw $t0, 8($fp) addui $t0, $t0, 1 sw $t0, 8($fp) ble $t0, $a3, lab1 lw $v0, 0($fp) addu $fp, 16 b $ra 4*ld/st + 2*add/sub + br + N*(9*ld/st + 6*add/sub + 4* mul + div + br) = 7 + N*21 6*add/sub + shift + div + br + N*(5*add/sub + mul + br) = 9 + N*7 Unoptimized CodeOptimized Code Execution time = 17 secExecution time = 43 sec

57 Saman Amarasinghe 576.035 ©MIT Fall 1998 Compilers Optimize Programs for… Performance/Speed Code Size Power Consumption Fast/Efficient Compilation Security/Reliability Debugging

58 Saman Amarasinghe 586.035 ©MIT Fall 1998 Compilers help increase the level of abstraction Programming languages –From C to OO-languages with garbage collection –Even more abstract definitions Microprocessor –From simple CISC to RISC to VLIW to ….

59 Saman Amarasinghe 596.035 ©MIT Fall 1998 Anatomy of a Computer Program written in a Programming Languages Assembly Language Translation Compiler

60 Saman Amarasinghe 606.035 ©MIT Fall 1998 Anatomy of a Computer Lexical Analyzer (Scanner) Token Stream Program (character stream) Lexical Analyzer (Scanner) Token Stream Program (character stream)

61 Saman Amarasinghe 616.035 ©MIT Fall 1998 Lexical Analyzer (Scanner) 18..23 + val#ue Num(234)mul_oplpar_opNum(11)add_oprpar_op 2 34 *(11 +-22) Num(-22)

62 Saman Amarasinghe 626.035 ©MIT Fall 1998 Lexical Analyzer (Scanner) 18..23 + val#ue Num(234)mul_oplpar_opNum(11)add_oprpar_op 2 34 *(11 +-22) Num(-22) Not a number Variable names cannot have ‘#’ character

63 Saman Amarasinghe 636.035 ©MIT Fall 1998 Anatomy of a Computer Lexical Analyzer (Scanner) Syntax Analyzer (Parser) Token Stream Parse Tree Program (character stream) Syntax Analyzer (Parser) Token StreamParse Tree

64 Saman Amarasinghe 646.035 ©MIT Fall 1998 Syntax Analyzer (Parser) num + ()* num ‘*’ ‘(‘ num ‘+’ num ‘)’

65 Saman Amarasinghe 656.035 ©MIT Fall 1998 Syntax Analyzer (Parser) 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 expressionNot a keyword

66 Saman Amarasinghe 666.035 ©MIT Fall 1998 Anatomy of a Computer Intermediate Representation Semantic Analyzer Lexical Analyzer (Scanner) Syntax Analyzer (Parser) Token Stream Parse Tree Program (character stream) Intermediate Representation Semantic Analyzer Parse Tree

67 Saman Amarasinghe 676.035 ©MIT Fall 1998 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

68 Saman Amarasinghe 686.035 ©MIT Fall 1998 Anatomy of a Computer Code Optimizer Optimized Intermediate Representation Intermediate Representation Semantic Analyzer Lexical Analyzer (Scanner) Syntax Analyzer (Parser) Token Stream Parse Tree Program (character stream) Code Optimizer Optimized Intermediate RepresentationIntermediate Representation

69 Saman Amarasinghe 696.035 ©MIT Fall 1998 Optimizer 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; } 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); x = x + b*y; } return x; }

70 Saman Amarasinghe 706.035 ©MIT Fall 1998 Anatomy of a Computer Code Optimizer Code Generator Optimized Intermediate Representation Assembly code Intermediate Representation Semantic Analyzer Lexical Analyzer (Scanner) Syntax Analyzer (Parser) Token Stream Parse Tree Program (character stream) Code Generator Optimized Intermediate RepresentationAssembly code

71 Saman Amarasinghe 716.035 ©MIT Fall 1998 Code Generator test: subu $fp, 16 add $t9, zero, zero sll $t0, $a0, 2 div $t7, $t0, $a1 add $t6, zero, zero add $t5, zero, zero lab1: addui $t8, $t5, 1 mul $t0, $t8, $t8 addu $t1, $t0, $t6 addu $t9, t9, $t1 addu $6, $6, $7 addui $t5, $t5, 1 ble $t5, $a3, lab1 addu $v0, $t9, zero addu $fp, 16 b $ra 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; }

Download ppt "Saman Amarasinghe 16.035 ©MIT Fall 1998 Outline Course Administration Information Introduction to computer language engineering –What are compilers? –"

Similar presentations

Programming Languages Third Edition Chapter 6 Syntax.

Programming Languages Third Edition Chapter 6 Syntax.
Course Outline Traditional Static Program Analysis Software Testing

Course Outline Traditional Static Program Analysis Software Testing
Compilers and Language Translation

Compilers and Language Translation
Introduction to Advanced Topics Chapter 1 Mooly Sagiv Schrierber 317 03-640-7606 www.math.tau.ac.il/~sagiv/courses/acd.html.

Introduction to Advanced Topics Chapter 1 Mooly Sagiv Schrierber
Lecture 01 - Introduction Eran Yahav 1. 2 Who? Eran Yahav Taub 734 Tel: 8294318 Monday 13:30-14:30

Lecture 01 - Introduction Eran Yahav 1. 2 Who? Eran Yahav Taub 734 Tel: Monday 13:30-14:30
Copyright © 2006 The McGraw-Hill Companies, Inc. Programming Languages 2nd edition Tucker and Noonan Chapter 2 Syntax A language that is simple to parse.

Copyright © 2006 The McGraw-Hill Companies, Inc. Programming Languages 2nd edition Tucker and Noonan Chapter 2 Syntax A language that is simple to parse.
Cpeg421-08S/final-review1 Course Review Tom St. John.

Cpeg421-08S/final-review1 Course Review Tom St. John.
Compiler Design Lexical Analysis Syntactical Analysis Semantic Analysis Optimization Code Generation.

Compiler Design Lexical Analysis Syntactical Analysis Semantic Analysis Optimization Code Generation.
From Cooper & Torczon1 Implications Must recognize legal (and illegal) programs Must generate correct code Must manage storage of all variables (and code)

From Cooper & Torczon1 Implications Must recognize legal (and illegal) programs Must generate correct code Must manage storage of all variables (and code)
Overview of Compiler Design CIS 631, CSE 691, CIS400, CSE 400 Compiler Design Dr. Nancy McCracken January 15, 2008.

Overview of Compiler Design CIS 631, CSE 691, CIS400, CSE 400 Compiler Design Dr. Nancy McCracken January 15, 2008.
1 Lecture 7: Computer Arithmetic Today’s topics:  Chapter 2 wrap-up  Numerical representations  Addition and subtraction Reminder: Assignment 3 will.

1 Lecture 7: Computer Arithmetic Today’s topics:  Chapter 2 wrap-up  Numerical representations  Addition and subtraction Reminder: Assignment 3 will.
BİL744 Derleyici Gerçekleştirimi (Compiler Design)1.

BİL744 Derleyici Gerçekleştirimi (Compiler Design)1.
CMPUT 680 - Compiler Design and Optimization1 CMPUT680 - Winter 2006 Topic0: Introduction José Nelson Amaral

CMPUT Compiler Design and Optimization1 CMPUT680 - Winter 2006 Topic0: Introduction José Nelson Amaral
Compiler design Computer Science Rensselaer Polytechnic Lecture 1.

Compiler design Computer Science Rensselaer Polytechnic Lecture 1.
CPSC 388 – Compiler Design and Construction Lecture: MWF 11:00am-12:20pm, Room 106 Colton.

CPSC 388 – Compiler Design and Construction Lecture: MWF 11:00am-12:20pm, Room 106 Colton.
Invitation to Computer Science 5th Edition

Invitation to Computer Science 5th Edition
INTRODUCTION TO COMPUTING CHAPTER NO. 06. Compilers and Language Translation Introduction The Compilation Process Phase 1 – Lexical Analysis Phase 2 –

INTRODUCTION TO COMPUTING CHAPTER NO. 06. Compilers and Language Translation Introduction The Compilation Process Phase 1 – Lexical Analysis Phase 2 –
Chapter 1 Introduction Dr. Frank Lee. 1.1 Why Study Compiler? To write more efficient code in a high-level language To provide solid foundation in parsing.

Chapter 1 Introduction Dr. Frank Lee. 1.1 Why Study Compiler? To write more efficient code in a high-level language To provide solid foundation in parsing.
Chapter 10: Compilers and Language Translation Invitation to Computer Science, Java Version, Third Edition.

Chapter 10: Compilers and Language Translation Invitation to Computer Science, Java Version, Third Edition.
CSC 338: Compiler design and implementation

CSC 338: Compiler design and implementation

Similar presentations

Ads by Google