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
PEG - Ein Programmierumgebungsgenerator
TL;DR: Die PEG (Programming Environment Generator) entwickelt und unter Verwendung des Generators eine Reihe of Programmierumgebungen fur die Lehre and die Softwareproduktion erstellt, enthalten einen syntaxgesteuerten Editor, einen Interpreter/Debugger and einen inkrementellen Compiler.
Dissertation
Towards program manipulation in-the-large
TL;DR: Four static software metrics that indicate whether a project consisting of a set of program modules is wellstructured are proposed, based on the principle of vocabulary hiding, which suggest the proposed metrics are useful to discover poorly structured project modules.
Proceedings ArticleDOI
Generating environments for programming-in-the-large
TL;DR: In order to provide better programming environments, language-based tools are introduced which are tailored according to the definition of the target programming language as well as tools which are standard for all environments (kernel) and do not depend on a language.
Posted Content
Success and failure of programming environments - report on the design and use of a graphic abstract syntax tree editor
TL;DR: An attempt at measuring the effectiveness of an abstract syntax tree editor developed within the STAPLE project and discussing the problems raised by structured syntax editing in environments based on abstract syntax trees.
Component-based network test tools platform for network design and maintenance.
TL;DR: A software framework (termed tools platform hence-forth in this thesis) is proposed that provides increased reusability, configurability and efficiency to tool developers and Tool Users.
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.