DOCSLIB.ORG

Visitor-Oriented Programming

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Visitor-Oriented Programming Visitor-Oriented Programming Thomas VanDrunen Jens Palsberg Purdue University UCLA Computer Science Department Department of Computer Science 4531K Boelter Hall West Lafayette, IN 47907 Los Angeles, CA 90095 [email protected] [email protected] ABSTRACT tionality. This way we add behavior modularly. However, Multiple dispatching and the visitor pattern are approaches while introducing the benefit of functional programming to to making object-oriented programs more extensible. Both an object-oriented setting, we are also importing the liabil- have a flavor of pattern matching, thereby moving object- ity. Now we can no longer add classes easily. To use visitors oriented programming closer to functional programming. The for extension, we must in advance give each class an accept key idea of these approaches can be crystallized as a notion method (not to mention making sure that the visitor will of visitor which lies between functions and objects. Can have access to all internal data necessary for its task). More this idea be developed into a new form of visitor-oriented seriously, a visitor must know all the classes on which it will programming which combines the best of functional and operate [11]. The visit and accept methods are necessary object-oriented programming? As a first step, we present because using visitors is essentially using dynamic double a visitor calculus in which each value is a visitor and ev- dispatch| the correct method is selected based on both the ery visitor call uses double dispatching. We illustrate the acceptor's class and the visitor's class. Most object-oriented relationships to other paradigms by translating the lambda- languages support only single dispatch. calculus to the visitor calculus, and the visitor calculus to What we notice is that while a visitor is in fact an object, Java. Our calculus forms the core of a language in which we in a sense it can also be viewed as a function. A visitor is have programmed the translation of the lambda-calculus to related to both object-oriented and functional programming. the visitor calculus itself. To demonstrate the expressiveness We see a spectrum: of visitors, we show the translation in four versions that use Spectrum: function | visitor | object. smaller and smaller subsets of the language. Along the way, Is there a way we can exploit this approach to system build- we present correctness proofs and examples of running an ing so that we have the advantages of both paradigms, but implementation of our language. the disadvantages of neither? What we would like is a lan- guage designed specifically for programming with visitors, 1. INTRODUCTION where the visitor is the basic unit and the need for accept methods and precognition of acceptor classes is subsumed 1.1 Background by the language semantics, including rules for double dis- A program is a set of datatypes and a set of behaviors over patch. In other words, we would like a language where both cases of those datatypes. Maintaining a program requires datatypes and behaviors can be added modularly. extending the datatypes and their cases and extending the Various systems have been developed to study double dis- behaviors over them. We would like to to do this modu- patch and the visitor pattern. Millstein and Leavens [8] larly, that is, without recompiling the entire system each designed the Tuple language to show how to add multiple time an extension is made. This represents a well-known dispatch to conventional object-oriented languages cleanly, way of comparing programming paradigms and a dilemma letting the receiver of a method call be a tuple of objects in programming language design [12, 3, 7, 15]. In object- rather than a single object and selecting a method most spe- oriented languages, we can easily extend the datatypes by cific to those objects. If there is no appropriate method or writing new classes, including subclasses. Extending behav- no most specific method, such a call causes a message not ior, however, is difficult since methods are members of a understood or message ambiguous error, respectively. The class and so cannot be changed or added to without recom- second of these errors is a result of the dispatch being sym- piling that class. Functional programming takes the other metric. Generalizing to multimethods (any methods where side of the trade off. There, new functions on a datatype can dynamic dispatch depends on more than one argument), a be written and compiled separately, but once a datatype is multimethod is symmetric if all dispatching arguments are created, its cases are fixed. treated uniformly, that is, no argument has priority for de- The visitor pattern [5] is an attempt to solve this prob- termining an appropriate method. lem in an object-oriented paradigm; that is, it is a way Millstein and Chambers [9] presented Dubious, an object- to add functionality modularly without changing the set of oriented core language with symmetric multimethods. Du- datatypes. If we have a set of classes and determine that we bious uses a module system to reason about extensibility need new functionality for them, instead of adding a method and features a static type system which ensures that pro- to each and recompiling, we write a visitor class, with a grams that type check do not throw message not understood visit method for each class, which will perform that func- or message ambiguous errors. Functions are objects and thus are first-class. Similarly, Clifton, Leavens, Chambers, the way, we present correctness theorems and examples of and Millstein [2] presented MultiJava, also with symmetric running an implementation of Peripaton. multimethods, but with a class system like that of Java. A feature of MultiJava is the open class, a class to which 1.2.1 A visitor calculus methods can be added without changing the class directly. In our visitor calculus, each value is a visitor and every This offers an alternative to the visitor pattern in that new visitor call uses double dispatching. The grammar for Visi- functionality can be added to a class without the the prior Calc is as follows: planning needed to make infrastructure for visitors. In order to capture the flavor of the visitor pattern it- p ::= (c; e) programs self, double dispatching should be asymmetric| if a visitor e ::= expressions does not have a method that matches the class of an accep- (e e) invocations tor exactly but inherits a method that does, that method is j new t[e] creations chosen over a method it has which matches an ancestor class j x field references to the acceptor. Asymmetric semantics eliminates the pos- j acceptor parameter references sibility of a message ambiguous error since the precedence c ::= t : tfx; mg classes among arguments disambiguates the method selection. Fur- m ::= (t 7! e) method mappings thermore, a visitor class serving as an ancestor to all vis- A formal semantics will be presented in Section 3. For itors could contain a visit method for whatever class tops now, a VisiCalc program is a set of classes and a main ex- the class hierarchy (such as Object in Java; in a language pression. Each class defines a visitor type; a class definition designed specifically for visitors, this may be the visitor contains a name for the class, the class's parent, a list of class itself) and ensure no message will not be understood. fields, and a list of methods. Methods do not have names, which is convenient for a core calculus and formal reasoning but are identified by the type of a dispatching parameter (we since eliminating the possibility of the computation causing can think of each method having the name visit, and there an error allows us to focus on the computation itself. >From can be at most one such method for any parameter type). a practical software engineering point of view, symmetric The parameter is referred to by acceptor; intuitively, the double dispatching may be preferable; however, in this pa- callee or receiver of the method has a visitor, and the pa- per, we will pursue the asymmetric variant, to keep it close rameter is the acceptor. (One could easily reverse this and to the visitor pattern. call the methods \accept" and the parameter \visitor," if Dubious is classless but uses a module system that is good the reader finds that more in line with his experience with for what it formalizes|modules; a core calculus that focuses the visitor pattern.) on visitor behavior, however, would be more tractable with- When a method is called, (e1 e2), the method mappings out them and without the full programming language fea- for in the definition of e1's class are searched for a method tures of MultiJava. We would further like a calculus that can matching e2's type. If none are found, the methods of e1's be related to both functional and object-oriented paradigms parent class are searched, and so forth. If no appropriate by encodings among representative languages, demonstrated method is found among e1's class and all its ancestors, then by correctness proofs and implementations. we do a similar search for a method appropriate for e2's Castagna, Ghelli, and Longo [1] studied the λ&-calculus of parent class. This entire process will terminate because we overloaded functions with multiple dispatching. While mo- assume a pre-defined class visitor that is at the top of tivated by object-oriented programming, the λ&-calculus is the class hierarchy, as Object in Java, which has a method purely functional. In the λ&-calculus, an overloaded func- appropriate for any parameter, returning that parameter. tion is essentially a set of functions, and an overloaded- Here is the translation of the λ-term λx.x: function call uses dispatching via the types of its members.
Load more

Recommended publications
  • 1 Design Pattern for Open Class (DRAFT) 2 Abstract Factory
    1 Design Pattern for Open Class (DRAFT) Tanaka Akira <[email protected]> A design pattern describes a software architecture which is reusable and exten- sible. [GoF] is the book containing 23 design patterns for OOP languages like C++ and Java. [GoF] describes several trade offs of the patterns. In C++ and Java, a class is defined by only one module. However, there are languages which can define a class by two or more modules: Cecil, MultiJava, AspectJ, MixJuice, CLOS, Ruby, etc. Such class is called "open class" because it is extensible by modules implemented later [Chambers]. For languages with open class, more extensible and/or simpler design patterns exists. We studied design patterns with open class for each GoF design patterns. In this paper, we describe two patterns: the Abstract Factory pattern and the Visitor pattern. 2 Abstract Factory The Abstract Factory pattern is a design pattern for separating class names from the code which generates the object group of related classes for making them configurable. Following figure is the class diagram of the Abstract Factory pattern. Since the example described in [GoF] uses only one concrete factory for each binaries, the required concrete factory is selected statically. The example builds two binaries for Motif and Presentation Manager from a single source code. Two concrete factories are exist for Motif and Presentation Manager. When a binary is built, it is selected which concrete factory is linked. Such static selection can be implemented with the fewer number of classes by open class as following modules. • The module which defines Window and ScrollBar class and their methods which is independent to window systems.
    [Show full text]
  • Tree Visitors in Clojure Update the Java Visitor Pattern with Functional Zippers
    Tree visitors in Clojure Update the Java Visitor pattern with functional zippers Skill Level: Intermediate Alex Miller ([email protected]) Senior Engineer Revelytix 20 Sep 2011 JVM language explorer Alex Miller has recently discovered the benefits of implementing the Visitor pattern using Clojure, a functional Lisp variant for the Java Virtual Machine. In this article, he revisits the Visitor pattern, first demonstrating its use in traversing tree data in Java programs, then rewriting it with the addition of Clojure's functional zippers. I’ve used trees of domain objects in my Java applications for many years. More recently, I’ve been using them in Clojure. In each case, I've found that the Visitor pattern is a reliable tool for manipulating trees of data. But there are differences in how the pattern works in a functional versus object-oriented language, and in the results it yields. About Clojure Clojure is a dynamic and functional programming language variant of Lisp, written specifically for the JVM. Learn more about Clojure on developerWorks: •"The Clojure programming language" •"Clojure and concurrency" •"Solving the Expression Problem with Clojure 1.2" •"Using CouchDB with Clojure" In this article, I revisit domain trees and the Visitor pattern for the Java language, Tree visitors in Clojure Trademarks © Copyright IBM Corporation 2011 Page 1 of 27 developerWorks® ibm.com/developerWorks then walk through several visitor implementations using Clojure. Being a functional language, Clojure brings new tricks to data query and manipulation. In particular, I've found that integrating functional zippers into the Visitor pattern yields efficiency benefits, which I explore.
    [Show full text]
  • Object-Oriented Desgin Visitor Pattern George Blankenship 1
    Object-Oriented Desgin Visitor Pattern CSCI 253 Object Oriented Design: Visitor Pattern George Blankenship Visitor Pattern George Blankenship 1 Overview Creational Patterns Structural Patterns Behavioral Patterns Singleton Composite Chain of Respons. Abstract factory Façade Command Factory Method Proxy Interpreter Prototype Flyweight Iterator Builder Mediator Adapter Memento Bridge Observer Decorator State Strategy Template Method Visitor Pattern George Blankenship Visitor 2 The Elements of a Design Pattern • A pattern name • The problem that the pattern solves – Including conditions for the pattern to be applicable • The solution to the problem brought by the pattern – The elements (classes-objects) involved, their roles, responsibilities, relationships and collaborations – Not a particular concrete design or implementation • The consequences of applying the pattern – Time and space trade off – Language and implementation issues – Effects on flexibility, extensibility, portability Visitor Pattern George Blankenship 3 George Blankenship 1 Object-Oriented Desgin Visitor Pattern The Visitor Pattern: The Problem Represents an operation to be performed on the elements of an object structure. Visitor lets you define a new operation without changing the classes of the elements on which it operates • many distinct and unrelated operations need to be performed on objects in an object structure an you want to avoid “polluting” their classes with these operations • the classes defining the object structure rarely change but you often want to define new operations over the structure Visitor Pattern George Blankenship 4 Visitor Example • The root of the structure accepts a visitor: root.accept( visitor ) • The root and every child object in the structure have a an accept method: void accept( visitor ) { visitor.visit( this ); for each child of mine child.accept( visitor ) next } • In short order our visitor gets a visit() call from each object in the collection.
    [Show full text]
  • Designpatternsphp Documentation Release 1.0
    DesignPatternsPHP Documentation Release 1.0 Dominik Liebler and contributors Jul 18, 2021 Contents 1 Patterns 3 1.1 Creational................................................3 1.1.1 Abstract Factory........................................3 1.1.2 Builder.............................................8 1.1.3 Factory Method......................................... 13 1.1.4 Pool............................................... 18 1.1.5 Prototype............................................ 21 1.1.6 Simple Factory......................................... 24 1.1.7 Singleton............................................ 26 1.1.8 Static Factory.......................................... 28 1.2 Structural................................................. 30 1.2.1 Adapter / Wrapper....................................... 31 1.2.2 Bridge.............................................. 35 1.2.3 Composite............................................ 39 1.2.4 Data Mapper.......................................... 42 1.2.5 Decorator............................................ 46 1.2.6 Dependency Injection...................................... 50 1.2.7 Facade.............................................. 53 1.2.8 Fluent Interface......................................... 56 1.2.9 Flyweight............................................ 59 1.2.10 Proxy.............................................. 62 1.2.11 Registry............................................. 66 1.3 Behavioral................................................ 69 1.3.1 Chain Of Responsibilities...................................
    [Show full text]
  • Permissions, Visitor Pattern
    Selected Topics in Object Oriented Programming Lecture 3: More OOP principles Leonid Barenboim Permissions Permissions define the areas within a program from which a feature (field/ method) can be accessed: private – only within the same class. protected - only within the class and its subclasses. public – from everywhere. Permission in java Java use somewhat different rules: private – only within the same class. package – only within the same package. protected – within the same package and within the subclasses outside the package. public – from everywhere. Selecting the right permission The principle of encapsulation suggests the following rules: All non-static fields should be private Service methods should be public Helper methods should be private/protected Permission rules in specific languages Smalltalk – all fields are private all methods are public Scripting languages (e.g., python) - No permissions! - Everything is public! The Visitor Pattern Reminder: Polymorphism Reminder: Polymorphism Animal animal; animal = new Dog; Animal * animal.say(); \\ “Woof” animal = new Cat; + say() * animal.say(); \\ “Miau” Cat Dog + say() + say() System.out.println(“Miau”) System.out.println(“Woof”) What happens if a method accepts an argument? boolean b; Animal * Animal cat = new Cat(); Animal mouse = new + say() * Mouse(); + eats(mouse: Mouse) : bool * b = cat.eats(mouse); + eats(cat: Cat) : bool * //compilation error Cat Mouse + say() + say() +eats(mouse : Mouse) : bool +eats(mouse : Mouse) : bool +eats(cat : Cat) : bool +eats(cat : Cat) : bool No support for polymorphism of arguments • Java (and many other languages) supports only polymorphism of the receiver (the variable on which the method is invoked). • Polymorphism of the receiver is performed using single dispatch. • Polymorphism of arguments is performed using multiple-level dispatch, which is resource consuming.
    [Show full text]
  • Design Patterns in Ocaml
    Design Patterns in OCaml Antonio Vicente [email protected] Earl Wagner [email protected] Abstract The GOF Design Patterns book is an important piece of any professional programmer's library. These patterns are generally considered to be an indication of good design and development practices. By giving an implementation of these patterns in OCaml we expected to better understand the importance of OCaml's advanced language features and provide other developers with an implementation of these familiar concepts in order to reduce the effort required to learn this language. As in the case of Smalltalk and Scheme+GLOS, OCaml's higher order features allows for simple elegant implementation of some of the patterns while others were much harder due to the OCaml's restrictive type system. 1 Contents 1 Background and Motivation 3 2 Results and Evaluation 3 3 Lessons Learned and Conclusions 4 4 Creational Patterns 5 4.1 Abstract Factory . 5 4.2 Builder . 6 4.3 Factory Method . 6 4.4 Prototype . 7 4.5 Singleton . 8 5 Structural Patterns 8 5.1 Adapter . 8 5.2 Bridge . 8 5.3 Composite . 8 5.4 Decorator . 9 5.5 Facade . 10 5.6 Flyweight . 10 5.7 Proxy . 10 6 Behavior Patterns 11 6.1 Chain of Responsibility . 11 6.2 Command . 12 6.3 Interpreter . 13 6.4 Iterator . 13 6.5 Mediator . 13 6.6 Memento . 13 6.7 Observer . 13 6.8 State . 14 6.9 Strategy . 15 6.10 Template Method . 15 6.11 Visitor . 15 7 References 18 2 1 Background and Motivation Throughout this course we have seen many examples of methodologies and tools that can be used to reduce the burden of working in a software project.
    [Show full text]
  • On the Interaction of Object-Oriented Design Patterns and Programming
    On the Interaction of Object-Oriented Design Patterns and Programming Languages Gerald Baumgartner∗ Konstantin L¨aufer∗∗ Vincent F. Russo∗∗∗ ∗ Department of Computer and Information Science The Ohio State University 395 Dreese Lab., 2015 Neil Ave. Columbus, OH 43210–1277, USA [email protected] ∗∗ Department of Mathematical and Computer Sciences Loyola University Chicago 6525 N. Sheridan Rd. Chicago, IL 60626, USA [email protected] ∗∗∗ Lycos, Inc. 400–2 Totten Pond Rd. Waltham, MA 02154, USA [email protected] February 29, 1996 Abstract Design patterns are distilled from many real systems to catalog common programming practice. However, some object-oriented design patterns are distorted or overly complicated because of the lack of supporting programming language constructs or mechanisms. For this paper, we have analyzed several published design patterns looking for idiomatic ways of working around constraints of the implemen- tation language. From this analysis, we lay a groundwork of general-purpose language constructs and mechanisms that, if provided by a statically typed, object-oriented language, would better support the arXiv:1905.13674v1 [cs.PL] 31 May 2019 implementation of design patterns and, transitively, benefit the construction of many real systems. In particular, our catalog of language constructs includes subtyping separate from inheritance, lexically scoped closure objects independent of classes, and multimethod dispatch. The proposed constructs and mechanisms are not radically new, but rather are adopted from a variety of languages and programming language research and combined in a new, orthogonal manner. We argue that by describing design pat- terns in terms of the proposed constructs and mechanisms, pattern descriptions become simpler and, therefore, accessible to a larger number of language communities.
    [Show full text]
  • A Survey of Design Pattern Based Web Applications
    JOURNAL OF OBJECT TECHNOLOGY Online at http://www.jot.fm. Published by ETH Zurich, Chair of Software Engineering ©JOT, 2009 Vol. 8, No. 2, March-April 2009 A Survey of Design Pattern Based Web Applications Sridaran R, Campus Head, ICFAI National College, Vellore-632 006 India. Padmavathi G, Professor and Head, Department of Computer Science, Avinashilingam University for Women, Coimbatore-641 043, India. Iyakutti K, Senior Professor, School of Physics, Madurai Kamaraj University, Madurai-625 019, India. Abstract Pattern-based web applications have become popular since they promote reusability and consistency. In few cases, patterns do not produce the desired effect because of lack of experience in applying them. This situation forces one to think of a suitable re- engineering solution for such applications. The objectives of the paper are three fold. It provides a survey of different pattern-based web applications that will be useful for the application designers. It highlights some of the web applications where patterns have been inappropriately handled. A few re-engineering initiatives for such cases are also analyzed. Key Words: Patterns, Web Applications, Re-engineering, Hypermedia, Semantic web, Partitioning. 1 INTRODUCTION Web application designers need to address many challenges during development in order to comply the quality of service requirements including speed, scalability and security. In recent years numerous non-web based applications have been re-written as web based because of the ever growing business needs. These migration activities are much more complicated and time consuming than a new software development. Most of these challenges are with data handling, organizing, or structuring of the web applications.
    [Show full text]
  • Design Pattern Implementation in Java and Aspectj
    Design Pattern Implementation in Java and AspectJ Jan Hannemann Gregor Kiczales University of British Columbia University of British Columbia 201-2366 Main Mall 201-2366 Main Mall Vancouver B.C. V6T 1Z4 Vancouver B.C. V6T 1Z4 jan [at] cs.ubc.ca gregor [at] cs.ubc.ca ABSTRACT successor in the chain. The event handling mechanism crosscuts the Handlers. AspectJ implementations of the GoF design patterns show modularity improvements in 17 of 23 cases. These improvements When the GoF patterns were first identified, the sample are manifested in terms of better code locality, reusability, implementations were geared to the current state of the art in composability, and (un)pluggability. object-oriented languages. Other work [19, 22] has shown that implementation language affects pattern implementation, so it seems The degree of improvement in implementation modularity varies, natural to explore the effect of aspect-oriented programming with the greatest improvement coming when the pattern solution techniques [11] on the implementation of the GoF patterns. structure involves crosscutting of some form, including one object As an initial experiment we chose to develop and compare Java playing multiple roles, many objects playing one role, or an object [27] and AspectJ [25] implementations of the 23 GoF patterns. playing roles in multiple pattern instances. AspectJ is a seamless aspect-oriented extension to Java, which means that programming in AspectJ is effectively programming in Categories and Subject Descriptors Java plus aspects. D.2.11 [Software Engineering]: Software Architectures – By focusing on the GoF patterns, we are keeping the purpose, patterns, information hiding, and languages; D.3.3 intent, and applicability of 23 well-known patterns, and only allowing [Programming Languages]: Language Constructs and Features – the solution structure and solution implementation to change.
    [Show full text]
  • Mutable Class Design Pattern Nikolay Malitsky Nova Southeastern University, [email protected]
    Nova Southeastern University NSUWorks CEC Theses and Dissertations College of Engineering and Computing 2016 Mutable Class Design Pattern Nikolay Malitsky Nova Southeastern University, [email protected] This document is a product of extensive research conducted at the Nova Southeastern University College of Engineering and Computing. For more information on research and degree programs at the NSU College of Engineering and Computing, please click here. Follow this and additional works at: https://nsuworks.nova.edu/gscis_etd Part of the Other Computer Sciences Commons, and the Theory and Algorithms Commons Share Feedback About This Item NSUWorks Citation Nikolay Malitsky. 2016. Mutable Class Design Pattern. Doctoral dissertation. Nova Southeastern University. Retrieved from NSUWorks, College of Engineering and Computing. (956) https://nsuworks.nova.edu/gscis_etd/956. This Dissertation is brought to you by the College of Engineering and Computing at NSUWorks. It has been accepted for inclusion in CEC Theses and Dissertations by an authorized administrator of NSUWorks. For more information, please contact [email protected]. Mutable Class Design Pattern by Nikolay Malitsky A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science Graduate School of Computer and Information Sciences Nova Southeastern University 2016 We hereby certify that this dissertation, submitted by Nikolay Malitsky, conforms to acceptable standards and is fully adequate in scope and quality to fulfill the dissertation requirements for the degree of Doctor of Philosophy. _____________________________________________ ________________ Michael J. Laszlo, Ph.D. Date Chairperson of Dissertation Committee _____________________________________________ ________________ Francisco J. Mitropoulos, Ph.D. Date Dissertation Committee Member _____________________________________________ ________________ Amon B.
    [Show full text]
  • Design Pattern Driven Development of Model Transformations
    DESIGN PATTERN DRIVEN DEVELOPMENT OF MODEL TRANSFORMATIONS by HUSEYIN ERGIN JEFF GRAY, COMMITTEE CHAIR JEFFREY CARVER RALF LAEMMEL RANDY SMITH EUGENE SYRIANI SUSAN VRBSKY A DISSERTATION Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Computer Science in the Graduate School of The University of Alabama TUSCALOOSA, ALABAMA 2017 Copyright Huseyin Ergin 2017 ALL RIGHTS RESERVED ABSTRACT Model-Driven Engineering (MDE) is considered a well-established software development ap- proach that uses abstraction to bridge the gap between the problem space and the software implementation. These abstractions are represented by models that make the validation of the real system easier. In MDE, many problems are solved using model transformation, which is a paradigm that manipulates high-level models to translate, evolve, or simulate them. However, the development of a model transformation for a specific problem is still a hard task. The main reason is the lack of a development process where transformations must be designed before implemented. Design patterns provide experiential reuse to soft- ware engineers when faced with recurring problems. In the literature, design patterns have been used to generate partially reusable software designs in order to help developers. There are many design patterns focused development methodologies proposed. However, most of them specialize in object-oriented design patterns. Given the various contexts in which de- sign patterns have been applied, model transformations may also benefit from a patterns approach. Although several studies have proposed design patterns for model transforma- tion, there is still no accepted common language to express them or a methodology that places design patterns at the heart of the development of model transformations.
    [Show full text]
  • Two Implementation Techniques for Domain Specific Languages
    University of Amsterdam Faculty of Science Master’s Thesis Two implementation techniques for Domain Specific Languages compared: OMeta/JS vs. JavaScript Author: Host organization: Nickolas Heirbaut Centrum Wiskunde & Informatica Date approval: Supervisor: 8 October 2009 Dr. Tijs Van Der Storm Contents Abstract 4 Preface 5 1 Introduction 6 1.1 Motivation ....................................... 6 1.2 Research questions ................................... 7 1.3 Organization of this thesis ............................... 7 2 Background and context 8 2.1 Domain-specific languages ............................... 8 2.1.1 Introduction .................................. 8 2.1.2 Development phases .............................. 9 2.1.3 Implementation strategies ........................... 10 2.2 OMeta .......................................... 13 2.2.1 Introduction .................................. 13 2.2.2 Parsing Expression Grammar ......................... 13 2.2.3 OMeta: an extended PEG ........................... 16 2.3 Waebric ......................................... 19 2.3.1 Introduction .................................. 19 2.3.2 Example ..................................... 19 2.3.3 Embedded markup ............................... 20 2.3.4 Juxtaposition .................................. 21 2.3.5 Around parameterization ........................... 21 1 3 Research method 23 3.1 Maintainability ..................................... 25 3.1.1 Program code metrics ............................. 25 3.1.2 Grammar metrics ...............................
    [Show full text]