Lower Bounds and Reductions Between Grammar Problems

Authors:
Harry B. Hunt, III;Thomas G. Szymanski
Affiliations:
Harvard University, Cambridge, Massachusetts and Department of Electrical Engineering and Computer Science, Columbia University, New York, NY;Department of Electrical Engineering and Computer Science, Princeton University, Princeton, NJ
Venue:
Journal of the ACM (JACM)
Year:
1978

Syntax-Directed Transduction

Journal of the ACM (JACM)
Operations on sparse relations

Communications of the ACM
On the complexity of LR(k) testing

Communications of the ACM
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
The theory of parsing, translation, and compiling

The theory of parsing, translation, and compiling
Dichotomization, reachability, and the forbidden subgraph problem(Extended Abstract)

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
A new grammatical transformation into LL(k) form (Extended Abstract)

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing

Hi-index	0.00