Efficient algorithms for automatic construction and compactification of parsing

Authors:
D. J. Rosenkrantz;H. B. Hunt
Affiliations:
State Univ. of New York at Albany, Albany;State Univ. of New York at Albany, Albany
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1987

Citing 10
Cited 1

Parenthesis Grammars

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

Journal of the ACM (JACM)
On the Decidability of Grammar Problems

Journal of the ACM (JACM)
The Complexity of LALR(k) Testing

Journal of the ACM (JACM)
On the complexity of LR(k) testing

Communications of the ACM
Context-Free Grammars: Covers, Normal Forms, and Parsing

Context-Free Grammars: Covers, Normal Forms, and Parsing
Efficient algorithms for structural similarity of grammars

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compiler Design Theory

Compiler Design Theory
The theory of parsing, translation, and compiling

The theory of parsing, translation, and compiling
The influence of productions on derivations and parsing (Extended Abstract)

POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages

Grammatical abstraction and incremental syntax analysis in a language-based editor

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several computational problems about grammars are studied. Efficient algorithms are presented for the problems of (1) determining, for a given semantic grammar, if there exists a related parsing grammar in some specified grammar class, and (2) finding such a related parsing grammar when one exists. The two grammars are to be related by mergers of nonterminals and/or terminals. Efficient algorithms are presented for most of the grammar classes used in compilers. We also study the problem of (3) determining which terminals of a grammar are good candidates for merger into common lexical tokens of the corresponding parsing grammar.