DOCSLIB.ORG

Design Principles for Internal Domain-Specific Languages: A

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Design Principles for Internal Domain-Specific Languages: A Design Principles for Internal Domain-Specific Languages: A Pattern Catalog Illustrated by Ruby Sebastian Günther, School of Computer Science, University of Magdeburg and Thomas Cleenewerck, Software Language Engineering Lab, Vrije Universiteit Brussel Some programming languages, especially dynamic programming languages, offer suitable mechanisms for the construction of internal domain-specific languages (DSL). Internal DSLs inherit the facilities of their host language such as the availability of libraries, frameworks, tool support, and other DSLs. When developing an internal DSL, there are two challenges. First, to cope with the host language’s syntactic and semantic restrictions. Careful and thoughtful extensions and modifications of the host language are crucial to overcome these restrictions without reverting to poor language design. Second, to support several design principles that are genuine for a DSL. Although there is an extensive body of knowledge about DSL design principles and desirable quality properties, it remains difficult to apply them, or to reason about whether a particular DSL exhibits specific desirable principles. Our objective is to put the two perspectives together. We research the most important design principles of a DSL and show how different patterns can be used to support these principles. This allows us to produce an extensive pattern catalog which is the foundation of principled approach for designing internal DSLs. The patterns can be used to assess the design quality of a DSL and structure its implementation. In particular, we show a complex DSL example illustrating each principle and the corresponding patterns. While we stick to Ruby for the explanation and application of the patterns, we also name known uses in Python, Scala, and Smalltalk. Patterns are explained with their context, problem, forces, solution, and consequences. We also explain the patterns with the classical structure of intent, motivation, forces, implementation and their consequences. Finally we reflect upon the pattern utilization by discussing their strengths and weaknesses. Categories and Subject Descriptors: D.3.3 [Programming Languages]: Language Constructs and Features—Patterns General Terms: Design Additional Key Words and Phrases: design principles, domain-specific languages, dynamic programming languages 1. INTRODUCTION Domain-specific languages are programming languages or executable specification languages that offer, through appropriate notations and abstractions, expressive power tailored for a specific problem domain or application area [Van Deursen et al. 2000; Hudak 1998]. At the implementation level, two different types of DSLs can be identified. Specially crafted external DSLs require their own parsers, interpreter or compilers, while internal DSLs are built on top of an existing programming language (called the host language), allowing them to reuse the host language’s infrastructure including IDEs and compilers [Mernik et al. 2005]. DSL are a common practice in software engineering as several examples show [Arnold et al. 1995; Groote et al. 1995; Thibault et al. 1997; Latry et al. 2007; Munnelly and Clarke 2008]. The wide spectrum of domains, internal DSLs, and external DSLs, is threatening to deteriorate the original meaning of the term DSL. The term is applied often and without to much consideration what the properties of a Author’s address: Sebastian Günther, Universitätsplatz 2, D-39106 Magdeburg, Germany, email: [email protected]; Thomas Cleenewerck, Vrije Universiteit Brussel, Faculty of Sciences, DINF - SOFT, Pleinlaan 2, B-1050 Brussels, Belgium, email: [email protected] Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee pro- vided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full cita- tion on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permis- sion. A preliminary version of this paper was presented in a writers’ workshop at the 17th Conference on Pattern Languages of Programs (PLoP). PLoP’10, October 16-18, Reno, Nevada, USA. Copyright 2010 is held by the author(s). ACM 978-1-4503-0107-7 PLoP’10, October 16-18, Reno, Nevada, USA. Copyright 2010 is held by the author(s). ACM 978-1-4503-0107-7 DSL are. Analyzing the relevant literature [Mernik et al. 2005; Tanter 2008; Ladd and Ramming 1994; Weinberg 1971; Coplien 1999], however, reveals that there are several design and implementation principles of DSLs such as abstraction to make domain concepts explicit programming language constructs, absorption to integrate implicit and common domain knowledge in the DSL, or compression to yield a concise domain notation. While these principles are general enough to provide guidelines for the design and implementation of a DSL, it is rather hard to explain whether an implemented DSL supports or embodies these principles. It is also difficult to plan the implementation upfront without a sophisticated language that allows expressing design decisions with respect to the principles. Hence the question: how to achieve this? We argue that the careful selection and application of patterns help here. Patterns support the DSL implementation by embodying these principles. By providing a deep understanding of the design principles together with a pattern catalog, we facilitate the planning and implementation of DSLs that exhibit the design principles. This paper’s contribution is a rich pattern catalog that helps to approach DSL design based on a set of design principles. Through using the patterns that adhere to the design principles, the design quality of a DSL can be assessed. To the best of our knowledge, this particular combination of principles and patterns has not been elaborated in other literature yet. For feasibility of this first-hand analysis, the paper focuses upon selected principles and illustrates the application of patterns grouped into form (alternative syntactic forms for the expressions), modification (small changes to the language, like the provision of aliases), and support. The patterns are illustrated using the Ruby programming language and two internal DSL designed within this language. However, the patterns are available in other programming languages too, which we show for Python, Scala, and Smalltalk by pointing to known uses. The paper is intended for novice as well as experienced DSL engineers. For experienced DSL engineers our work consolidates the design qualities of their DSLs enabling them to learn and improve their DSL designs. Novice DSL designers can use the principled pattern approach as a reference work to create internal DSLs. We structure the paper as follows. Section 2 explains the used pattern structure and grouping. In Section 3, the design principles are explained. Sections 4 to 6 list the patterns with their intent, motivation, forces, structure, consequences, and additional known uses outside the herein presented examples. Section 7 revisits the design principles and, using a larger DSL examples, shows how the patterns are used in combination to design a DSL with respect to the principle. Section 8 discusses our experiences in using combinations of patterns and their influence on all principles. Section 9 explains the related work and finally Section 10 summarizes this paper. We apply following formats: keywords, design principles, and PATTERNS. 2. PATTERN STRUCTURE AND COMMON EXAMPLE 2.1 Pattern Structure The pattern explanation has a structure that is close to the initial introduction of patterns [Gamma et al. 1997] and recent publications [Guerra et al. 2009; Correia et al. ; Zdun and Strembeck 2009]. The following structure is used to explain each pattern: — Context: Explains the coarse situation in which the pattern is applied. — Problem: A question expressing the central concern the pattern addresses. — Design Impact: Explains which principles are realized by applying this pattern and explains the particular achieved result. — Instructions: Explanation what language mechanisms are used to provide a solution. — Example: Based on the common examples, a detailed utilization of the pattern using the Ruby programming language is given. Source code examples and sometimes diagrams provide further illustration (see Figure 1 for used symbols). Design Principles for Internal Domain-Specific Languages:A Pattern Catalog Illustrated by Ruby — Page 2 «Module» Modules; changed modules are depic- ted as Module’ Class Classes; changed classes are depicted -#local_variable as Class’, and changed methods are -class_variable depicted as method’ Object Objects; changed objects are depicted as Object’ Class/instance relationship Class/subclass relationship Module/inclusion relationship Represents the border between two program status define_method :method do Executed code attached to the ... respective object using a dashed line end Method or symbol pointer X Blocked method or symbol pointer Fig. 1: Symbols used to explain the pattern’s structure. — Implementation Impact: Explains how this pattern’s utilization impacts the DSL implementation or the DSL itself. — Known Uses: List of applications that use this particular pattern, given for Ruby [Flanagan and Matsumoto 2008; Thomas et al. 2009], Python [Lutz 2009; Summerfield 2010], Scala [Odersky et al. 2008; Wampler and Payne 2009], and Smalltalk [Sharp 1997; Black et al. 2009a; 2009b]. The analyzed DSLs are listed in the next
Load more

Recommended publications
  • MANNING Greenwich (74° W
    Object Oriented Perl Object Oriented Perl DAMIAN CONWAY MANNING Greenwich (74° w. long.) For electronic browsing and ordering of this and other Manning books, visit http://www.manning.com. The publisher offers discounts on this book when ordered in quantity. For more information, please contact: Special Sales Department Manning Publications Co. 32 Lafayette Place Fax: (203) 661-9018 Greenwich, CT 06830 email: [email protected] ©2000 by Manning Publications Co. All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by means electronic, mechanical, photocopying, or otherwise, without prior written permission of the publisher. Many of the designations used by manufacturers and sellers to distinguish their products are claimed as trademarks. Where those designations appear in the book, and Manning Publications was aware of a trademark claim, the designations have been printed in initial caps or all caps. Recognizing the importance of preserving what has been written, it is Manning’s policy to have the books we publish printed on acid-free paper, and we exert our best efforts to that end. Library of Congress Cataloging-in-Publication Data Conway, Damian, 1964- Object oriented Perl / Damian Conway. p. cm. includes bibliographical references. ISBN 1-884777-79-1 (alk. paper) 1. Object-oriented programming (Computer science) 2. Perl (Computer program language) I. Title. QA76.64.C639 1999 005.13'3--dc21 99-27793 CIP Manning Publications Co. Copyeditor: Adrianne Harun 32 Lafayette
    [Show full text]
  • Java/Java Packages.Htm Copyright © Tutorialspoint.Com
    JJAAVVAA -- PPAACCKKAAGGEESS http://www.tutorialspoint.com/java/java_packages.htm Copyright © tutorialspoint.com Packages are used in Java in order to prevent naming conflicts, to control access, to make searching/locating and usage of classes, interfaces, enumerations and annotations easier, etc. A Package can be defined as a grouping of related types classes, interfaces, enumerationsandannotations providing access protection and name space management. Some of the existing packages in Java are:: java.lang - bundles the fundamental classes java.io - classes for input , output functions are bundled in this package Programmers can define their own packages to bundle group of classes/interfaces, etc. It is a good practice to group related classes implemented by you so that a programmer can easily determine that the classes, interfaces, enumerations, annotations are related. Since the package creates a new namespace there won't be any name conflicts with names in other packages. Using packages, it is easier to provide access control and it is also easier to locate the related classes. Creating a package: While creating a package, you should choose a name for the package and include a package statement along with that name at the top of every source file that contains the classes, interfaces, enumerations, and annotation types that you want to include in the package. The package statement should be the first line in the source file. There can be only one package statement in each source file, and it applies to all types in the file. If a package statement is not used then the class, interfaces, enumerations, and annotation types will be placed in the current default package.
    [Show full text]
  • Quick Start Guide for Java Version 5.0
    Quick Start Guide for Java Version 5.0 Copyright © 2020 Twin Oaks Computing, Inc. Castle Rock, CO 80104 All Rights Reserved Welcome CoreDX DDS Quick Start Guide for Java Version 5.0 Nov 2020 Welcome to CoreDX DDS, a high-performance implementation of the OMG Data Distribution Service (DDS) standard. The CoreDX DDS Publish-Subscribe messaging infrastructure provides high-throughput, low-latency data communications. This Quick Start will guide you through the basic installation of CoreDX DDS, including installation and compiling and running an example Java application. You will learn how easy it is to integrate CoreDX DDS into an application. This Quick Start Guide is tailored for Java applications, and the examples differ slightly for other languages. Installation First things first: get CoreDX DDS onto your development system! Here’s what you need to do: 1. Once you have obtained CoreDX DDS from Twin Oaks Computing (or from the Eval CD), unpack the appropriate distribution for your machine somewhere on your system. We’ll refer to this directory throughout this guide as COREDX_HOME. For example, on a UNIX system this command will extract the distribution into the current directory: gunzip –c coredx-5.0.0-Linux_2.6_x86_64_gcc5-Release.tgz | tar xf – CoreDX DDS is available for multiple platform architectures, and multiple platform architectures of CoreDX DDS can be installed in the same top level (COREDX_TOP) directory. The directory structure under COREDX_TOP will look like: 2. If you are using an evaluation copy of CoreDX DDS, follow the instructions you received when you downloaded the software to obtain an evaluation license.
    [Show full text]
  • Importance of DNS Suffixes and Netbios
    Importance of DNS Suffixes and NetBIOS Priasoft DNS Suffixes? What are DNS Suffixes, and why are they important? DNS Suffixes are text that are appended to a host name in order to query DNS for an IP address. DNS works by use of “Domains”, equitable to namespaces and usually are a textual value that may or may not be “dotted” with other domains. “Support.microsoft.com” could be considers a domain or namespace for which there are likely many web servers that can respond to requests to that domain. There could be a server named SUPREDWA.support.microsoft.com, for example. The DNS suffix in this case is the domain “support.microsoft.com”. When an IP address is needed for a host name, DNS can only respond based on hosts that it knows about based on domains. DNS does not currently employ a “null” domain that can contain just server names. As such, if the IP address of a server named “Server1” is needed, more detail must be added to that name before querying DNS. A suffix can be appended to that name so that the DNS sever can look at the records of the domain, looking for “Server1”. A client host can be configured with multiple DNS suffixes so that there is a “best chance” of discovery for a host name. NetBIOS? NetBIOS is an older Microsoft technology from a time before popularity of DNS. WINS, for those who remember, was the Microsoft service that kept a table of names (NetBIOS names) for which IP address info could be returned.
    [Show full text]
  • Bigraphical Domain-Specific Language (BDSL): User Manual BDSL Version: V1.0-SNAPSHOT
    >_ Interpreter CLI BDSL BDSL User Manual BDSL v1.0-SNAPSHOT 1 Bigraphical Domain-specific Language (BDSL): User Manual BDSL Version: v1.0-SNAPSHOT Dominik Grzelak∗ Software Technology Group Technische Universit¨at Dresden, Germany Abstract This report describes Bigraphical DSL (BDSL), a domain-specific language for reactive systems, rooted in the mathematical spirit of the bigraph theory devised by Robin Milner. BDSL is not only a platform-agnostic programming language but also a development framework for reactive applications, written in the Java program- ming language, with a focus on stability and interoperability. The report serves as a user manual mainly elaborating on how to write and execute BDSL programs, further covering several features such as how to incorporate program verification. Moreover, the manual procures some best practices on design patterns in form of code listings. The BDSL development framework comes with a ready- to-use interpreter and may be a helpful research tool to experiment with the underlying bigraph theory. The framework is further in- tended for building reactive applications and systems based on the theory of bigraphical reactive systems. This report is ought to be a supplement to the explanation on the website www.bigraphs.org. The focus in this report lies in the basic usage of the command-line interpreter and mainly refers to the features available for the end-user, thus, providing a guidance for taking the first steps. It does not cover programmatic implementation details in great detail of the whole BDSL Interpreter Framework that is more suited to developers. Acknowledgment This research project is funded by the German Research Foundation (DFG, Deutsche Forschungsgemeinschaft) as part of Germany's Excel- lence Strategy { EXC 2050/1 { Project ID 390696704 { Cluster of Ex- cellence "Centre for Tactile Internet with Human-in-the-Loop" (CeTI) of Technische Universit¨at Dresden.
    [Show full text]
  • Java: Odds and Ends
    Computer Science 225 Advanced Programming Siena College Spring 2020 Topic Notes: More Java: Odds and Ends This final set of topic notes gathers together various odds and ends about Java that we did not get to earlier. Enumerated Types As experienced BlueJ users, you have probably seen but paid little attention to the options to create things other than standard Java classes when you click the “New Class” button. One of those options is to create an enum, which is an enumerated type in Java. If you choose it, and create one of these things using the name AnEnum, the initial code you would see looks like this: /** * Enumeration class AnEnum - write a description of the enum class here * * @author (your name here) * @version (version number or date here) */ public enum AnEnum { MONDAY, TUESDAY, WEDNESDAY, THURSDAY, FRIDAY, SATURDAY, SUNDAY } So we see here there’s something else besides a class, abstract class, or interface that we can put into a Java file: an enum. Its contents are very simple: just a list of identifiers, written in all caps like named constants. In this case, they represent the days of the week. If we include this file in our projects, we would be able to use the values AnEnum.MONDAY, AnEnum.TUESDAY, ... in our programs as values of type AnEnum. Maybe a better name would have been DayOfWeek.. Why do this? Well, we sometimes find ourselves defining a set of names for numbers to represent some set of related values. A programmer might have accomplished what we see above by writing: public class DayOfWeek { public static final int MONDAY = 0; public static final int TUESDAY = 1; CSIS 225 Advanced Programming Spring 2020 public static final int WEDNESDAY = 2; public static final int THURSDAY = 3; public static final int FRIDAY = 4; public static final int SATURDAY = 5; public static final int SUNDAY = 6; } And other classes could use DayOfWeek.MONDAY, DayOfWeek.TUESDAY, etc., but would have to store them in int variables.
    [Show full text]
  • Learning from Examples to Find Fully Qualified Names of API Elements In
    Learning from Examples to Find Fully Qualified Names of API Elements in Code Snippets C M Khaled Saifullah Muhammad Asaduzzaman† Chanchal K. Roy Department of Computer Science, University of Saskatchewan, Canada †School of Computing, Queen's University, Canada fkhaled.saifullah, [email protected] †[email protected] Abstract—Developers often reuse code snippets from online are difficult to compile and run. According to Horton and forums, such as Stack Overflow, to learn API usages of software Parnin [6] only 1% of the Java and C# code examples included frameworks or libraries. These code snippets often contain am- in the Stack Overflow posts are compilable. Yang et al. [7] biguous undeclared external references. Such external references make it difficult to learn and use those APIs correctly. In also report that less than 25% of Python code snippets in particular, reusing code snippets containing such ambiguous GitHub Gist are runnable. Resolving FQNs of API elements undeclared external references requires significant manual efforts can help to identify missing external references or declaration and expertise to resolve them. Manually resolving fully qualified statements. names (FQN) of API elements is a non-trivial task. In this paper, Prior studies link API elements in forum discussions to their we propose a novel context-sensitive technique, called COSTER, to resolve FQNs of API elements in such code snippets. The pro- documentation using Partial Program Analysis (PPA) [8], text posed technique collects locally specific source code elements as analysis [2], [9], and iterative deductive analysis [5]. All these well as globally related tokens as the context of FQNs, calculates techniques except Baker [5], need adequate documentation or likelihood scores, and builds an occurrence likelihood dictionary discussion in online forums.
    [Show full text]
  • Magic Tcl Tutorial #4: Simulation with IRSIM
    Magic Tcl Tutorial #4: Simulation with IRSIM R. Timothy Edwards Space Department Johns Hopkins University Applied Physics Laboratory Laurel, MD 20723 This tutorial corresponds to Tcl-based Magic version 7.2 Tutorials to read first: Magic Tutorial #1: Getting Started Magic Tutorial #2: Basic Painting and Selection Magic Tutorial #4: Cell Hierarchies Magic Tutorial #8: Circuit Extraction Magic Tutorial #11: Using IRSIM and RSIM with Magic Commands introduced in this tutorial: irsim , getnode, goto graphnode, watchnode, unwatchnode movenode, watchtime, unwatchtime, movetime (plus the standard IRSIM command set) Macros introduced in this tutorial: (None) 1 IRSIM Version 9.6 In version 9.6, IRSIM has been redesigned to work under the Tcl interpreter, in the same manner as Magic version 7.2 does. Like Magic version 7.2, section of Tcl as an interpreter is specified at compile-time, along with various use options. The “make” method has been rewritten to match the one which Magic uses, so IRSIM can be compiled and installed in a similar manner: make config make tcl make install-tcl –1– March22,2003 MagicTclTutorial#4:SimulationwithIRSIM Tcl-based IRSIM, like its non-interpreter version, can be run as a standalone product, and will simulate a circuit from a .sim format file. However, it is specifically designed to be operated in conjunction with magic, with methods for providing feedback directly into the layout from the simulation, and vice versa. There are a number of cross-application commands, detailed below, which belong to neither Magic or IRSIM, but are applicable when both are running in the Tcl interpreter at the same time.
    [Show full text]
  • Advanced Tcl E D
    PART II I I . A d v a n c Advanced Tcl e d T c l Part II describes advanced programming techniques that support sophisticated applications. The Tcl interfaces remain simple, so you can quickly construct pow- erful applications. Chapter 10 describes eval, which lets you create Tcl programs on the fly. There are tricks with using eval correctly, and a few rules of thumb to make your life easier. Chapter 11 describes regular expressions. This is the most powerful string processing facility in Tcl. This chapter includes a cookbook of useful regular expressions. Chapter 12 describes the library and package facility used to organize your code into reusable modules. Chapter 13 describes introspection and debugging. Introspection provides information about the state of the Tcl interpreter. Chapter 14 describes namespaces that partition the global scope for vari- ables and procedures. Namespaces help you structure large Tcl applications. Chapter 15 describes the features that support Internationalization, includ- ing Unicode, other character set encodings, and message catalogs. Chapter 16 describes event-driven I/O programming. This lets you run pro- cess pipelines in the background. It is also very useful with network socket pro- gramming, which is the topic of Chapter 17. Chapter 18 describes TclHttpd, a Web server built entirely in Tcl. You can build applications on top of TclHttpd, or integrate the server into existing appli- cations to give them a web interface. TclHttpd also supports regular Web sites. Chapter 19 describes Safe-Tcl and using multiple Tcl interpreters. You can create multiple Tcl interpreters for your application. If an interpreter is safe, then you can grant it restricted functionality.
    [Show full text]
  • Aras Innovator 12 Package Import Export Utilities
    Aras Innovator 12 Package Import Export Utilities Document #: 12.0.02019053801 Last Modified: 1/3/2020 Aras Innovator 12 Package Import Export Utilities Copyright Information Copyright © 2020 Aras Corporation. All Rights Reserved. Aras Corporation 100 Brickstone Square Suite 100 Andover, MA 01810 Phone: 978-806-9400 Fax: 978-794-9826 E-mail: [email protected] Website: https://www.aras.com Notice of Rights Copyright © 2020 by Aras Corporation. This material may be distributed only subject to the terms and conditions set forth in the Open Publication License, V1.0 or later (the latest version is presently available at http://www.opencontent.org/openpub/). Distribution of substantively modified versions of this document is prohibited without the explicit permission of the copyright holder. Distribution of the work or derivative of the work in any standard (paper) book form for commercial purposes is prohibited unless prior permission is obtained from the copyright holder. Aras Innovator, Aras, and the Aras Corp "A" logo are registered trademarks of Aras Corporation in the United States and other countries. All other trademarks referenced herein are the property of their respective owners. Notice of Liability The information contained in this document is distributed on an "As Is" basis, without warranty of any kind, express or implied, including, but not limited to, the implied warranties of merchantability and fitness for a particular purpose or a warranty of non- infringement. Aras shall have no liability to any person or entity with respect to any loss or damage caused or alleged to be caused directly or indirectly by the information contained in this document or by the software or hardware products described herein.
    [Show full text]
  • Magic Tcl Tutorial #4: Simulation with IRSIM
    Magic Tcl Tutorial #4: Simulation with IRSIM R. Timothy Edwards Space Department Johns Hopkins University Applied Physics Laboratory Laurel, MD 20723 This tutorial corresponds to Tcl-based Magic version 7.2 Tutorials to read first: Magic Tutorial #1: Getting Started Magic Tutorial #2: Basic Painting and Selection Magic Tutorial #4: Cell Hierarchies Magic Tutorial #8: Circuit Extraction Magic Tutorial #11: Using IRSIM and RSIM with Magic Commands introduced in this tutorial: irsim , getnode, goto graphnode, watchnode, unwatchnode movenode, watchtime, unwatchtime, movetime (plus the standard IRSIM command set) Macros introduced in this tutorial: (None) 1 IRSIM Version 9.6 In version 9.6, IRSIM has been redesigned to work under the Tcl interpreter, in the same manner as Magic version 7.2 does. Like Magic version 7.2, section of Tcl as an interpreter is specified at compile-time, along with various use options. The “make” method has been rewritten to match the one which Magic uses, so IRSIM can be compiled and installed in a similar manner: make config make tcl make install-tcl –1– April14,2006 MagicTclTutorial#4:SimulationwithIRSIM Tcl-based IRSIM, like its non-interpreter version, can be run as a standalone product, and will simulate a circuit from a .sim format file. However, it is specifically designed to be operated in conjunction with magic, with methods for providing feedback directly into the layout from the simulation, and vice versa. There are a number of cross-application commands, detailed below, which belong to neither Magic or IRSIM, but are applicable when both are running in the Tcl interpreter at the same time.
    [Show full text]
  • What Is Object-Oriented Perl?
    This is a series of extracts from Object Oriented Perl, a new book from Manning Publications that will be available in August 1999. For more information on this book, see http://www.manning.com/Conway/. What is object-oriented Perl? Object-oriented Perl is a small amount of additional syntax and semantics, added to the existing imperative features of the Perl programming language. Those extras allow regular Perl packages, variables, and subroutines to behave like classes, objects, and methods. It's also a small number of special variables, packages and modules, and a large number of new techniques, that together provide inheritance, data encapsulation, operator overloading, automated definition of commonly used methods, generic programming, multiply-dispatched polymorphism, and persistence. It's an idiosyncratic, no-nonsense, demystified approach to object-oriented programming, with a typically Perlish disregard for accepted rules and conventions. It draws inspiration (and sometimes syntax) from many different object-oriented predecessors, adapting their ideas to its own needs. It reuses and extends the functionality of existing Perl features, and in the process throws an entirely new slant on what they mean. In other words, it's everything that regular Perl is, only object-oriented. Using Perl makes object-oriented programming more enjoyable, and using object- oriented programming makes Perl more enjoyable too. Life is too short to endure the cultured bondage-and-discipline of Eiffel programming, or to wrestle the alligators that lurk in the muddy semantics of C++. Object-oriented Perl gives you all the power of those languages, with very few of their tribulations. And best of all, like regular Perl, it's fun! Before we look at object orientation in Perl, let’s talk about what object orientation is in general..
    [Show full text]