Efficient algorithms for structural similarity of grammars

Authors:
H. B. Hunt, III;D. J. Rosenkrantz
Affiliations:
SUNY at Albany, Albany, NY;SUNY at Albany, Albany, NY
Venue:
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
1980

Citing 4
Cited 1

On the Covering and Reduction Problems for Context-Free Grammars

Journal of the ACM (JACM)
Decidable Properties of Monadic Functional Schemas

Journal of the ACM (JACM)
The Theory of Parsing, Translation, and Compiling

The Theory of Parsing, Translation, and Compiling
On the complexity of grammar and related problems

STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing

Efficient algorithms for automatic construction and compactification of parsing

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient algorithms are presented for several grammar problems relevant to compiler construction. These problems include(i) testing, for a reduced context-free grammar G and an LL(k), uniquely invertible, or BRC(m,n) grammar H, if G is structurally contained by H, and(ii) testing, for a reduced context-free grammar G and a structurally unambiguous grammar H, if G is Reynolds covered by H or if there is an on to homomorphisem from G to H.Related complexity results are presented for several problems for the regular grammars, program schemes, and monadic program schemes.