Programming Languages and Systems (TOPLAS)


Search Issue
enter search term and/or author name


ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 10 Issue 3, July 1988

Efficient incremental LR parsing for syntax-directed editors
Pierpaolo Degano, Stefano Mannucci, Bruno Mojana
Pages: 345-373
DOI: 10.1145/44501.214503
A technique for generating parsers which is an extension to LR techniques and is based on parsing table splitting, is presented. Then this technique is slightly extended to support incremental syntax analysis. Given a context-free grammar and a...

Constrained expressions: toward broad applicability of analysis methods for distributed software systems
Laura K. Dillon, George S. Avrunin, Jack C. Wileden
Pages: 374-402
DOI: 10.1145/44501.44502
It is extremely difficult to characterize the possible behaviors of a distributed software system through informal reasoning. Developers of distributed systems require tools that support formal reasoning about properties of the behaviors of...

The specification statement
Carroll Morgan
Pages: 403-419
DOI: 10.1145/44501.44503
Dijkstra's programming language is extended by specification statements, which specify parts of a program “yet to be developed.” A weakest precondition semantics is given for these statements so that the extended...

Fairness in parallel programs: the transformational approach
Ernst-Rüdiger Olderog, Krzysztof R. Apt
Pages: 420-455
DOI: 10.1145/44501.44504
Program transformations are proposed as a means of providing fair parallelism semantics for parallel programs with shared variables. The transformations are developed in two steps. First, abstract schedulers that implement the various fairness...

Determining the extent of lookahead in syntactic error repair
Jon Mauney, Charles N. Fischer
Pages: 456-469
DOI: 10.1145/44501.44505
Many syntactic error repair strategies examine several additional symbols of input to guide the choice of a repair; a problem is determining how many symbols to examine. The goal of gathering all relevant information is discussed and shown to be...

Abstract types have existential type
John C. Mitchell, Gordon D. Plotkin
Pages: 470-502
DOI: 10.1145/44501.45065
Abstract data type declarations appear in typed programming languages like Ada, Alphard, CLU and ML. This form of declaration binds a list of identifiers to a type with associated operations, a composite “value” we call a...