Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Leon Presser

dblp:59/3785 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 1975
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 5 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%
Theoretical computer science
1 paper
Automata and formal languages · 100%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › parallel system performance
multiprogramming models		 0.011974
Comments on a Paper by Gaver · J. ACM 1974
Performance modeling and evaluation
queueing models		 0.011974
Comments on a Paper by Gaver · J. ACM 1974
Compilers and program optimization
parsing		 0.011972
An Algorithm for the Design of Simple Precedence Grammars · J. ACM 1972
Automata and formal languages › formal grammars
context-free grammar		 0.011972
An Algorithm for the Design of Simple Precedence Grammars · J. ACM 1972
Automata and formal languages
grammar transformation		 0.011972
An Algorithm for the Design of Simple Precedence Grammars · J. ACM 1972

Methods — techniques the papers use, named apart from their topics

incremental algorithm · 0.0independent derivation · 0.0
YearPublicationVenuePosition
1975 A Structured Language for Translator Construction
John R. White, Leon Presser
 Comput. J.2
1974 Evaluation of Compiler Diagnostics
Leon Presser, J. Benson
 Comput. J.1
1974 Comments on a Paper by Gaver
abstract
In a 1967 publication, D. P. Gaver studied a probabilistic model of a multiprogramming computer system. His results have been utilized recently by a number of authors. However, we have observed that Gaver's results contain inconsistencies. These inconsistencies are discussed in detail and a correction suggested and verified through an independent derivation.
E. Balkovich, W. Chiu, Leon Presser, R. Wood
 J. ACM3
1973 A Method of Software Evaluation: The Case of Programming Language Translators
abstract
This paper presents a method for the specification and evaluation of software modules. The proposed strategy involves the use of existing documentation and synthetic or benchmark programs to evaluate a set of key characteristics that represent the module under consideration. The method if discussed and illustrated by considering the evaluation of programming language translators in detail. An example demonstrates how the method is applied to the evaluation of the popular WATFIV FORTRAN compiler.
Henry C. Lucas Jr., Leon Presser
 Comput. J.2
1972 An Algorithm for the Design of Simple Precedence Grammars
abstract
A practical incremental algorithm for transforming an arbitrary context-free grammar into an equivalent grammar with unique precedence relations between any two symbols in its vocabulary is presented, illustrated, and proved.The algorithm has been employed as a tool in the design and implementation of programming languages.It has also served as an effective instructional aid.It is assumed that the reader is familiar with basic concepts in formal language theory.
J. McAfee, Leon Presser
 J. ACM2