scispace - formally typeset
Journal ArticleDOI

The Cornell program synthesizer: a syntax-directed programming environment

Tim Teitelbaum, +1 more
- 01 Sep 1981 - 
- Vol. 24, Iss: 9, pp 563-573
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 Article

Towards a practical visual object-oriented programming environment: desirable functionalities and their implementation

TL;DR: A languagebased editing process has been designed and incorporated into this VOOPE, which contains two key elements: syntax-directed editing facilities and an in-place editing assistant, which facilitate object-oriented program development by providing useful programming guidance and by reducing the number of potential programming errors.
Journal ArticleDOI

Generating the analytic component parts of syntax-directed editors with efficient-error recovery

TL;DR: The incremental jump-shift-reduce technique is an extension of LR techniques based on parsing table splitting suitable for generating analytic components of syntax-directed editors, and a new, automatically generated, possibly interactive method for error handling is presented.
Journal ArticleDOI

Program view generation and change analysis using attributed dependency graphs

TL;DR: APDGs, a model to store information derived from the program source code and ease construction of tools for software maintenance, are described and it is shown how the model can be used for interactive view generation and doing two kinds of impact-of-change analysis—incremental and comparison-oriented.
Journal ArticleDOI

Using Elm to Introduce Algebraic Thinking to K-8 Students

TL;DR: This paper focuses on programming in the functional language Elm and the graphics library GraphicSVG, which is in the ML (Meta Language) family, with a lean syntax and easy inclusion of Domain Specific Languages.

Programming Language Techniques for Natural Language Applications

TL;DR: This thesis describes how the type-theorectical grammar formalism Grammatical Framework can be used as a high-level language for natural language applications and generates application components from a declarative grammar to reduce duplicated work, ensure consistency, and make it easier to build multilingual systems.
References
More filters
Proceedings ArticleDOI

Closest-point problems

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

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.