Upload File

compilers - james madison university · – cs 327, cs 430 graph algorithms ... def int add(int x,...

  • Home
  • Documents
  • Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar
24
CS 432 Fall 2016 Mike Lam, Professor Compilers Advanced Systems Elective

Upload: others

Post on 24-Jul-2020

6 views

Category:

Documents


0 download

Report

TRANSCRIPT

Page 1: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

CS 432Fall 2016

Mike Lam, Professor

CompilersAdvanced Systems Elective

Page 2: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Discussion question

● What is a compiler?

Page 3: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Automated translation

● A compiler is a computer program thatautomatically translates other programs fromone language to another

Compiler

Programin

SourceLanguage

Programin

TargetLanguage

Page 4: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Automated translation

● Compilation vs. interpretation:

Compiler

Programin

SourceLanguage

Programin

TargetLanguage

Interpreter

Programin

SourceLanguage

Results

Page 5: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Discussion question

● Why should we study compilers?

Page 6: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Compilers: a convergent topic

● Data structures

– CS 240

● Architectures and operating systems

– CS 261, CS 450

● Automata and language theory

– CS 327, CS 430

● Graph algorithms

– CS 327

● Software and systems engineering

– CS 345, CS 361

● Greedy, heuristic, and fixed-point algorithms

– CS 452

Page 7: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Reasons to study compilers

● Shows how many areas of CS can be combined to solvea truly "hard" problem (automated translation)

● Bridges theory vs. implementation gap

– Theory informs implementation

– Applicable in many other domains

● Practical experience with large software systems

– My master copy is currently ~6.3K LOC

● Exposure to open problems in CS

– Many optimization issues are subject to ongoing research

Page 8: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Course goal

● Fundamental question

– "How do compilers translate from a human-readablelanguage to a machine-executable language?"

● After this course, your response should be:

– "It's really cool! Let me tell you..."

Page 9: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Course design theory

● Big ideas

– E.g., "A compiler is a large software system consisting of a sequence ofphases"

● "Enduring understandings" (stuff you should remember in five years)

– E.g, "Large problems (such as automated translation) can sometimes besolved by composing existing solutions to smaller problems."

● Learning objectives

– E.g., "Identify and discuss the technical and social challenges of building alarge software system such as a compiler."

● Activities and assignments flow from learning objectives

– E.g., "Draw a diagram illustrating the major phases of a modern compiler."

● Exams reflect activities and assignments

Page 10: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Course format

● Website: https://w3.cs.jmu.edu/lam2mo/cs432/

● Weekly schedule

– Monday: intro lecture

– Tuesday: initial reading & quiz

– Wednesday: mini-lecture and discussion

– Thursday: detailed reading

– Friday: application activity

● Formative vs. summative assessment

● Goal: engaged learning

Page 11: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Course textbook

● Engineering a Compiler, 2nd Edition

– Keith Cooper and Linda Torczon

● Decaf/ILOC references

– PDFs on website

Page 12: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Semester-long project

● Compiler for "Decaf" language

– Implementation in Java

– Maven build system w/ fully-integrated test suite

– Six projects comprised of "pieces" of the full system

● Submission: code + reflection + review

– Code can be written in teams of two● Benefits vs. costs of working in a team

– Reflection paper must be individual

– Graded code reviews after project submission

Page 13: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Compiler rule #1

● "The compiler must preserve the meaning ofthe program being compiled."

– What is a program's meaning?

Page 14: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Intermediate representation

● Compilers encode a program's meaning usingan intermediate representation (IR)

– Tree- or graph-based: abstract syntax tree (AST),control flow graph (CFG)

– Linear: register transfer language (RTL), Javabytecode, intermediate language for an optimizingcompiler (ILOC)

=

a *

+

b c

d

load b → r1load c → r2add r1, r2 → r3load d → r4mult r3, r4 → r5store r5 → a

Page 15: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Standard compiler framework

● Front end: understand the program (src→IR)

● Back end: encode in target language (IR→targ)

● Primary benefit: easier retargetting to differentlanguages or architectures

CompilerProgram inSource

Language A

Program inTarget

Language 1

Front End Back EndIR

Program inSource

Language B

Program inTarget

Language 1

Page 16: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Modern compiler framework

● Multiple front-end passes

– Lexing/scanning and parsing

– Tree analysis processing

● Multiple middle-end passes

– Local optimizations

– Global optimizations

● Multiple back-end passes

– Instruction selection and scheduling

– Register allocation

– Linking

Compiler

FrontEnd

BackEnd

IR MiddleEnd

IR

Page 17: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Compiler rule #2

● The compiler should help the programmer insome way

– What does help mean?

Page 18: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Discussion question

● As a programmer, what would be the mostimportant design goals for a compiler?

Page 19: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Compiler design goals

● Translate to target language/architecture

● Optimize for fast execution

● Minimize memory use

● Catch software defects early

● Provide helpful error messages

● Run quickly

● Be easily extendable

Page 20: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Differing design goals

● What differences might you expect in compilersdesigned for the following applications?

– A just-in-time compiler for running server-side user scripts

– A compiler used in an introductory programming course

– A compiler used to build scientific computing codes to runon a massively-parallel supercomputer

– A compiler that targets a number of diverse systems

– A compiler that targets an embedded sensor networkplatform

Page 21: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Decaf language

● Simple imperative language similar to C or Java

● Example:

// add.decaf - simple addition example

def int add(int x, int y){ return x + y;}

def int main(){ int a; a = 3; return add(a, 2);}

$ java -jar decaf-1.0.jar -i add.decaf5

Page 22: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Before Wednesday

● Readings

– "Engineering a Compiler" (EAC) Ch. 1 (23 pages)

– Decaf reference ("Resources" page on website)

● Tasks

– Complete first reading quiz on Canvas

– Complete source intro survey on Canvas

– Install Java and Maven on your system

– Download the reference compiler from Canvas ("Files")

Page 23: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

Upcoming events

● CS senior night

– Wednesday, Sept. 14, 5:00-6:30pm

– Graduation info, job fairs, photos, etc.

– Senior students only

● CS career fair

– Monday, Sept. 22, 10:00am-3:00pm

– 8-10 companies looking for CS majors

– Internships and full-time positions

Page 24: Compilers - James Madison University · – CS 327, CS 430 Graph algorithms ... def int add(int x, int y) {return x + y;} def int main() {int a; a = 3; return add(a, 2);} $ java -jar

See you Wednesday

● Have a great semester!


Complexity and Orders of Growth - University of California ...cs61a/su12/lec/week02/lec07-1pp.pdf · 16 ORDERS OF GROWTH def add_one(n): return n + 1 def mul_64(n): return n * 64

1 Overview of C++ CS3304 - Data Structure. 2 Value parameters int abc (int a, int b, int c) // a, b, and c are the { // formal parameters a = a * 2; return

Trends in Programming Languages · Building Languages is easier. ... Scala def apply(f: Int => Int, v: Int) => f(v) Scala. Pattern Matching Easily deconstruct data structures > type

130625 Def Sec Listas Int Ordenados

Monads. foo1 Method to print a string, then return its length: scala> def foo1(bar: String) = { | println(bar) | bar.size | } foo1: (bar: String)Int scala>

int main() { return 0;cs4400/c+representation.pdf#include #include int main(int argc, char** argv) {int a, b; a = atoi(argv[1]); b = atoi(argv[2]);

CS 216 - Labprotocols.netlab.uky.edu/~davidb/cs216/docs/cs216_2.pdfint readVa1ue(istream & is) int iVa1ue; is >> iVa1ue; return iVa1ue; int main(int char * argc, int ilntFromCons01e

Knowledge Base C++ #include using std namespace; int main(){} return 0 ; cout

Grammar - courses.cs.washington.edu · Grammar for D, a little language program::= function-def | program function-def function-def::= int id ( ) {statements} | int id ( parameters)

C++ Named Return Value Optimization · void create( buffer< vector >* ret) {vector castor(1000); new(ret) vector(castor);} pushq %rbx subq $32,

Strlen() implementation /* strlen : return length of string s */ int strlen(char *s) { int n; for (n = 0 ; s[n] != ‘\0’ ; n++) ; return n; } /* strlen

Chapter 6: User-Defined Functions+/6.pdf · 2020. 12. 7. · num = first / 10; else return num + 2; } int discover(int one, int two) { num = first / 20; int secret = 0; for (int i

Recursion. Sum a list of numbers Iterative def sum(L): total = 0 for i in L: total += i return total Recursive def sum(L): if len(L) == 0: return 0 else:

Type Inference def CONS[T](x:T, lst:List[T]):List[T]={...} def listInt() : List[Int] = {...} def listBool() : List[Bool] = {...} def baz(a, b) = CONS(a(b),

What gets printed out? def f(n): if (n == 0): return (" ") else: print(“blug ") return f(n-1) f(3)

Input a number #include using namespace std; int main() { int num; cout num; return 0; }

Def Int Ions for Each Chapter

1 of 51 Interaction public int countCookiesEaten(Bowl bowl) { if (bowl.isEmpty()) { return 0; } else { this.eatCookie(bowl); return this.countCookiesEaten(bowl)

Piano Finale Def Int

Speech; Def Strat & Int Def Coop IDS

INT morton def - Edizioni Piemme

Funciones 2da parte - martinnievas.com · 2/25 #include int func(int a, int b) int res; if (a>b) res=a; else res=b; return res; int main(void) int num1= 10; int

NET 程式設計入門(使用C#) - csie.ntu.edu.twr93057/cs139/ch4.pdf · public static int add(int a, int b) {return a + b;} 44

12 13-18 1 12 13-1810. Connect the DEF pressure (2) and return lines (1) to the DEF dosing unit. 11. Connect the DEF pressure (3) and return line (4) heater electrical connectors at

V1P2 V2 V3 - carmenanton.files.wordpress.com2. Se considerä subprogramul f, aläturat. Ce valoare are f (100) ? int f (int n) definit { if return O; else return n%2+f (n/ 2) ; Functia

1 Chapter 7: Runtime Environments. int * larger (int a, int b) { if (a > b) return &a; //wrong else return &b; //wrong } int * larger (int *a, int *b)

Minnet (=stacken) public static int fac(int n) { if (n == 0) return 1; else return fac(n-1) * n; }..... main(String [] a) { int x; x = fac(3); System.out.println(x);

Red-Black Tree Delete - Yale University€¦ · 08/11/2017  · int foo(int n, int c) if (n == c) return 0; {} int i = 1; while (i < n) if (i % c == 3) if (n % 2 == 1) return 0; {}

VoIP Wars: Return of the SIP - DEF CON 1

1 Cython. 2 Cython by example PYTHON def fib(n): a,b = 0,1 for i in range(n): a, b = a+b, a return a C / C++ int fib(int n) { int tmp, i, a=0, b=1; for(i=0;

CS 335: Type Systems - Indian Institute of Technology Kanpur Syst… · Type Hints in Python def sum(num1: int, num2: int) -> int: return num1 + num2 print(sum(2, 3)) print(sum(1,

第三次小考. #include using namespace std; int aaa(int *ib,int a1,int a2) { int u,v; int m=(a1+a2)/2; if(a1==a2)return ib[a1]; u=aaa(ib,a1,m); cout

From cisc106 import * def f(x): if x < 10: return (x+9) elif x < 5: return (x + 4) elif x < 0: return (x) else: return(0) assertEqual(f(-1), ______)

Langage C Révision. #include int main() { printf("Hello world!\n"); return 0; }

2017-02-18 function(int a, int b, int c) {char buffer1[8]; char buffer2[12];} int main() {function(1,2,3);} Example program Function parameters Return address Saved frame pointer Local