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
Journal ArticleDOI
Ytracc: a parse browser for Yacc grammars
TL;DR: Ytracc is an interactive grammar debugging tool for compiler writers that provides the designer of a yacc grammar a method of tracing a parser as it uses the grammar, ytracc captures the states of the parse as it is carried out.
Book ChapterDOI
Modelling as a Method of Learning Physical Science and Mathematics
TL;DR: In this paper, the authors classify computer programs to aid learning as either simulation or modelling programs, in which the user's aim is typically to discover the rules by some kind of scientific investigation or to acquire a gut feeling for how the encoded principles control various situations.
Proceedings ArticleDOI
III—an integrated interactive incremental programming environment based on compilation
Boris Magnusson,Sten Minör +1 more
TL;DR: The design and a prototype implementation of an integrated programming environment utilizing powerful interaction facilities is described and the qualities of such a system are discussed.
Proceedings ArticleDOI
Generating direct manipulation program editors
TL;DR: This paper presents a technique for specifying direct manipulation editing of programs which is amenable to the generation of language specific editors incorporating direct manipulation from a specification of the desired editing mechanisms.
Journal ArticleDOI
Application of Attribute NCE Graph Grammars to Syntactic Editing of Tabular Forms
TL;DR: This paper formalizes syntax-directed editing methods by extending of the notion of the Cornell Program Synthesizer to attribute NCE graph grammars (cf. [1]).
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.