A technique for generating almost optimal Floyd-Evans productions for precedence grammars

Authors:
J. D. Ichbiah;S. P. Morse
Affiliations:
Compagnie Internationale pour l'Informatique Les Clayes-sous-Bois, France;Compagnie Internationale pour l'Informatique Les Clayes-sous-Bois, France
Venue:
Communications of the ACM
Year:
1970

Citing 6
Cited 20

A Descriptive Language for Symbol Manipulation

Journal of the ACM (JACM)
PL360, a Programming Language for the 360 Computers

Journal of the ACM (JACM)
Translator writing systems

Communications of the ACM
EULER: a generalization of ALGOL and it formal definition: Part 1

Communications of the ACM
Some properties of precedence languages

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
SIMULA 67 common base language, (Norwegian Computing Center. Publication)

SIMULA 67 common base language, (Norwegian Computing Center. Publication)

Early error detection in syntax-driven parsers

IBM Journal of Research and Development
Parsing and compiling using Prolog

ACM Transactions on Programming Languages and Systems (TOPLAS)
Compiler textbook bibliographies considered harmful

ACM SIGPLAN Notices
Weak and Mixed Strategy Precedence Parsing

Journal of the ACM (JACM)
On the Covering and Reduction Problems for Context-Free Grammars

Journal of the ACM (JACM)
Transforming LR(k) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context Grammars

Journal of the ACM (JACM)
LR Parsing

ACM Computing Surveys (CSUR)
A parser-generating system for constructing compressed compilers

Communications of the ACM
Simple LR(k) grammars

Communications of the ACM
Labelled precedence parsing

POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A new approach to teaching a first course in compiler construction

SIGCSE '76 Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education
Automatic generation of computer graphics languages

The papers of the ACM symposium on Graphic languages
Overview of the syntax processor generator SYNPROC

Proceedings of the international symposium on Extensible languages
Parallel non-deterministic bottom-up parsing

Proceedings of the international symposium on Extensible languages
An experience in structured programming and transferability

Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems
The structure of shared forests in ambiguous parsing

ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Compiler writing system

ACM SIGPLAN Notices - Abstracts in programming language-related research
Optimization using LR(k) techniques

ACM SIGPLAN Notices
Parsing incomplete sentences

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Generalized overlap resolvable grammars and their parsers

Journal of Computer and System Sciences

Quantified Score

Hi-index	48.25

Visualization

Abstract

A technique is developed for generating almost optimal Floyd-Evans productions given a precedence grammar. A graph formulation is used for the problem of merging productions. The productions generated correspond to the minimum cost inverse-arborescence of that graph. The validity of the technique is demonstrated for weak precedence grammars defined here, but the productions mechanically generated for any precedence grammar can often be modified in such a way that correct, almost optimal parsers are obtained.