DOCSLIB.ORG

May Be Protected (Title 17 U.S.C.)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
May Be Protected (Title 17 U.S.C.) UCI LISP MANUAL by Robert J. Bobrow Richard R= Burton Jeffrey lU Jacobs ' Daryle Lewis Notice: This Material may be protected by Copyright Law (Title 17 U.S.C.) Department of Information and Computer Science University of California, Irvine TECHNICAL REPORT #21 updated 10/73 Table of Contents. Introduction Oo 0 Debugging Facilities 1» 1 Introduction 1= 1 Temporarily Interrupting a Computation 1» 5 BREAKl - The Function that Supervises all Breaks 1= 6 What You Can Do In a Break 1- 8 Break.Commands 1. 8 Leaving a break with a value (0K,GO,EVAL,FROM ?) 1.8 Correction of UNBOUMD ATOM and UNDEFINED FUNCTION errors (>, USE) 1. 9 Aborting to Higher Breaks or the Top Level (t, TT) 1-10 Examining and Modifying the Context of a Break 1.11 Searching for a Context on the Stack 1.11 Editing a Form on the Context Stack 1.12 Evaluating a Form in a Higher Context 1.12 Backtrace Commands Printing the Functions, Forms and Variable Bindings on the Context Stack 1.15 Breakmacros User Defined Break Commands 1.17 How to Use the Break Package 1.18 Setting a Break to Investigate a Function 1.18 Tracing the Execution of Functions 1.19 Setting a Break INSIDE a Function 1.19 Removing Breaks and Traces 1.21 Using BREAKO Directly to Obtain Special Effects from the Break Package 1.23 Error Package - Getting Automatic Breaks 'When Errors Occur 1.24 Summary of Break Commands 1.25 The LISP Editor 2o 1 Introduction 2. 2 Coinmands for the Nev/ User 2.1Q Attention Changing Commands 2.15 Local Attention Changing Commands 2.16 Commands That Search 2.22 Search Algorithm 2.24 Search Commands 2.26 Location Specification 2.30 Commands That Save and Restore the Edit Chain 2.36 Commands That Modify Structure 2.33 Implementation of Structure Modification Commands 2.39 The A, R, : Commands 2.41 Form Oriented Editing and the Role of UP 2.45* Extract and Embed 2.46 The MOVE Command 2.50 Commands That "Move Parentheses" 2.54 TO and THRU 2.57 Commands That Print 2.62 Commands That Evaluate 2.63 Commands That Test 2.66 Macros • 2.68 Miscellaneous Commands 2.71 Editdefault 2.78 Editor Functions 2.80 Extended Interpretation of LISP Forms 3. 1 Evaluation of Sequences of Forms Extended LAflBDA Expressions 3. 1 The Functions PROGl and PROGU 3. 2 Conditional Evaluation of Forms - SELECTQ 3. 3 Changes to the Handling of Errors 3. 4 Miscellania - APPLY ff, MILL 3. 5 Extensions to the Standard Input/Output Functions 4» 1 Project-Programmer numbers'for Disk I/O 4. 1 Saving Function Definitions, etc. on Disk Files 4o 1 •Reading Files Back In . 4. 1. 1 Reading Directories 4. 1. 2 File Manipulation 4. 1. 4 Queuing Files 4. 1. 7 Recovery from QMANGR Errors 4. lo 10 Printing Circular or Deeply Nested.Lists 4o 2 Spacing Control - TAB 4o 2 "Pretty Printing" Function Definitions and S-Expressions 4. 3 Reading VJhole Lines 4. 4 Teletype and Prompt Character Control Functions 4.. 5 Read Macros - Extending the LISP READ Routine 4» 6 Functions for Defining Read Macros 4o 6 Using Read Macros 4. 7 Modifying the READ Control Table 4. 8 Reading without Interning 4. 9 New Functions on S-Expressions 5. 1 S-Expression Building Functions 5. 1 S-Expression Transforming Functions 5. 3 S-Expression Modifying Functions 5. 4 Mapping Functions with Several Arguments 5. 5 Mapping Functions v/hich use NCCrJC 5o 5 S-Expression Searching and Substitution Functions 5. 7 Efficiently 'Norking v.'ith Atoms as Character Strings 5. 9 Nev/ Predicates 6 . 1 Data Type Predicates 6. 1 Alphabetic Ordering Predicate 6o 2 Predicates That Return Useful Non-NIL Values 6. 3 Other Predicates 6 = 4 Nev/ Numeric Functions 7o 1 Minimum and Maximum 7. 1 FORTRAN Functions in LISP 7 = 2 Functions for the Systen Builder 8. 1 Loading Conpiled Code into the High Segment 8. 1 The Compiler and LAP -8o 2 Special Variables 8» 2 Removing Excess Entry Points • 8. 2 MiscellaneousUsefulFunctions 8. 3 Initial System Generation 8. 4 The LISP Evaluation Context Stack 9. 1 The Contents of the Context Stack 9= 1 Examining the Context Stack 9» 2 Controlling Evaluation Context 9. 4 Storage Allocation 10. 1 Contiguous Blocks of Storage 11. 1 Index INDEX. •INTRODUCTIOM UCI LISP is a compatible extension of the Stanford LISP 1=6 programming system for the DEC PpP-lOo The extensions make UCI LISP a pov/erful and convenient interactive programming environment for research and teaching in artificial intelligence and advanced list processing applications= All Stanford LISP programs, (except those using the ' BIGMUM package) can be run directly in UCI LISP. In addition, the extended features of UCI LISP make it much, easier to transfer interpreted LISP programs from BBN LISP and MIT AI LISP (we have already converted several large programs, including a version of the Woods' Augmented Transition Network Parser from BBM LISP, and a version of Micro-Planner from MIT AI LISP.) This manual describes the extensions to the Stanford LISP 1.6 system, and should thus be read in conjunction v/ith the latest Stanford LISP 1.6 manual, currently SAILOH 28.6 (Stanford Artificial Intelligence Laboratory Operating Note 28.6). As can be seen from the relative sizes of the tv/o documents UCI LISP represents a substantial extension to Stanford LISP, and from our ov;n experience presents a major improvement in the habitability of the system for both naive and experienced users. (A majority of the extensions were suggested by the features of BBN LISP, probably the best interactive . LISP system in existence, but unfortunately available at the time UCI LISP v.'as implemented only on TENEX, a paged virtual memory system for the PDP-10, produced by Bolt, Beranek and Nev^man Inc.; this I,ISP system is now or soon will be available on the BURROUGHS 36700 and the IBM S/360 and S/370 series m.achines, and is nov; called IMTERLISP.) The major extensions to Stanford LISP can be briefly described as follov/s: 1) Improvements in storage utilization: a) UCI LISP is reentrant and com.piled code may be placed in the sharable high segment b) The allocator a1lows reallocation of all spaces (including Binary Program Space) at any time, and new versions of GETSYM and PUTSYM are now available to permit relocation of MACRO-10 and FORTRAN coded routines c) A new data type, the BLOCK, v^;hich allov/ users freer access to Binary Program Space and permits the construction of data items such as the system OBLIST, which is both a list and a contiguous block of storage (to provide efficient use as a sequential hash table) 2) Powerful interactive debugging facilities, including: a) Sophisticated conditional breakpoint and function tracing facilities b) A powerful list structure editor for editing function definitions and data c) Facilities for examining, correcting and continuing to run in the context of a program v/hich has been interrupted by an error or by a user initiated temporary interrupt 3) Extensions to the I/O facilities available in the basic system, including: a) Convenient I/O to disk files, including use of project/programmer designations and v/ays to save and restore functions and data b) Read Macros (patterned after MIT AI LISP) for extending the LISP READ routine c) A routine for printing circular or deeply nested expressions d) Routines to modify the control table of the LISP READ routine e) The ability to change the OBLIST used by INTERN (and, hence, READ) at any time by changing the value of the atom OBLIST to a properly structured BLOCK list (see Ic above and Chapter 11) f) The ability to RENAME and DELETE files from within LISP g) The ability to read file directories for any accessible project-programmer number, to see if a file exists in a directory h) Several useful functions for carriage positioning, teletype echo and prompt character control, reading input a line at a time, reading list structures v;ithout interning their atoms, etc- 4) Functions for examining and modifying the special pushdown stack v/hich holds the context of ongoing computations 5) Error protection facilities: a) NIL, T and other atoms cannot be easily damaged by RPLACA, RPLACD, SETP and SET b) The system v;ill no longer go into an infinite loop V7hen searching for the function definition of the CAR of a form c) Changes to the disk output routine DSKOUT so that it uses the RENAME facility to provide a backup for user files (m.inimizing the risk of unintentionally clobbering files) 6) Extended basic functions including: a) New predicates for data types, and most predicates now return useful non-MIL values, rather than T b) New list construction and modification functions c) Multiple sequential form evaluation in LAMBDA expressions d) An efficient n-v;ay switch e) Availability of the FORTRAN mathematical functions f) Mapping functions with several arguments, and ones which build new lists using NCONC to join segments 7) The ability to use. many of the system Queue Manager's facilities without leaving LISP, a 1 lov^ing: a) Listing of files on the line printer b) Initiation of batch jobs As mentioned, v/e have made UCI LISP a reentrant system which may be used by several users simultaneously. Thus, v/hile the new features of UCI LISP reouire a larger system than the original Stanford LISP, this impact is minimized in any environment with more than one LISP user. In addition, since the ba sic LISP system contains many features previously available only in the various extension files (such as SMILE, ALVINE, TRACE, etc.) or which had to bo written by the user, it is possible to write and debug meaningful jobs in the basic system, without getting extra core.
Load more

Recommended publications
  • Computations in Algebraic Geometry with Macaulay 2
    Computations in algebraic geometry with Macaulay 2 Editors: D. Eisenbud, D. Grayson, M. Stillman, and B. Sturmfels Preface Systems of polynomial equations arise throughout mathematics, science, and engineering. Algebraic geometry provides powerful theoretical techniques for studying the qualitative and quantitative features of their solution sets. Re- cently developed algorithms have made theoretical aspects of the subject accessible to a broad range of mathematicians and scientists. The algorith- mic approach to the subject has two principal aims: developing new tools for research within mathematics, and providing new tools for modeling and solv- ing problems that arise in the sciences and engineering. A healthy synergy emerges, as new theorems yield new algorithms and emerging applications lead to new theoretical questions. This book presents algorithmic tools for algebraic geometry and experi- mental applications of them. It also introduces a software system in which the tools have been implemented and with which the experiments can be carried out. Macaulay 2 is a computer algebra system devoted to supporting research in algebraic geometry, commutative algebra, and their applications. The reader of this book will encounter Macaulay 2 in the context of concrete applications and practical computations in algebraic geometry. The expositions of the algorithmic tools presented here are designed to serve as a useful guide for those wishing to bring such tools to bear on their own problems. A wide range of mathematical scientists should find these expositions valuable. This includes both the users of other programs similar to Macaulay 2 (for example, Singular and CoCoA) and those who are not interested in explicit machine computations at all.
    [Show full text]
  • The Pretzel User Manual
    The PretzelBook second edition Felix G¨artner June 11, 1998 2 Contents 1 Introduction 5 1.1 Do Prettyprinting the Pretzel Way . 5 1.2 History . 6 1.3 Acknowledgements . 6 1.4 Changes to second Edition . 6 2 Using Pretzel 7 2.1 Getting Started . 7 2.1.1 A first Example . 7 2.1.2 Running Pretzel . 9 2.1.3 Using Pretzel Output . 9 2.2 Carrying On . 10 2.2.1 The Two Input Files . 10 2.2.2 Formatted Tokens . 10 2.2.3 Regular Expressions . 10 2.2.4 Formatted Grammar . 11 2.2.5 Prettyprinting with Format Instructions . 12 2.2.6 Formatting Instructions . 13 2.3 Writing Prettyprinting Grammars . 16 2.3.1 Modifying an existing grammar . 17 2.3.2 Writing a new Grammar from Scratch . 17 2.3.3 Context Free versus Context Sensitive . 18 2.3.4 Available Grammars . 19 2.3.5 Debugging Prettyprinting Grammars . 19 2.3.6 Experiences . 21 3 Pretzel Hacking 23 3.1 Adding C Code to the Rules . 23 3.1.1 Example for Tokens . 23 3.1.2 Example for Grammars . 24 3.1.3 Summary . 25 3.1.4 Tips and Tricks . 26 3.2 The Pretzel Interface . 26 3.2.1 The Prettyprinting Scanner . 27 3.2.2 The Prettyprinting Parser . 28 3.2.3 Example . 29 3.3 Building a Pretzel prettyprinter by Hand . 30 3.4 Obtaining a Pretzel Prettyprinting Module . 30 3.4.1 The Prettyprinting Scanner . 30 3.4.2 The Prettyprinting Parser . 31 3.5 Multiple Pretzel Modules in the same Program .
    [Show full text]
  • GOOL: a Generic Object-Oriented Language (Extended Version)
    GOOL: A Generic Object-Oriented Language (extended version) Jacques Carette Brooks MacLachlan W. Spencer Smith Department of Computing and Department of Computing and Department of Computing and Software Software Software McMaster University McMaster University McMaster University Hamilton, Ontario, Canada Hamilton, Ontario, Canada Hamilton, Ontario, Canada [email protected] [email protected] [email protected] Abstract it to the others. Of course, this can be made to work — one We present GOOL, a Generic Object-Oriented Language. It could engineer a multi-language compiler (such as gcc) to demonstrates that a language, with the right abstractions, de-compile its Intermediate Representation (IR) into most can capture the essence of object-oriented programs. We of its input languages. The end-results would however be show how GOOL programs can be used to generate human- wildly unidiomatic; roughly the equivalent of a novice in a readable, documented and idiomatic source code in multi- new (spoken) language “translating” word-by-word. ple languages. Moreover, in GOOL, it is possible to express What if, instead, there was a single meta-language de- common programming idioms and patterns, from simple signed to embody the common semantic concepts of a num- library-level functions, to simple tasks (command-line argu- ber of OO languages, encoded so that the necessary informa- ments, list processing, printing), to more complex patterns, tion for translation is present? This source language could such as methods with a mixture of input, output and in-out be agnostic about what eventual target language will be used parameters, and finally Design Patterns (such as Observer, – and free of the idiosyncratic details of any given language.
    [Show full text]
  • REDUCE User's Manual
    REDUCE User’s Manual Version 3.8 Anthony C. Hearn Santa Monica, CA, USA Email: [email protected] February 2004 Copyright c 2004 Anthony C. Hearn. All rights reserved. Registered system holders may reproduce all or any part of this publication for internal purposes, provided that the source of the material is clearly acknowledged, and the copyright notice is retained. Contents Abstract 11 1 Introductory Information 15 2 Structure of Programs 19 2.1 The REDUCE Standard Character Set............... 19 2.2 Numbers............................... 19 2.3 Identifiers.............................. 21 2.4 Variables.............................. 22 2.5 Strings................................ 23 2.6 Comments.............................. 23 2.7 Operators.............................. 24 3 Expressions 27 3.1 Scalar Expressions......................... 27 3.2 Integer Expressions......................... 28 3.3 Boolean Expressions........................ 29 3.4 Equations.............................. 30 3.5 Proper Statements as Expressions................. 31 4 Lists 33 4.1 Operations on Lists......................... 33 4.1.1 LIST............................ 34 4.1.2 FIRST............................ 34 1 2 CONTENTS 4.1.3 SECOND.......................... 34 4.1.4 THIRD........................... 34 4.1.5 REST............................ 34 4.1.6 : (Cons) Operator...................... 34 4.1.7 APPEND.......................... 34 4.1.8 REVERSE......................... 35 4.1.9 List Arguments of Other Operators............ 35 4.1.10 Caveats and Examples................... 35 5 Statements 37 5.1 Assignment Statements....................... 38 5.1.1 Set Statement........................ 38 5.2 Group Statements.......................... 39 5.3 Conditional Statements....................... 39 5.4 FOR Statements........................... 40 5.5 WHILE . DO........................... 42 5.6 REPEAT . UNTIL......................... 43 5.7 Compound Statements....................... 43 5.7.1 Compound Statements with GO TO............ 45 5.7.2 Labels and GO TO Statements..............
    [Show full text]
  • Sif: Tutorial and Reference Manual
    Sif Mjølner BETA Source Browser and Editor Tutorial and Reference Manual Mjølner Informatics Report MIA 90-11(2.1) August 1996 Copyright © 1990-96 Mjølner Informatics ApS. All rights reserved. No part of this document may be copied or distributed without prior written permission from Mjølner Informatics Contents 1. Introduction .........................................................................................................1 2. Basic User Interface Principles ...........................................................................5 2.1. The Mouse...............................................................................................5 2.2. Selection..................................................................................................5 3. Source Browser Tutorial .....................................................................................7 3.1. How to Get Started..................................................................................7 3.2. Browsing .................................................................................................8 3.3. Browsing ...............................................................................................10 3.4. Browsing at Code Level........................................................................11 3.4.1. Abstract Presentation.................................................................11 3.4.2. Semantic Links ..........................................................................12 3.4.3. Comments..................................................................................13
    [Show full text]
  • Deriving Pretty-Printing for Haskell
    Deriving Pretty-printing for Haskell Yi Zhen Master of Science School of Informatics University of Edinburgh 2016 Abstract Print information of data type values can be used to help programmers understand the nature and the way the structure of instances of a certain data type is generated. This work aims to provide an interface wrapper which includes a pre-designed indentation format for printing arbitrary data types, called a pretty printer. It can be seen as an extension of the Show library which converts the value of the data type to a printable string in Haskell. This report describes the design, implementation and evaluation of such a pretty-printing library. The overall result is a pretty printer intended to be available, easy-to-use, and interesting for programmers to print the data type value in a visually appealing way. i Acknowledgements Many thanks to my supervisor Prof. Philip Wadler for the guidance and numerous explanations; and to my parents, for food and a place to live. ii Declaration I declare that this thesis was composed by myself, that the work contained herein is my own except where explicitly stated otherwise in the text, and that this work has not been submitted for any other degree or professional qualification except as specified. (Yi Zhen) iii Table of Contents 1 Introduction 1 1.1 Introduction and Purpose . .1 1.2 How to Use Pretty-printing in Haskell . .2 1.3 Related Work . .5 2 Background 7 2.1 Haskell . .8 2.1.1 Introduction . .8 2.1.2 Data Type in Haskell .
    [Show full text]
  • Sle18-Indentation-Rules
    Delft University of Technology Declarative specification of indentation rules A tooling perspective on parsing and pretty-printing layout-sensitive languages de Souza Amorim, Luís Eduardo; Erdweg, Sebastian; Steindorfer, Michael J.; Visser, Eelco DOI 10.1145/3276604.3276607 Publication date 2018 Document Version Accepted author manuscript Published in SLE 2018 - Proceedings of the 11th ACM SIGPLAN International Conference on Soft ware Language Engineering Citation (APA) de Souza Amorim, L. E., Erdweg, S., Steindorfer, M. J., & Visser, E. (2018). Declarative specification of indentation rules: A tooling perspective on parsing and pretty-printing layout-sensitive languages. In D. Pearce , S. Friedrich, & T. Mayerhofer (Eds.), SLE 2018 - Proceedings of the 11th ACM SIGPLAN International Conference on Soft ware Language Engineering (pp. 3-15). Association for Computing Machinery (ACM). https://doi.org/10.1145/3276604.3276607 Important note To cite this publication, please use the final published version (if applicable). Please check the document version above. Copyright Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons. Takedown policy Please contact us and provide details if you believe this document breaches copyrights. We will remove access to the work immediately and investigate your claim. This work is downloaded from Delft University of Technology. For technical reasons the number of authors shown on this cover page is limited to a maximum of 10. Declarative Specification of Indentation Rules A Tooling Perspective on Parsing and Pretty-Printing Layout-Sensitive Languages Luís Eduardo de Souza Amorim Michael J.
    [Show full text]
  • PIPS High-Level Software Interface Pipsmake Configuration
    PIPS High-Level Software Interface Pipsmake Configuration R´emiTriolet, Fran¸coisIrigoin and many other contributors MINES ParisTech Math´ematiqueset Syst`emes Centre de Recherche en Informatique 77305 Fontainebleau Cedex France Id: pipsmake-rc.tex 23481 2018-08-22 19:35:27Z ancourt You can get a printable version of this document on http://www.cri.ensmp.fr/pips/pipsmake-rc.htdoc/ pipsmake-rc.pdf and a HTML version on http://www.cri.ensmp.fr/pips/pipsmake-rc.htdoc. Chapter 1 Introduction This paper describes high-level objects and functions that are potentially user- visible in a PIPS 1 [33] interactive environment. It defines the internal software interface between a user interface and program analyses and transformations. This is clearly not a user guide but can be used as a reference guide, the best one before source code because PIPS user interfaces are very closely mapped on this document: some of their features are automatically derived from it. Objects can be viewed and functions activated by one of PIPS existing user interfaces: tpips2, the tty style interface which is currently recommended, pips3 [11], the old batch interface, improved by many shell scripts4, wpips and epips, the X-Window System interfaces. The epips interface is an extension of wpips which uses Emacs to display more information in a more convenient way. Unfortunately, right now these window-based interfaces are no longer working and have been replaced by gpips. It is also possible to use PIPS through a Python API, pyps. From a theoretical point of view, the object types and functions available in PIPS define an heterogeneous algebra with constructors (e.g.
    [Show full text]
  • Prettyprinting
    Prettyprinting DEREK C. OPPEN Stanford University An algorithm for prettyprinting is given. For an input stream of length n and an output device with linewidth m, the algorithm requires time O(n) and space O(m). The algorithm is described in terms of two parallel processes: the first scans the input stream to determine the space required to print logical blocks of tokens; the second uses this information to decide where to break lines of text; the two processes communicate by means of a buffer of size O(m). The algorithm does not wait for the entire stream to be input, but begins printing as soon as it has received a full line of input. The algorithm is easily implemented. Key Words and Phrases: prettyprinting, formating, paragraphing, text editing, program manipulation CR Category: 4.12 1. INTRODUCTION A prettyprinter takes as input a stream of characters and prints them with aesthetically appropriate indentations and line breaks. As an example, consider the following stream: vat x: integer; y: char; begin x := 1; y := 'a' end If our line width is 40 characters, we might want it printed as follows: vat x: integer; y: char; begin x :--- 1; y := 'a' end If our line width is 30 characters, we might want it printed as follows: vat x : integer; y: char; begin X := I; y := 'a'; end But under no circumstances do we want to see vat x: integer; y: char; begin x := 1; y := 'a'; end Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery.
    [Show full text]
  • Combining LATEX with Python
    Combining LATEX with Python Uwe Ziegenhagen August 9, 2019 Dante e. V. Heidelberg 1 About me • Uwe Ziegenhagen, from Cologne, Germany • In-house analyst in banking and private equity • Responsible for developing and maintaining individual software applications • Teacher for IT-related subjects at a private University of Applied Sciences 2 What’s this talk about? • LATEX-files are pure text files, so pretty much any programming language can be used to create them • Python has been my favourite programming language • Python is sufficiently fast, easy to learn and has a huge set of libraries • This talk is about Python and the way we can utilize it with LATEX 3 Today’s Topics • Introducing Python • Creating LATEX files with Python • Running Python from within LATEX 4 Python • Is a general purpose scripting language • Comes with a rich standard library ) “batteries included” • Was invented 1991 by Guido van Rossum at the Centrum Wiskunde & Informatica in the Netherlands, Version 1.0 in 1994 • Comes in version 2.7 and 3.x ) use version 3! 5 Python Design Philosophy • Open source • Simple, intuitive, but incredibly powerful • Source code as readable as plain English • Is suitable for everyday jobs as well as for machine learning • Offers short development cycles • Uses indentation, not brackets 6 Some basic Python The usual “Hello World!” 1 print(’Hello’+’’+’World’) Some function definition 1 def addTwo(a,b): 2 returna+b 3 4 print(addTwo(5,3)) 5 print(addTwo(’U’,’S’)) Interation over lists, arrays, etc. 1 some_string=’Hello TUG!’ 2 fori in some_string:
    [Show full text]
  • Declarative Specification of Template-Based Textual Editors
    Declarative Specification of Template-Based Textual Editors Tobi Vollebregt, Lennart C. L. Kats, and Eelco Visser Software Engineering Research Group Delft University of Technology The Netherlands [email protected] [email protected] [email protected] Abstract Syntax discoverability has been a crucial advantage of structure editors for new users of a language. Despite this advantage, structure editors have not been widely adopted. Based on immediate parsing and analyses, mod- ern textual code editors are also increasingly syntax-aware: structure and textual editors are converging into a new editing paradigm that combines text and templates. Current text-based language workbenches require re- dundant specification of the ingredients for a template-based editor, which is detrimental to the quality of syntactic completion, as consistency and completeness of the definition cannot be guaranteed. In this paper we describe the design and implementation of a speci- fication language for syntax definition based on templates. It unifies the specification of parsers, unparsers and template-based editors. We evalu- ate the template language by application to two domain-specific languages used for tax benefits and mobile applications. 1 Introduction Language-aware structure editors provide a template-based paradigm for editing programs. They allow composing programs by selecting a template and filling in the placeholders, which can again be extended using templates. A crucial advan- tage of structure editors is syntax discoverability, helping new users to learn the language by presenting possible syntactic completions in a menu. Structure ed- itors can be automatically generated from a syntax definition. Notable projects aiming at automatic generation of structure editors include MPS [23] and the Intentional Domain Workbench [19].
    [Show full text]
  • Maple Introductory Programming Guide
    Maple Introductory Programming Guide M. B. Monagan K. O. Geddes K. M. Heal G. Labahn S. M. Vorkoetter J. McCarron P. DeMarco Maplesoft, a division of Waterloo Maple Inc. 2009. ii Maplesoft, Maple, and Maplet are all trademarks of Waterloo Maple Inc. © Maplesoft, a division of Waterloo Maple Inc. 2009. All rights reserved. Information in this document is subject to change without notice and does not represent a commitment on the part of the vendor. The software described in this document is furnished under a license agreement and may be used or copied only in accordance with the agreement. It is against the law to copy the software on any medium except as specifically allowed in the agreement. Windows is a registered trademark of Microsoft Corporation. Java and all Java based marks are trademarks or registered trademarks of Sun Microsystems, Inc. in the United States and other countries. Maplesoft is independent of Sun Microsystems, Inc. All other trademarks are the property of their respective owners. This document was produced using a special version of Maple that reads and updates LaTeX files. Printed in Canada ISBN 978-1-897310-73-1 Contents Preface 1 Audience . 1 Worksheet Graphical Interface . 1 Manual Set . 2 Conventions . 2 The Maple Programming Language . 3 Using This Book . 3 Customer Feedback . 4 1 Introduction to Programming in Maple 5 In This Chapter . 5 1.1 The Maple Software . 5 1.2 Maple Statements . 6 Getting Started . 6 Maple Statements . 7 Getting Help . 7 Displaying a Text String . 7 Performing an Arithmetic Operation . 8 Assigning to a Name .
    [Show full text]