Journal ArticleDOI
The Cornell program synthesizer: a syntax-directed programming environment
Tim Teitelbaum,Thomas Reps +1 more
TLDR
The Cornell Program Synthesizer demands a structural perspective at all stages of program development and its separate features are unified by a common foundation: a grammar for the programming language.Abstract:
Programs are not text; they are hierarchical compositions of computational structures and should be edited, executed, and debugged in an environment that consistently acknowledges and reinforces this viewpoint. The Cornell Program Synthesizer demands a structural perspective at all stages of program development. Its separate features are unified by a common foundation: a grammar for the programming language. Its full-screen derivation-tree editor and syntax-directed diagnostic interpreter combine to make the Synthesizer a powerful and responsive interactive programming tool.read more
Citations
More filters
Book ChapterDOI
Towards an Incremental Update Approach for Concrete Textual Syntaxes for UUID-Based Model Repositories
TL;DR: This short paper envision an approach for the mapping of concrete textual syntaxes that makes use of the incremental parsing techniques from the compiler construction world to circumvent problems that occur when dealing with concrete textualntaxes in a UUID based environment.
Journal ArticleDOI
Practical experiences with automatic repair of syntactical errors or syntactical error repair in the DAS compiler
TL;DR: Two methods, a continuation method designed in Karlsruhe and the method used in the Berkeley PASCAL compiler, have been investigated for use in a compiler for an Ada subset, the DAS (Delft Ada Subset) compiler.
Presentation Techniques for more Expressive Programs
TL;DR: A set of presentation techniques to be used by presentation designers are developed that relate to well-understood programming language design, editor design, and programming best-practices techniques including scoping, higher order functions, refactoring, prettyprinting, naming conventions, syntax highlighting, and text hovers.
Journal ArticleDOI
A high level language-based computing environment to support production and execution of reliable programs
TL;DR: The authors present an environment which involves a debugging tool to aid in the detection and removal at logic errors, and this could be seen as a step toward providing an advanced programming environment for the development of reliable software.
Dissertation
Language Engineering in Grammatical Framework (GF)
TL;DR: The main results are implementing a syntax editor, which provides a graphical user interface for the command-line GF core, and writing the Russian resource grammar, which takes care of the most basic morphological and syntactic rules.
References
More filters
Proceedings ArticleDOI
Closest-point problems
Michael Ian Shamos,Dan Hoey +1 more
TL;DR: The purpose of this paper is to introduce a single geometric structure, called the Voronoi diagram, which can be constructed rapidly and contains all of the relevant proximity information in only linear space, and is used to obtain O(N log N) algorithms for most of the problems considered.
Journal ArticleDOI
Algorithms for Reporting and Counting Geometric Intersections
TL;DR: Algorithms that count the number of pairwise intersections among a set of N objects in the plane and algorithms that report all such intersections are given.
Proceedings ArticleDOI
A research center for augmenting human intellect
TL;DR: In this article, a multisponsor research center at Stanford Research Institute in man-computer interaction is described, where the authors describe a multiscale multi-modal system.
Proceedings ArticleDOI
Geometric intersection problems
Michael Ian Shamos,Dan Hoey +1 more
TL;DR: An O(N log N) algorithm is given to determine whether any two intersect and use it to detect whether two simple plane polygons intersect and to show that the Simplex method is not optimal.
Journal ArticleDOI
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
TL;DR: This paper investigates the problem of reporting all intersecting pairs in a set of n rectilinearly oriented rectangles in the plane and describes an algorithm that solves this problem in worst case time proportional to n lg n + k, where k is the number of interesecting pairs found.