Some properties of precedence languages

Authors:
Michael J. Fischer
Affiliations:
Carnegie-Mellon University, Pittsburgh, Pennsylvania
Venue:
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Year:
1969

Citing 4
Cited 20

Syntactic Analysis and Operator Precedence

Journal of the ACM (JACM)
Parenthesis Grammars

Journal of the ACM (JACM)
EULER: a generalization of ALGOL and it formal definition: Part 1

Communications of the ACM
Formal languages and their relation to automata

Formal languages and their relation to automata

Weak and Mixed Strategy Precedence Parsing

Journal of the ACM (JACM)
An Algorithm for the Design of Simple Precedence Grammars

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

Journal of the ACM (JACM)
Canonical Precedence Schemes

Journal of the ACM (JACM)
On the Tape Complexity of Deterministic Context-Free Languages

Journal of the ACM (JACM)
An Iteration Theorem for Simple Precedence Languages

Journal of the ACM (JACM)
Deterministic parsing of ambiguous grammars

Communications of the ACM
The equivalence of reducing transition languages and deterministic languages

Communications of the ACM
A Boolean matrix method for the computation of linear precedence functions

Communications of the ACM
A technique for generating almost optimal Floyd-Evans productions for precedence grammars

Communications of the ACM
Deterministic parsing of ambiguous grammars

POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On deterministic context-free languages, multihead automata, and the power of an auxiliary pushdown store

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
A result on the relationship between simple precedence languages and reducing transition languages

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Overview of the syntax processor generator SYNPROC

Proceedings of the international symposium on Extensible languages
A Stochastic Syntax Analysis Procedure and Its Application to Pattern Classification

IEEE Transactions on Computers
Applications of language theory to compiler design

AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Generalized overlap resolvable grammars and their parsers

Journal of Computer and System Sciences
Precedence automata and languages

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Operator precedence and the visibly pushdown property

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Operator precedence and the visibly pushdown property

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.06

Visualization

Abstract

The classes of languages definable by operator precedence grammars1 and by Wirth-Weber precedence grammars2 are studied. A grammar is backwards-deterministic3 if no two productions have the same right part. Operator precedence grammars have no more generative power than backwards deterministic operator precedence grammars, but Wirth-Weber precedence grammars (i.e., grammars having unique Wirth-Weber precedence relations) are more powerful than backwards-deterministic Wirth-Weber precedence grammars; indeed they can generate any context-free language. An algorithm is developed for finding a Wirth-Weber precedence grammar equivalent to a given operator precedence grammar, a result of possible practical significance. The operator precedence languages are shown to be a proper subclass of the backwards-deterministic Wirth-Weber precedence languages which in turn are a proper subclass of the deterministic context-free languages.