Adapting Scheme-Like Macros to a C-Like Language

Size: px
Start display at page:

Download "Adapting Scheme-Like Macros to a C-Like Language"

Transcription

1 Adapting Scheme-Like Macros to a C-Like Language Kevin Atkinson, Matthew Flatt University of Utah 1

2 ZL Adopts a Scheme-like approach to build C++ from a C like core Why C? The system's programming language Want to make life better in that world 2

3 Challenges 1. Parsing C Idiosyncratic Syntax While Also Allowing The Syntax to be Extensible 2. Finding Right Hygiene Model 3. Finding Right Reflective Operations 3

4 How to Parse This Expression? f(x/2, y) Function Call? f(x/2, y)?? Macro Invocation? x/2 + y int y = x/2 4

5 Parsing Overview ZL doesn't parse in a single linear pass Iterative-deepening approach Raw Text Parse Syntax Object Partly Expand Syntax Object Reparse Raw Text AST Node Raw Text Compile Raw Text 5

6 Parsing Details "inline int f() {int x = 10; return x; int main() {return f();" Parse (@ (stmt inline int f ('()' "") ('{' "int x = 10; return x;") (stmt int main ('()' "") ('{' "return f();"))) Expand & Compile Top-Level Environment (stmt inline int f ) (stmt int main ) 6

7 Top-Level Environment (stmt inline int f ) Expand (fun f (.) (int) :inline ('{' "int x = 10; return x;")) Compile Function ('{' "int x = 10; return x;") (stmt int main ) 7

8 Function ('{' "int x = 10; return x;") Expand & Reparse (block (stmt int x = 10) (return (exp x))) Compile Block (stmt int x = 10)) (return (exp x)) 8

9 Pattern Macros macro or(x, y) { ({typeof(x) t = x; t? t : y;); or(0.0,t) ({typeof(0.0) t 0 = 0.0; t 0? t 0 : t;); 9

10 Syntax Macros Add to PEG Grammer: <foreach> "foreach" "(" {ID "in" {EXP ")" {STMT In Source Code: smacro foreach (id, container, body) { "foreach (x in con) printf("%d\n", x);" Parse (foreach x con ('{' "printf("%d\n", x);")) Expand 10

11 Procedural Macros Syntax * or(syntax * syn, Environ *) { Match * m = match(null, syntax (_, x, y), syn); return replace(syntax {({typeof(x) t = x; t? t : y;);, m, new_mark()); make_macro or; Syntax Forms: syntax make_macro new_mark Callbacks: match replace error 11

12 float pi = ; Procedural Macro Example Syntax * area_circle(syntax * syn, Environ *) { Mark * mark = new_mark(); Match * m = match(null, syntax (_, R), syn); UnmarkedSyntax * r = syntax { ({float r = R; pi*r*r;); ; return replace (r, m, mark); make_macro area_circle; int main() { float pi = 3.14; float r = 10; area_circle(r) 12

13 Expansion of area_circle(r) float pi = ; Syntax * area_circle(syntax * syn, Environ *) { Mark * mark = new_mark(); ('0, pi => ) Match * m = match(null, syntax (_, R), syn); UnmarkedSyntax * r = syntax { ({float r = R; pi*r*r;); ; return replace (r, m, mark); make_macro area_circle; int main() { area_circle(r) 13

14 Expansion of area_circle(r) float pi = ; Syntax * area_circle(syntax * syn, Environ *) { Mark * mark = Match * m = match(null, syntax (_, R), syn); [R => r] UnmarkedSyntax * r = syntax { ({float r = R; pi*r*r;); ; return replace (r, m, mark); make_macro area_circle; ('0, pi => ) int main() { area_circle(r) 14

15 Expansion of area_circle(r) float pi = ; Syntax * area_circle(syntax * syn, Environ *) { Mark * mark = Match * m = [R => r] UnmarkedSyntax * r = syntax { ({float r = R; pi*r*r;); ; return replace (r, m, mark); make_macro area_circle; ('0, pi => ) int main() { area_circle(r) 15

16 Expansion of area_circle(r) float pi = ; Syntax * area_circle(syntax * syn, Environ *) { Mark * mark = Match * m = [R => r] UnmarkedSyntax * r = syntax { ({float r = R; pi*r*r;); ; return replace (r, m, mark); (syntax { ({float r = R; pi*r*r;);, [R => r], make_macro area_circle; ('0, pi => ) ('0, pi => ) ); 16 int main() { area_circle(r)

17 Expansion of area_circle(r) float pi = ; Syntax * area_circle(syntax * syn, Environ *) { return replace (syntax { ({float r = R; pi*r*r;);, [R => r], make_macro area_circle; ('0, pi => ) ); int main() { area_circle(r) ({ float r'0 = r; pi'0 * r'0 * r'0; ) 17

18 float pi = ; Hygiene System Syntax * area_circle(syntax * syn, Environ *) { Mark * mark = new_mark(); Match * m = match(null, syntax (_, R), syn); UnmarkedSyntax * r = syntax { ({float r = R; pi*r*r;); ; return replace (r, m, mark); make_macro area_circle; int main() { float pi = 3.14; float r = 10; area_circle(r) ({float r = r; pi * r * r;) 18

19 float pi $pi0 = ; pi => $pi0 19

20 float pi $pi0 = ; pi => $pi0 Syntax * area_circle(syntax * syn, Environ *) { Mark * mark = new_mark(); make_macro area_circle; 20

21 float pi $pi0 = ; pi => $pi0 Syntax * area_circle(syntax * syn, Environ *) { int main() { float pi $pi1 = 3.14; float r $r0 = 10; r => $r0, pi => $pi1, area_circle => area_circle(r) 21

22 float pi $pi0 = ; pi => $pi0 Syntax * area_circle(syntax * syn, Environ *) { int main() { float pi $pi1 = 3.14; float r $r0 = 10; r => $r0, pi => $pi1, area_circle => area_circle(r) ({ float r'0 = r; pi'0 * r'0 * r'0; ) 22 '0 => pi => $pi0

23 float pi $pi0 = ; pi => $pi0 Syntax * area_circle(syntax * syn, Environ *) { int main() { float pi $pi1 = 3.14; float r $r0 = 10; r'0 => $r1, r => $r0, pi => $pi1, area_circle => area_circle(r) ({ float r'0 $r1 = r; pi'0 * r'0 * r'0; ) Mark Becomes Part of The Name 23 '0 => pi => $pi0

24 float pi $pi0 = ; pi => $pi0 Syntax * area_circle(syntax * syn, Environ *) { int main() { float pi $pi1 = 3.14; float r $r0 = 10; r'0 => $r1, r => $r0, pi => $pi1, area_circle => area_circle(r) ({ float r'0 $r1 = r $r0; pi'0 * r'0 * r'0; ) 24 '0 => pi => $pi0

25 float pi $pi0 = ; pi => $pi0 Syntax * area_circle(syntax * syn, Environ *) { int main() { float pi $pi1 = 3.14; float r $r0 = 10; r'0 => $r1, r => $r0, pi => $pi1, area_circle => area_circle(r) ({ float r'0 $r1 = r $r0; pi'0 * r'0 * r'0; ) Look Inside the Mark 25 '0 => pi => $pi0

26 float pi $pi0 = ; pi => $pi0 Syntax * area_circle(syntax * syn, Environ *) { int main() { float pi $pi1 = 3.14; float r $r0 = 10; r'0 => $r1, r => $r0, pi => $pi1, area_circle => area_circle(r) ({ float r'0 $r1 = r $r0; pi'0 $pi0 * r'0 * r'0; ) Strip Mark pi 26 '0 => pi => $pi0

27 float pi $pi0 = ; pi => $pi0 Syntax * area_circle(syntax * syn, Environ *) { int main() { float pi $pi1 = 3.14; float r $r0 = 10; r'0 => $r1, r => $r0, pi => $pi1, area_circle => area_circle(r) ({ float r'0 $r1 = r $r0; pi'0 $pi0 * r'0 $r1 * r'0 $r1; ) 27 '0 => pi => $pi0

28 float $pi0 = ; int main() { float $pi1 = 3.14; float $r0 = 10; ({ float $r1 = $r0; $pi0 * $r1 * $r1; ) Everything Resolves Correctly 28

29 Bending Hygiene: Replace Context datum->syntax-object => Contex * get_context(syntax *) Syntax * replace_context (UnmarkedSyntax *, Context *) 29

30 Bending Hygiene: Fluid Binding define-syntax-parameter => fluid_binding syntax-parameterize => fluid fluid_binding this; macro m() {f(this); int main() {X * fluid this = ; return m(); 30

31 Other API Functions Syntax * foreach (Syntax * syn, Environ * env) { Syntax * con = ; if (!symbol_exists(syntax begin, con, mark, env) return error(con, "Container lacks proper method."); make_syntax_macro foreach; int main() { foreach(x in container) {printf("%d\n", x);); Additional API Functions and Examples in Paper 31

32 Results Used ZL to Mitigate Problems of: Adding and Removing C++ fields and methods Incomparable ABI's Due to Compiler Changes (See GPCE'10 Paper) Compile Time Only 2-3 slower than G++ No Impact on Run-time Performance 32

33 Conclusion Presented Macro System that: Handle C s rich syntax Preserves Lexical Scope Offers power of Scheme's syntax-case Parts of ZL Also Presented in GPCE'10: ABI Compatibility Through a Customizable Language Additional Parts Presented in my Dissertation Implementation Available: 33

ABI Compatibility Through A Customizable Language

ABI Compatibility Through A Customizable Language ABI Compatibility Through A Customizable Language Kevin Atkinson, Matthew Flatt, Gary Lindstrom University of Utah 1 Application Programmer Interface (API) Library API virtual int f(); Library API class

More information

APPLICATION BINARY INTERFACE COMPATIBILITY THROUGH A CUSTOMIZABLE LANGUAGE

APPLICATION BINARY INTERFACE COMPATIBILITY THROUGH A CUSTOMIZABLE LANGUAGE APPLICATION BINARY INTERFACE COMPATIBILITY THROUGH A CUSTOMIZABLE LANGUAGE by Kevin Jay Atkinson A dissertation submitted to the faculty of The University of Utah in partial fulfillment of the requirements

More information

CSE341: Programming Languages Lecture 17 Implementing Languages Including Closures. Dan Grossman Autumn 2018

CSE341: Programming Languages Lecture 17 Implementing Languages Including Closures. Dan Grossman Autumn 2018 CSE341: Programming Languages Lecture 17 Implementing Languages Including Closures Dan Grossman Autumn 2018 Typical workflow concrete syntax (string) "(fn x => x + x) 4" Parsing Possible errors / warnings

More information

It s Turtles All the Way Up: Self-Extensible Programming Languages in PLT Scheme

It s Turtles All the Way Up: Self-Extensible Programming Languages in PLT Scheme It s Turtles All the Way Up: Self-Extensible Programming Languages in PLT Scheme Matthew Flatt University of Utah 1 Different levels of extension... Syntactic abstraction (define-syntax-rule (define-thing

More information

Scheme-Style Macros: Patterns and Lexical Scope

Scheme-Style Macros: Patterns and Lexical Scope Scheme-Style Macros: Patterns and Lexical Scope Matthew Flatt University of Utah 1 Why Macros? Language designers have to stop somewhere (544 pages) No language can provide every possible useful construct

More information

SYNTACTIC EXTENSION FOR LANGUAGES WITH IMPLICITLY DELIMITED AND INFIX SYNTAX

SYNTACTIC EXTENSION FOR LANGUAGES WITH IMPLICITLY DELIMITED AND INFIX SYNTAX SYNTACTIC EXTENSION FOR LANGUAGES WITH IMPLICITLY DELIMITED AND INFIX SYNTAX by Jon Rafkind A dissertation submitted to the faculty of The University of Utah in partial fulfillment of the requirements

More information

CSE413: Programming Languages and Implementation Racket structs Implementing languages with interpreters Implementing closures

CSE413: Programming Languages and Implementation Racket structs Implementing languages with interpreters Implementing closures CSE413: Programming Languages and Implementation Racket structs Implementing languages with interpreters Implementing closures Dan Grossman Fall 2014 Hi! I m not Hal J I love this stuff and have taught

More information

CSCE 314 Programming Languages. Type System

CSCE 314 Programming Languages. Type System CSCE 314 Programming Languages Type System Dr. Hyunyoung Lee 1 Names Names refer to different kinds of entities in programs, such as variables, functions, classes, templates, modules,.... Names can be

More information

Lecture 09: Data Abstraction ++ Parsing is the process of translating a sequence of characters (a string) into an abstract syntax tree.

Lecture 09: Data Abstraction ++ Parsing is the process of translating a sequence of characters (a string) into an abstract syntax tree. Lecture 09: Data Abstraction ++ Parsing Parsing is the process of translating a sequence of characters (a string) into an abstract syntax tree. program text Parser AST Processor Compilers (and some interpreters)

More information

Why Macros? Scheme-Style Macros: Patterns and Lexical Scope. Macros versus Arbitrary Program Generators. Macros versus Arbitrary Program Generators

Why Macros? Scheme-Style Macros: Patterns and Lexical Scope. Macros versus Arbitrary Program Generators. Macros versus Arbitrary Program Generators Why Macros? Scheme-Style Macros: Patterns and Lexical Scope Language designers have to stop somewhere Matthew Flatt University of Utah (544 pages) No language can provide every possible useful construct

More information

CS 360 Programming Languages Interpreters

CS 360 Programming Languages Interpreters CS 360 Programming Languages Interpreters Implementing PLs Most of the course is learning fundamental concepts for using and understanding PLs. Syntax vs. semantics vs. idioms. Powerful constructs like

More information

Macros that Work Together

Macros that Work Together JFP 22 (2): 181 216, 2012. c Cambridge University Press 2012 doi:10.1017/s0956796812000093 181 Macros that Work Together Compile-time bindings, partial expansion, and definition contexts MATTHEW FLATT,

More information

Compiler Theory. (Semantic Analysis and Run-Time Environments)

Compiler Theory. (Semantic Analysis and Run-Time Environments) Compiler Theory (Semantic Analysis and Run-Time Environments) 005 Semantic Actions A compiler must do more than recognise whether a sentence belongs to the language of a grammar it must do something useful

More information

Lecture 12: Conditional Expressions and Local Binding

Lecture 12: Conditional Expressions and Local Binding Lecture 12: Conditional Expressions and Local Binding Introduction Corresponds to EOPL 3.3-3.4 Please review Version-1 interpreter to make sure that you understand how it works Now we will extend the basic

More information

Maya: Multiple-Dispatch Syntax Extension in Java. Jason Baker and Wilson C. Hsieh University of Utah

Maya: Multiple-Dispatch Syntax Extension in Java. Jason Baker and Wilson C. Hsieh University of Utah Maya: Multiple-Dispatch Syntax Extension in Java Jason Baker and Wilson C. Hsieh University of Utah Example java.util.vector v; v.elements().foreach(string st) { /* */ } Maya code for (Enumeration enum$

More information

Macros that Work Together

Macros that Work Together Under consideration for publication in J. Functional Programming 1 Macros that Work Together Compile-Time Bindings, Partial Expansion, and Definition Contexts Matthew Flatt 1, Ryan Culpepper 1, David Darais

More information

Typical workflow. CSE341: Programming Languages. Lecture 17 Implementing Languages Including Closures. Reality more complicated

Typical workflow. CSE341: Programming Languages. Lecture 17 Implementing Languages Including Closures. Reality more complicated Typical workflow concrete synta (string) "(fn => + ) 4" Parsing CSE341: Programming Languages abstract synta (tree) Lecture 17 Implementing Languages Including Closures Function Constant + 4 Var Var Type

More information

Languages as Libraries

Languages as Libraries Languages as Libraries or, implementing the next 700 programming languages Sam Tobin-Hochstadt Vincent St-Amour Ryan Culpepper Matthew Flatt Matthias Felleisen PLT @ Northeastern & Utah June 6, 2011 PLDI

More information

Outline. Introduction Concepts and terminology The case for static typing. Implementing a static type system Basic typing relations Adding context

Outline. Introduction Concepts and terminology The case for static typing. Implementing a static type system Basic typing relations Adding context Types 1 / 15 Outline Introduction Concepts and terminology The case for static typing Implementing a static type system Basic typing relations Adding context 2 / 15 Types and type errors Type: a set of

More information

Honu: A syntactically extensible language

Honu: A syntactically extensible language Honu: A syntactically extensible language Jon Rafkind 0 and Matthew Flatt 1 University of Utah rafkind@cs.utah.edu mflatt@cs.utah.edu Abstract. Honu is a new language that contains a system for extending

More information

Binding as Sets of Scopes

Binding as Sets of Scopes Binding as Sets of Scopes Artifact Matthew Flatt University of Utah, USA mflatt@cs.utah.edu * POPL * Consistent * Complete * Well Documented * Easy to Reuse * Evaluated * AEC * Abstract Our new macro expander

More information

WELCOME TO PERL = Tuesday, June 4, 13

WELCOME TO PERL = Tuesday, June 4, 13 WELCOME TO PERL11 5 + 6 = 11 http://perl11.org/ Stavanger 2012 Moose + p5-mop Workshop Text Preikestolen Will Braswell Ingy döt net Austin 2012 PERL 11 5 + 6 = 11 perl11.org Will Braswell, Ingy döt net,

More information

The Environment Model

The Environment Model The Environment Model Prof. Clarkson Fall 2017 Today s music: Selections from Doctor Who soundtracks by Murray Gold Review Previously in 3110: Interpreters: ASTs, evaluation, parsing Formal syntax: BNF

More information

Visitors Unchained. Using visitors to traverse abstract syntax with binding. François Pottier. Inria Paris May 22, 2017

Visitors Unchained. Using visitors to traverse abstract syntax with binding. François Pottier. Inria Paris May 22, 2017 Visitors Unchained Using visitors to traverse abstract syntax with binding François Pottier Inria Paris May 22, 2017 Visitors Installation & configuration Installation: opam update opam install visitors

More information

Extensible Java Pre-processor

Extensible Java Pre-processor Extensible Java Pre-processor National Institute of Advanced Industrial Science and Technology(AIST) Yuuji Ichisugi http://staff.aist.go.jp/y-ichisugi/ 2002/12/17 1 What is EPP? Language extension framework

More information

Syntactic Abstraction in Component Interfaces

Syntactic Abstraction in Component Interfaces Syntactic Abstraction in Component Interfaces Ryan Culpepper 1, Scott Owens 2, and Matthew Flatt 2 1 Northeastern University (ryanc@ccs.neu.edu) 2 University of Utah ([sowens, mflatt]@cs.utah.edu) Abstract.

More information

CS1622. Semantic Analysis. The Compiler So Far. Lecture 15 Semantic Analysis. How to build symbol tables How to use them to find

CS1622. Semantic Analysis. The Compiler So Far. Lecture 15 Semantic Analysis. How to build symbol tables How to use them to find CS1622 Lecture 15 Semantic Analysis CS 1622 Lecture 15 1 Semantic Analysis How to build symbol tables How to use them to find multiply-declared and undeclared variables. How to perform type checking CS

More information

EDAN65: Compilers, Lecture 06 A LR parsing. Görel Hedin Revised:

EDAN65: Compilers, Lecture 06 A LR parsing. Görel Hedin Revised: EDAN65: Compilers, Lecture 06 A LR parsing Görel Hedin Revised: 2017-09-11 This lecture Regular expressions Context-free grammar Attribute grammar Lexical analyzer (scanner) Syntactic analyzer (parser)

More information

The SPL Programming Language Reference Manual

The SPL Programming Language Reference Manual The SPL Programming Language Reference Manual Leonidas Fegaras University of Texas at Arlington Arlington, TX 76019 fegaras@cse.uta.edu February 27, 2018 1 Introduction The SPL language is a Small Programming

More information

Basic concepts. Chapter Toplevel loop

Basic concepts. Chapter Toplevel loop Chapter 3 Basic concepts We examine in this chapter some fundamental concepts which we will use and study in the following chapters. Some of them are specific to the interface with the Caml language (toplevel,

More information

Functional Programming. Pure Functional Programming

Functional Programming. Pure Functional Programming Functional Programming Pure Functional Programming Computation is largely performed by applying functions to values. The value of an expression depends only on the values of its sub-expressions (if any).

More information

The Environment Model. Nate Foster Spring 2018

The Environment Model. Nate Foster Spring 2018 The Environment Model Nate Foster Spring 2018 Review Previously in 3110: Interpreters: ASTs, evaluation, parsing Formal syntax: BNF Formal semantics: dynamic: small-step substitution model static semantics

More information

PyROOT: Seamless Melting of C++ and Python. Pere MATO, Danilo PIPARO on behalf of the ROOT Team

PyROOT: Seamless Melting of C++ and Python. Pere MATO, Danilo PIPARO on behalf of the ROOT Team PyROOT: Seamless Melting of C++ and Python Pere MATO, Danilo PIPARO on behalf of the ROOT Team ROOT At the root of the experiments, project started in 1995 Open Source project (LGPL2) mainly written in

More information

Lexical analysis. Syntactical analysis. Semantical analysis. Intermediate code generation. Optimization. Code generation. Target specific optimization

Lexical analysis. Syntactical analysis. Semantical analysis. Intermediate code generation. Optimization. Code generation. Target specific optimization Second round: the scanner Lexical analysis Syntactical analysis Semantical analysis Intermediate code generation Optimization Code generation Target specific optimization Lexical analysis (Chapter 3) Why

More information

Languages as Libraries

Languages as Libraries Languages as Libraries or, implementing the next 700 programming languages Sam Tobin-Hochstadt PLT @ Northeastern University May 11, 2011 MIT 1 A domain specific language is the ultimate abstraction. Paul

More information

HDL. Operations and dependencies. FSMs Logic functions HDL. Interconnected logic blocks HDL BEHAVIORAL VIEW LOGIC LEVEL ARCHITECTURAL LEVEL

HDL. Operations and dependencies. FSMs Logic functions HDL. Interconnected logic blocks HDL BEHAVIORAL VIEW LOGIC LEVEL ARCHITECTURAL LEVEL ARCHITECTURAL-LEVEL SYNTHESIS Motivation. Outline cgiovanni De Micheli Stanford University Compiling language models into abstract models. Behavioral-level optimization and program-level transformations.

More information

INF 212 ANALYSIS OF PROG. LANGS FUNCTION COMPOSITION. Instructors: Crista Lopes Copyright Instructors.

INF 212 ANALYSIS OF PROG. LANGS FUNCTION COMPOSITION. Instructors: Crista Lopes Copyright Instructors. INF 212 ANALYSIS OF PROG. LANGS FUNCTION COMPOSITION Instructors: Crista Lopes Copyright Instructors. Topics Recursion Higher-order functions Continuation-Passing Style Monads (take 1) Identity Monad Maybe

More information

Lecture 16: Static Semantics Overview 1

Lecture 16: Static Semantics Overview 1 Lecture 16: Static Semantics Overview 1 Lexical analysis Produces tokens Detects & eliminates illegal tokens Parsing Produces trees Detects & eliminates ill-formed parse trees Static semantic analysis

More information

The Procedure Abstraction Part I: Basics

The Procedure Abstraction Part I: Basics The Procedure Abstraction Part I: Basics Procedure Abstraction Begins Chapter 6 in EAC The compiler must deal with interface between compile time and run time Most of the tricky issues arise in implementing

More information

Introduction to Compilers Professor Jeremy Siek

Introduction to Compilers Professor Jeremy Siek Professor Jeremy Siek This exam has 9 questions, for a total of 100 points. 1. 5 points What is the output of the following Python program, x = input() print x + input() % input(), False, True given the

More information

Problem Score Max Score 1 Syntax directed translation & type

Problem Score Max Score 1 Syntax directed translation & type CMSC430 Spring 2014 Midterm 2 Name Instructions You have 75 minutes for to take this exam. This exam has a total of 100 points. An average of 45 seconds per point. This is a closed book exam. No notes

More information

Visitors Unchained. Using visitors to traverse abstract syntax with binding. François Pottier. WG 2.8, Edinburgh June 15, 2017

Visitors Unchained. Using visitors to traverse abstract syntax with binding. François Pottier. WG 2.8, Edinburgh June 15, 2017 Visitors Unchained Using visitors to traverse abstract syntax with binding François Pottier WG 2.8, Edinburgh June 15, 2017 The problem Manipulating abstract syntax with binding requires many standard

More information

Programs as data first-order functional language type checking

Programs as data first-order functional language type checking Programs as data first-order functional language type checking Copyright 2013-18, Peter Sestoft and Cesare Tinelli. Created by Cesare Tinelli at the University of Iowa from notes originally developed by

More information

Introduction to Programming Languages and Compilers. CS164 11:00-12:30 TT 10 Evans. UPRM ICOM 4029 (Adapted from: Prof. Necula UCB CS 164)

Introduction to Programming Languages and Compilers. CS164 11:00-12:30 TT 10 Evans. UPRM ICOM 4029 (Adapted from: Prof. Necula UCB CS 164) Introduction to Programming Languages and Compilers CS164 11:00-12:30 TT 10 Evans 1 ICOM 4036 - Outline Prontuario Course Outline Brief History of PLs Programming Language Design Criteria Programming Language

More information

Chapter 3: Describing Syntax and Semantics. Introduction Formal methods of describing syntax (BNF)

Chapter 3: Describing Syntax and Semantics. Introduction Formal methods of describing syntax (BNF) Chapter 3: Describing Syntax and Semantics Introduction Formal methods of describing syntax (BNF) We can analyze syntax of a computer program on two levels: 1. Lexical level 2. Syntactic level Lexical

More information

CS 11 Ocaml track: lecture 7

CS 11 Ocaml track: lecture 7 CS 11 Ocaml track: lecture 7 Today: Writing a computer language, part 2 Evaluating the AST Environments and scoping Where we're at We've implemented the first part of a language interpreter source code

More information

Topic 3: Syntax Analysis I

Topic 3: Syntax Analysis I Topic 3: Syntax Analysis I Compiler Design Prof. Hanjun Kim CoreLab (Compiler Research Lab) POSTECH 1 Back-End Front-End The Front End Source Program Lexical Analysis Syntax Analysis Semantic Analysis

More information

Outline. What is semantics? Denotational semantics. Semantics of naming. What is semantics? 2 / 21

Outline. What is semantics? Denotational semantics. Semantics of naming. What is semantics? 2 / 21 Semantics 1 / 21 Outline What is semantics? Denotational semantics Semantics of naming What is semantics? 2 / 21 What is the meaning of a program? Recall: aspects of a language syntax: the structure of

More information

QUESTION BANK CHAPTER 1 : OVERVIEW OF SYSTEM SOFTWARE. CHAPTER 2: Overview of Language Processors. CHAPTER 3: Assemblers

QUESTION BANK CHAPTER 1 : OVERVIEW OF SYSTEM SOFTWARE. CHAPTER 2: Overview of Language Processors. CHAPTER 3: Assemblers QUESTION BANK CHAPTER 1 : OVERVIEW OF SYSTEM SOFTWARE 1) Explain Analysis-synthesis model/fron end backend model of compiler 2) Explain various phases of compiler and symbol table. Consider the statement

More information

Informal Semantics of Data. semantic specification names (identifiers) attributes binding declarations scope rules visibility

Informal Semantics of Data. semantic specification names (identifiers) attributes binding declarations scope rules visibility Informal Semantics of Data semantic specification names (identifiers) attributes binding declarations scope rules visibility 1 Ways to Specify Semantics Standards Documents (Language Definition) Language

More information

Intermediate Representations & Symbol Tables

Intermediate Representations & Symbol Tables Intermediate Representations & Symbol Tables Copyright 2014, Pedro C. Diniz, all rights reserved. Students enrolled in the Compilers class at the University of Southern California have explicit permission

More information

Team 19: Skit. Andrew Figpope: Project Manager Michelle Zhang: Language Guru Márcio Paiva: System Architect Thomas Huzij: System Integrator

Team 19: Skit. Andrew Figpope: Project Manager Michelle Zhang: Language Guru Márcio Paiva: System Architect Thomas Huzij: System Integrator Team 19: Skit Andrew Figpope: Project Manager Michelle Zhang: Language Guru Márcio Paiva: System Architect Thomas Huzij: System Integrator There exists numerous ways to set up and play Settlers, including

More information

Type Inference Systems. Type Judgments. Deriving a Type Judgment. Deriving a Judgment. Hypothetical Type Judgments CS412/CS413

Type Inference Systems. Type Judgments. Deriving a Type Judgment. Deriving a Judgment. Hypothetical Type Judgments CS412/CS413 Type Inference Systems CS412/CS413 Introduction to Compilers Tim Teitelbaum Type inference systems define types for all legal programs in a language Type inference systems are to type-checking: As regular

More information

CS 345. Functions. Vitaly Shmatikov. slide 1

CS 345. Functions. Vitaly Shmatikov. slide 1 CS 345 Functions Vitaly Shmatikov slide 1 Reading Assignment Mitchell, Chapter 7 C Reference Manual, Chapters 4 and 9 slide 2 Procedural Abstraction Can be overloaded (e.g., binary +) Procedure is a named

More information

COP4020 Programming Languages. Compilers and Interpreters Robert van Engelen & Chris Lacher

COP4020 Programming Languages. Compilers and Interpreters Robert van Engelen & Chris Lacher COP4020 ming Languages Compilers and Interpreters Robert van Engelen & Chris Lacher Overview Common compiler and interpreter configurations Virtual machines Integrated development environments Compiler

More information

Title. Authors. Status. 1. Abstract. 2. Rationale. 3. Specification. R6RS Syntax-Case Macros. Kent Dybvig

Title. Authors. Status. 1. Abstract. 2. Rationale. 3. Specification. R6RS Syntax-Case Macros. Kent Dybvig Title R6RS Syntax-Case Macros Authors Kent Dybvig Status This SRFI is being submitted by a member of the Scheme Language Editor s Committee as part of the R6RS Scheme standardization process. The purpose

More information

CSE 413 Languages & Implementation. Hal Perkins Winter 2019 Structs, Implementing Languages (credits: Dan Grossman, CSE 341)

CSE 413 Languages & Implementation. Hal Perkins Winter 2019 Structs, Implementing Languages (credits: Dan Grossman, CSE 341) CSE 413 Languages & Implementation Hal Perkins Winter 2019 Structs, Implementing Languages (credits: Dan Grossman, CSE 341) 1 Goals Representing programs as data Racket structs as a better way to represent

More information

Dissertation Proposal

Dissertation Proposal Dissertation Proposal Version 2.0 Jon Rafkind June 14, 2011 1 1 Introduction Thesis: Semantic macro systems are feasible and useful for typed languages with rich syntactic structure. Many existing languages

More information

What is Class? Remember

What is Class? Remember What is Class? The mechanism that allows you to combine data and the function in a single unit is called a class. Once a class is defined, you can declare variables of that type. A class variable is called

More information

UNIVERSITY OF CALIFORNIA Department of Electrical Engineering and Computer Sciences Computer Science Division. P. N. Hilfinger

UNIVERSITY OF CALIFORNIA Department of Electrical Engineering and Computer Sciences Computer Science Division. P. N. Hilfinger UNIVERSITY OF CALIFORNIA Department of Electrical Engineering and Computer Sciences Computer Science Division CS 164 Spring 2010 P. N. Hilfinger CS 164: Test #2 (revised) Name: Login: Login of person to

More information

Abstract Syntax Trees Synthetic and Inherited Attributes

Abstract Syntax Trees Synthetic and Inherited Attributes Abstract Syntax Trees Synthetic and Inherited Attributes Lecture 22 Sections 5.1-5.2 Robb T. Koether Hampden-Sydney College Mon, Mar 16, 2015 Robb T. Koether (Hampden-Sydney College)Abstract Syntax TreesSynthetic

More information

Language Translation. Compilation vs. interpretation. Compilation diagram. Step 1: compile. Step 2: run. compiler. Compiled program. program.

Language Translation. Compilation vs. interpretation. Compilation diagram. Step 1: compile. Step 2: run. compiler. Compiled program. program. Language Translation Compilation vs. interpretation Compilation diagram Step 1: compile program compiler Compiled program Step 2: run input Compiled program output Language Translation compilation is translation

More information

Computer Science 21b (Spring Term, 2015) Structure and Interpretation of Computer Programs. Lexical addressing

Computer Science 21b (Spring Term, 2015) Structure and Interpretation of Computer Programs. Lexical addressing Computer Science 21b (Spring Term, 2015) Structure and Interpretation of Computer Programs Lexical addressing The difference between a interpreter and a compiler is really two points on a spectrum of possible

More information

CS415 Compilers. Procedure Abstractions. These slides are based on slides copyrighted by Keith Cooper, Ken Kennedy & Linda Torczon at Rice University

CS415 Compilers. Procedure Abstractions. These slides are based on slides copyrighted by Keith Cooper, Ken Kennedy & Linda Torczon at Rice University CS415 Compilers Procedure Abstractions These slides are based on slides copyrighted by Keith Cooper, Ken Kennedy & Linda Torczon at Rice University Where are we? Well understood Engineering Source Code

More information

Compilation 2009 Domain-Specific Languages Syntax Extensions

Compilation 2009 Domain-Specific Languages Syntax Extensions Compilation 2009 Syntax Extensions Jan Midtgaard Michael I. Schwartzbach Aarhus University GPL Problem Solving The General Purpose Language (GPL) approach: analyze the problem domain express the conceptual

More information

The role of semantic analysis in a compiler

The role of semantic analysis in a compiler Semantic Analysis Outline The role of semantic analysis in a compiler A laundry list of tasks Scope Static vs. Dynamic scoping Implementation: symbol tables Types Static analyses that detect type errors

More information

Side Effects (3A) Young Won Lim 1/13/18

Side Effects (3A) Young Won Lim 1/13/18 Side Effects (3A) Copyright (c) 2016-2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later

More information

xtc Robert Grimm Making C Safely Extensible New York University

xtc Robert Grimm Making C Safely Extensible New York University xtc Making C Safely Extensible Robert Grimm New York University The Problem Complexity of modern systems is staggering Increasingly, a seamless, global computing environment System builders continue to

More information

Robert Grimm New York University

Robert Grimm New York University xtc Towards extensible C Robert Grimm New York University The Problem Complexity of modern systems is staggering Increasingly, a seamless, global computing environment System builders continue to use C

More information

Architectural-Level Synthesis. Giovanni De Micheli Integrated Systems Centre EPF Lausanne

Architectural-Level Synthesis. Giovanni De Micheli Integrated Systems Centre EPF Lausanne Architectural-Level Synthesis Giovanni De Micheli Integrated Systems Centre EPF Lausanne This presentation can be used for non-commercial purposes as long as this note and the copyright footers are not

More information

Kent Dybvig, Will Clinger, Matthew Flatt, Mike Sperber, and Anton van Straaten

Kent Dybvig, Will Clinger, Matthew Flatt, Mike Sperber, and Anton van Straaten R6RS Status Report Kent Dybvig, Will Clinger, Matthew Flatt, Mike Sperber, and Anton van Straaten February 24, 2006 1. Overview This status report describes the current state of the R 6 RS standardization

More information

CMSC430 Spring 2014 Midterm 2 Solutions

CMSC430 Spring 2014 Midterm 2 Solutions CMSC430 Spring 2014 Midterm 2 Solutions 1. (12 pts) Syntax directed translation & type checking Consider the following grammar fragment for an expression for C--: exp CONST IDENT 1 IDENT 2 [ exp 1 ] Assume

More information

CSE341: Programming Languages Lecture 15 Macros. Zach Tatlock Winter 2018

CSE341: Programming Languages Lecture 15 Macros. Zach Tatlock Winter 2018 CSE341: Programming Languages Lecture 15 Macros Zach Tatlock Winter 2018 What is a macro A macro definition describes how to transform some new syntax into different syntax in the source language A macro

More information

Semantic Analysis. Outline. The role of semantic analysis in a compiler. Scope. Types. Where we are. The Compiler so far

Semantic Analysis. Outline. The role of semantic analysis in a compiler. Scope. Types. Where we are. The Compiler so far Outline Semantic Analysis The role of semantic analysis in a compiler A laundry list of tasks Scope Static vs. Dynamic scoping Implementation: symbol tables Types Statically vs. Dynamically typed languages

More information

for (i=1; i<=100000; i++) { x = sqrt (y); // square root function cout << x+i << endl; }

for (i=1; i<=100000; i++) { x = sqrt (y); // square root function cout << x+i << endl; } Ex: The difference between Compiler and Interpreter The interpreter actually carries out the computations specified in the source program. In other words, the output of a compiler is a program, whereas

More information

What is a macro. CSE341: Programming Languages Lecture 15 Macros. Example uses. Using Racket Macros. Zach Tatlock Winter 2018

What is a macro. CSE341: Programming Languages Lecture 15 Macros. Example uses. Using Racket Macros. Zach Tatlock Winter 2018 What is a macro A macro definition describes how to transform some new syntax into different syntax in the source language CSE341: Programming Languages Lecture 15 Macros Zach Tatlock Winter 2018 A macro

More information

CS 415 Midterm Exam Fall 2003

CS 415 Midterm Exam Fall 2003 CS 415 Midterm Exam Fall 2003 Name KEY Email Address Student ID # Pledge: This exam is closed note, closed book. Questions will be graded on quality of answer. Please supply the best answer you can to

More information

Recap: Functions as first-class values

Recap: Functions as first-class values Recap: Functions as first-class values Arguments, return values, bindings What are the benefits? Parameterized, similar functions (e.g. Testers) Creating, (Returning) Functions Iterator, Accumul, Reuse

More information

Scope, Functions, and Storage Management

Scope, Functions, and Storage Management Scope, Functions, and Storage Management Implementing Functions and Blocks cs3723 1 Simplified Machine Model (Compare To List Abstract Machine) Registers Code Data Program Counter (current instruction)

More information

COMP520 - GoLite Type Checking Specification

COMP520 - GoLite Type Checking Specification COMP520 - GoLite Type Checking Specification Vincent Foley April 8, 2018 1 Introduction This document presents the typing rules for all the language constructs (i.e. declarations, statements, expressions)

More information

Computer Components. Software{ User Programs. Operating System. Hardware

Computer Components. Software{ User Programs. Operating System. Hardware Computer Components Software{ User Programs Operating System Hardware What are Programs? Programs provide instructions for computers Similar to giving directions to a person who is trying to get from point

More information

Concepts of programming languages

Concepts of programming languages Concepts of programming languages Lecture 7 Wouter Swierstra 1 Last time Relating evaluation and types How to handle variable binding in embedded languages? 2 DSLs: approaches A stand-alone DSL typically

More information

Data Abstraction. An Abstraction for Inductive Data Types. Philip W. L. Fong.

Data Abstraction. An Abstraction for Inductive Data Types. Philip W. L. Fong. Data Abstraction An Abstraction for Inductive Data Types Philip W. L. Fong pwlfong@cs.uregina.ca Department of Computer Science University of Regina Regina, Saskatchewan, Canada Introduction This lecture

More information

Run-time Environments

Run-time Environments Run-time Environments Status We have so far covered the front-end phases Lexical analysis Parsing Semantic analysis Next come the back-end phases Code generation Optimization Register allocation Instruction

More information

A Brief Introduction to Common Lisp

A Brief Introduction to Common Lisp A Brief Introduction to Common Lisp David Gu Schloer Consulting Group david_guru@gty.org.in A Brief History Originally specified in 1958, Lisp is the second-oldest highlevel programming language in widespread

More information

Final Examination May 5, 2005

Final Examination May 5, 2005 CS 4352 Compilers and Interpreters Final Examination May 5, 2005 Name Closed Book. If you need more space ask for an extra sheet. 1. [4 points] Pick the appropriate data structure for each purpose: storage

More information

Semantic Analysis. Outline. The role of semantic analysis in a compiler. Scope. Types. Where we are. The Compiler Front-End

Semantic Analysis. Outline. The role of semantic analysis in a compiler. Scope. Types. Where we are. The Compiler Front-End Outline Semantic Analysis The role of semantic analysis in a compiler A laundry list of tasks Scope Static vs. Dynamic scoping Implementation: symbol tables Types Static analyses that detect type errors

More information

Run-time Environments

Run-time Environments Run-time Environments Status We have so far covered the front-end phases Lexical analysis Parsing Semantic analysis Next come the back-end phases Code generation Optimization Register allocation Instruction

More information

Static Semantics. Lecture 15. (Notes by P. N. Hilfinger and R. Bodik) 2/29/08 Prof. Hilfinger, CS164 Lecture 15 1

Static Semantics. Lecture 15. (Notes by P. N. Hilfinger and R. Bodik) 2/29/08 Prof. Hilfinger, CS164 Lecture 15 1 Static Semantics Lecture 15 (Notes by P. N. Hilfinger and R. Bodik) 2/29/08 Prof. Hilfinger, CS164 Lecture 15 1 Current Status Lexical analysis Produces tokens Detects & eliminates illegal tokens Parsing

More information

Compilers Project 3: Semantic Analyzer

Compilers Project 3: Semantic Analyzer Compilers Project 3: Semantic Analyzer CSE 40243 Due April 11, 2006 Updated March 14, 2006 Overview Your compiler is halfway done. It now can both recognize individual elements of the language (scan) and

More information

9/5/17. The Design and Implementation of Programming Languages. Compilation. Interpretation. Compilation vs. Interpretation. Hybrid Implementation

9/5/17. The Design and Implementation of Programming Languages. Compilation. Interpretation. Compilation vs. Interpretation. Hybrid Implementation Language Implementation Methods The Design and Implementation of Programming Languages Compilation Interpretation Hybrid In Text: Chapter 1 2 Compilation Interpretation Translate high-level programs to

More information

Lexical vs. Dynamic Scope

Lexical vs. Dynamic Scope Intro Lexical vs. Dynamic Scope where do I point to? Remember in Scheme whenever we call a procedure we pop a frame and point it to where the procedure points to (its defining environment). This is called

More information

CS /534 Compiler Construction University of Massachusetts Lowell

CS /534 Compiler Construction University of Massachusetts Lowell CS 91.406/534 Compiler Construction University of Massachusetts Lowell Professor Li Xu Fall 2004 Lab Project 2: Parser and Type Checker for NOTHING Due: Sunday, November 14, 2004, 11:59 PM 1 Introduction

More information

CSE302: Compiler Design

CSE302: Compiler Design CSE302: Compiler Design Instructor: Dr. Liang Cheng Department of Computer Science and Engineering P.C. Rossin College of Engineering & Applied Science Lehigh University January 30, 2007 Outline Recap

More information

Better Extensibility through Modular Syntax. Robert Grimm New York University

Better Extensibility through Modular Syntax. Robert Grimm New York University Better Extensibility through Modular Syntax Robert Grimm New York University Syntax Matters More complex syntactic specifications Extensions to existing programming languages Transactions, event-based

More information

Syntax Errors; Static Semantics

Syntax Errors; Static Semantics Dealing with Syntax Errors Syntax Errors; Static Semantics Lecture 14 (from notes by R. Bodik) One purpose of the parser is to filter out errors that show up in parsing Later stages should not have to

More information

Compiler construction 2002 week 5

Compiler construction 2002 week 5 Compiler construction in400 lecture 5 Koen Langendoen Delft University of Technology The Netherlands Overview semantic analysis identification symbol tables type checking assignment yacc LLgen language

More information

Functional Languages. CSE 307 Principles of Programming Languages Stony Brook University

Functional Languages. CSE 307 Principles of Programming Languages Stony Brook University Functional Languages CSE 307 Principles of Programming Languages Stony Brook University http://www.cs.stonybrook.edu/~cse307 1 Historical Origins 2 The imperative and functional models grew out of work

More information

TDDD55- Compilers and Interpreters Lesson 3

TDDD55- Compilers and Interpreters Lesson 3 TDDD55- Compilers and Interpreters Lesson 3 Zeinab Ganjei (zeinab.ganjei@liu.se) Department of Computer and Information Science Linköping University 1. Grammars and Top-Down Parsing Some grammar rules

More information

Side Effects (3B) Young Won Lim 11/20/17

Side Effects (3B) Young Won Lim 11/20/17 Side Effects (3B) Copyright (c) 2016-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later

More information