Presentation is loading. Please wait.

Presentation is loading. Please wait.

CSG 7111 Structure and Interpretation of an Aspect Language for Datatype Karl Lieberherr.

Published byHubert Wilkerson Modified over 9 years ago

Similar presentations

Presentation on theme: "CSG 7111 Structure and Interpretation of an Aspect Language for Datatype Karl Lieberherr."— Presentation transcript:

1 CSG 7111 Structure and Interpretation of an Aspect Language for Datatype Karl Lieberherr

2 CSG 7112 2 Lectures The motivation and theory behind “Aspect Language for Datatype”. –datatypes and class graphs –Semantics (// A B) (navig-object graphs.*) –Visitors and type checking Interpreter implementation

3 CSG 7113 Motivation Build on foundations that Matthias presented. Connections to templates: stressing the importance of structural recursion. Not only an interpreter but also a compiler (works, because traversals are sufficiently simple). Very useful application of foundations that is in itself a foundation. Demonstration that simple languages can be full of surprises.

4 CSG 7114 Homework Simple aspect-oriented language. Leads to a radically different way of programming: programming without knowing details of data structures. Write programs for a family of related data structures. Northeastern SAIC project ca. 1990.

5 CSG 7115 Homework evolution Initial motivation: make EOPL datatype style programming easier by adding a traverse function. Visitors written in full Scheme: AdaptiveScheme = Scheme + EOPL datatype + traversal strategies + visitors. You get a simplified form (thanks Matthias).

6 CSG 7116 Interpretation Interpret a traversal on an object tree. (join (//A B) (//B C)): starting at an A-node, traverse entire object tree, return C-nodes that are contained in B-nodes that are in turn contained in A-nodes. Not interesting enough. Can meta information about object trees make it more interesting?

7 CSG 7117 Interpretation with meta information Use a graph to express meta information. Many applications: –data type / data trees –class graph / object trees –schema / documents (XML) –programs / execution trees

8 CSG 7118 Class graphs (simplified UML class diagrams) nodes and edges nodes: concrete and abstract edges: has-a (triples) and is-a (pairs) concrete nodes: no incoming is-a supports inheritance flat: a class graph is flat if no abstract node has an outgoing has-a edge

9 CSG 7119 Example B2 A R B X S D 0..1 C T A//T//D a1:A r1:R s1:S c1:C d1:D class graph strategy t1:T r2:R c2:C d2:D s2:S object graph

10 CSG 71110 Plan (M s cg og) = ? –(M1(M2 s cg) og) = ? –og satisfies cg! Not only traverse! (Mv s cg og V) –(Mv1 (M1 (M2 s cg) og) V) –visitor V: before / after applications to node / edge. Local storage. Visitor functions are activated by traversal.

11 CSG 71111 Sample visitor (visitor PersonCountVisitor 0 // initial value PersonCountVisitor // return before (host Person) (+ PersonCountVisitor 1) )

12 CSG 71112 Example (Mv s cg og PersonCountVisitor) cg : class graph for bus routes og: object graph for bus routes s = (join (// BusRoute BusStop) (// BusStop Person)) count all persons waiting at any bus stop on a bus route

13 CSG 71113 Class Graph BusRoute BusStopList BusStop BusList BusPersonList Person passengers buses busStops waiting 0..* count all persons waiting at any bus stop on a bus route

14 CSG 71114 Object Graph Route1:BusRoute :BusStopList busStops CentralSquare:BusStop :PersonList waiting Daniel:PersonViera:Person BusList buses Bus15:Bus :PersonList passengers Christine:Person Bryan:Person s = (join (// BusRoute BusStop) (// BusStop Person)) (Mv s cg og PersonCountVisitor) = ?? c=0 c++

15 CSG 71115 Robustness BusRoute BusStopList BusStop BusList BusPersonList Person passengers busses busStops waiting 0..* s = BusRoute // BusStop // Person VillageList Village villages 0..* count all persons waiting at any bus stop on a bus route c=0 c++

16 CSG 71116 Aspects Aspects as program enhancers Here we enhance traversal programs with before and after advice defined in aspects called visitors General AOP enhances any kind of program This is a special case with good software engineering properties

17 CSG 71117 Develop a sequence of semantics (M s cg og) = ? –og satisfies cg! s, cg, og: are graphs. Graphs are relations. Use terminology of relations. Restrict to s = (// A B).

18 CSG 71118 Object level semantics (M s cg og), where s = (// A B). The key is to find a set FIRST(A,B) of edges such that e in FIRST(A, B) iff it is possible for an object of class A to reach an object of type B by a path beginning with an edge e. (M s cg og) is the FIRST(A,B) sets.

19 CSG 71119 Homework class graphs A CG is: (DD+) A DD is: (datatype TypeName Alternative+) An Alternative is: (AlternativeName (FieldName TypeName)+) HW class graph to class graph transformation: TypeName -- abstract class AlternativeName – concrete class (AlternativeName, FieldName, TypeName) – has-a (AlternativeName, TypeName) – is-a

20 CSG 71120 Homework class graphs CD = PL(DD). DD = "(datatype" TypeName L(Alternative) ")". Alternative = "(" AlternativeName L(TypedField) ")". TypedField = "(" FieldName TypeName ")". FieldName = Ident. TypeName = Ident. AlternativeName = Ident. L(S) ~ {S}. PL(S) ~ "(" {S} ")".

21 CSG 71121 Class graph example (datatype Container (a_Container (contents ItemList) (capacity Number) (total_weight Number))) (datatype Item (Cont (c Container)) (Simple (name String) (weight Weight))) (datatype Weight (a_Weight (v Number))) (datatype ItemList (Empty) (NonEmpty (first Item) (rest ItemList)))) HW class graph to class graph transformation: TypeName -- abstract class AlternativeName – concrete class (AlternativeName, FieldName, TypeName) – has-a (AlternativeName, TypeName) – is-a traversal strategy: (// a_Container a_Weight)

22 CSG 71122 As traditional class graph Container aContainer ItemListNumber contents capacity total_weight Empty NonEmpty Item Cont Simple c String Weight nameweight v first rest

23 CSG 71123 Another class graph example (datatype P (CP (q Q))) (datatype Q (CQ (p P))) Because we only allow trees for object graphs, we should disallow such class graphs? P and Q are useless.

24 CSG 71124 F CBA D G E H F CBA G E H Class graphs object-equivalent inheritance

25 CSG 71125 object-equivalent inheritance Class graphs F CBA G E H F CBA G E H

26 CSG 71126 inheritance Class graphs F CBA G E H H F A1 aH E G aE B1C1 aG Preview: (// aH aE) (// aH aG) (// aH Hid_A)

27 CSG 71127 inheritance Evolution F CBA G E H H F Hid_A aH E G aE Hid_BHid_C aG B aB not evolution-friendly

28 CSG 71128 inheritance Class graphs F CBA G E H H F A1 aH E G aE B1C1 aG Preview: (// aH aE) (// aH aG) (// aH Hid_A) CB A aA aBaC now evolution-friendly

29 CSG 71129 inheritance Class graphs F CBA G E H H F A1 aH E G aE B1C1 aG Preview: (// aH aE) (// aH aG) (// aH Hid_A) CB A aA aBaC

30 CSG 71130 inheritance Class graphs F CBA G E H H F A1 aH E G aE B1C1 aG Preview: (// aH aE) (// aH aG) (// aH Hid_A) CB A aA aBaC E1

31 CSG 71131 inheritance Class graphs F CBA G E H (datatype H (aH (f F) (b B) )) (datatype G (aG)) (datatype A (aA (e E) (g G))) (datatype B (aB (e E) (g G))) (datatype C (aC (g G))) (datatype E (aE)) (datatype F (A1 (a A)) (B1 (b B)) (C1 (c C)) (E1 (e E)) ) H = F B. G =. A = E G. B = E G. C = G. E =. F : A | B | C | E.

32 CSG 71132 Separate Viewgraphs Difference between homework class graphs and class graphs. No inheritance in homework class graphs. Flat class graphs can easily be modeled by home work class graph. A class graph is flat if abstract classes have no outgoing has-a edges. Quadratic growth in size.

33 CSG 71133 Apply class graph knowledge to homework class graphs Only consider flat class graph (flattening is an object preserving transformation). In flat class graph the rules are simpler. HW class graph to class graph transformation: TypeName -- abstract class AlternativeName – concrete class (AlternativeName, FieldName, TypeName) – has-a (AlternativeName, enclosing TypeName) – is-a

34 CSG 71134 Meaning of strategies and visitors (// A B) (only this in hw) –A:AlternativeName B:AlternativeName –starts at A-object and ends at B-object (// A B) –A:TypeName B:TypeName –starts at an AlternativeName-object of A –ends at an AlternativeName-object of B

35 CSG 71135 From Semantics to Interpreter From object-level semantics to class-level semantics (M1(M2 s cg) og) –M2: FIRST sets at class level SWITCH to navig-object-graphs

36 CSG 71136 From Interpreter to Compiler Connect to Structural Recursion Consider the strategy (// A *) (everything reachable from A) (M1(M2 s cg) og): we want M1 to be apply M2 must return a function that we apply to og Primitives: functions with one argument: the data traversed, no other arguments.

37 CSG 71137 Code generation: should produce something useful (define-datatype BusRoute BusRoute? (a-BusRoute (name symbol?) (buses (list-of Bus?)) (towns (list-of Town?))))

38 CSG 71138 Style 1: display (define (trav br) (cases BusRoute br (a-BusRoute (name buses towns) (list name (trav-buses buses) (trav-towns towns))))) (define (trav-buses lob) (map trav-bus lob))

39 CSG 71139 Style 2: copy (define (cp br) (cases BusRoute br (a-BusRoute (name buses towns) (apply a-BusRoute (list name (cp-buses buses) (cp-towns towns)))))) (define (cp-buses lob) (map cp-bus lob))

40 CSG 71140 Summary phase 1 Language: strategies: A // B, class graphs, object graphs Semantics: FIRST: there exists object Interpreter: FIRST: there exists path in class graph Compiler: generated code is equivalent to a subgraph of class graph

41 CSG 71141 Visitors

42 CSG 71142 Visitors Several kinds: –Think of strategy as making a list out of an og. Fold on that list. (cg og s) -> list of target objects of s. (gather cg og s). (// CContainer CWeight) (+ (+ … (+ w2 (+ w1 0)) … ) –Think of visitor as having a suit case of variables in which they store data from their trip. Available as argument. –functions for nodes and edges. –multiple visitors.

43 CSG 71143 Type checking of hw programs check: Program =(Strategy x Visitor). (Program x ClassGraph) -> Bool Fundamental question: Given a program, with respect to which class graphs is it type correct. –Type checking: Given a class graph, is the program type correct? –Typability: Does there exist a class graph such that the program is type correct?

44 CSG 71144 Reference Class-graph Inference for Adaptive Programs, Jdens Palsberg, TAPOS 3 (2), 75-85, 1997.

45 CSG 71145 fix 27 semantics: go everywhere and collect ogs. then apply visitors general strats: exponentially many paths

Download ppt "CSG 7111 Structure and Interpretation of an Aspect Language for Datatype Karl Lieberherr."

Similar presentations

School of EECS, Peking University “Advanced Compiler Techniques” (Fall 2011) SSA Guo, Yao.

School of EECS, Peking University “Advanced Compiler Techniques” (Fall 2011) SSA Guo, Yao.
Introducing Formal Methods, Module 1, Version 1.1, Oct., 1998 1 Formal Specification and Analytical Verification L 5.

Introducing Formal Methods, Module 1, Version 1.1, Oct., Formal Specification and Analytical Verification L 5.
© 2006 Pearson Addison-Wesley. All rights reserved14 A-1 Chapter 14 excerpts Graphs (breadth-first-search)

© 2006 Pearson Addison-Wesley. All rights reserved14 A-1 Chapter 14 excerpts Graphs (breadth-first-search)
February 200592.3913 R. McFadyen1 Polymorphism Indirection Pure Fabrication Protected Variations (Law of Demeter) More GRASP Patterns.

February R. McFadyen1 Polymorphism Indirection Pure Fabrication Protected Variations (Law of Demeter) More GRASP Patterns.
Oct 200291.3913 R McFadyen1 Recall UML Class Diagram BusRoute BusStopList BusStop BusList BusPersonList Person passengers buses busStops waiting 0..*

Oct R McFadyen1 Recall UML Class Diagram BusRoute BusStopList BusStop BusList BusPersonList Person passengers buses busStops waiting 0..*
INTERPRETER Main Topics What is an Interpreter. Why should we learn about them.

INTERPRETER Main Topics What is an Interpreter. Why should we learn about them.
3/7/2003Bioinformatics1 How To Address Rapidly Changing Data Representations in an Evolving Scientific Domain Using Aspect-oriented Programming Techniques.

3/7/2003Bioinformatics1 How To Address Rapidly Changing Data Representations in an Evolving Scientific Domain Using Aspect-oriented Programming Techniques.
March 200692.3913 R. McFadyen1 Principle of Least Knowledge – page 265 Principle: talk only to your immediate friends Also called Law of Demeter (LoD)

March R. McFadyen1 Principle of Least Knowledge – page 265 Principle: talk only to your immediate friends Also called Law of Demeter (LoD)
Midterm Fall 2000 solutions. Question 1 From sentence to class dictionary abstraction In this case like from object graph to class graph abstraction because.

Midterm Fall 2000 solutions. Question 1 From sentence to class dictionary abstraction In this case like from object graph to class graph abstraction because.
1 Introduction to Software Engineering Lecture 42 – Communication Skills.

1 Introduction to Software Engineering Lecture 42 – Communication Skills.
Cse321, Programming Languages and Compilers 1 6/19/2015 Lecture #18, March 14, 2007 Syntax directed translations, Meanings of programs, Rules for writing.

Cse321, Programming Languages and Compilers 1 6/19/2015 Lecture #18, March 14, 2007 Syntax directed translations, Meanings of programs, Rules for writing.
Oct 21, 200291.3913 R. McFadyen1 Pure Fabrication P. 329+ Problem: You have a responsibility to assign to a class, but assigning it to a class in the conceptual.

Oct 21, R. McFadyen1 Pure Fabrication P Problem: You have a responsibility to assign to a class, but assigning it to a class in the conceptual.
Validating Streaming XML Documents Luc Segoufin & Victor Vianu Presented by Harel Paz.

Validating Streaming XML Documents Luc Segoufin & Victor Vianu Presented by Harel Paz.
CSE 373, Copyright S. Tanimoto, 2002 Up-trees - 1 Up-Trees Review of the UNION-FIND ADT Straight implementation with Up-Trees Path compression Worst-case.

CSE 373, Copyright S. Tanimoto, 2002 Up-trees - 1 Up-Trees Review of the UNION-FIND ADT Straight implementation with Up-Trees Path compression Worst-case.
UML class diagrams and XML schemas Karl Lieberherr UBS AG Northeastern University.

UML class diagrams and XML schemas Karl Lieberherr UBS AG Northeastern University.
3/7/2003Bioinformatics1 How To Address Rapidly Changing Data Representations in an Evolving Scientific Domain Using Aspect-oriented Programming Techniques.

3/7/2003Bioinformatics1 How To Address Rapidly Changing Data Representations in an Evolving Scientific Domain Using Aspect-oriented Programming Techniques.
Cost-based Optimization of Graph Queries Silke Trißl Humboldt-Universität zu Berlin Knowledge Management in Bioinformatics IDAR 2007.

Cost-based Optimization of Graph Queries Silke Trißl Humboldt-Universität zu Berlin Knowledge Management in Bioinformatics IDAR 2007.
2.2 A Simple Syntax-Directed Translator 1. 2 2.3 Syntax-Directed Translation 2.4 Parsing 2.5 A Translator for Simple Expressions 2.6 Lexical Analysis.

2.2 A Simple Syntax-Directed Translator Syntax-Directed Translation 2.4 Parsing 2.5 A Translator for Simple Expressions 2.6 Lexical Analysis.
Lesson 7-Creating and Changing Directories. Overview Using directories to create order. Managing files in directories. Using pathnames to manage files.

Lesson 7-Creating and Changing Directories. Overview Using directories to create order. Managing files in directories. Using pathnames to manage files.
程建群 博士(Dr. Jason Cheng) 年03月

程建群 博士(Dr. Jason Cheng) 年03月

Similar presentations

Ads by Google