On the Covering and Reduction Problems for Context-Free Grammars

Authors:
James N. Gray;Michael A. Harrison
Affiliations:
IBM Thomas J. Watson research Center, P.O. Box 218, Yorktown Heights, NY and University of California, Berkeley, California;Department of Computer Science, University of California, Berkeley, California
Venue:
Journal of the ACM (JACM)
Year:
1972

Citing 12
Cited 17

Syntactic Analysis and Operator Precedence

Journal of the ACM (JACM)
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars

Journal of the ACM (JACM)
Parenthesis Grammars

Journal of the ACM (JACM)
Canonical Precedence Schemes

Journal of the ACM (JACM)
An efficient context-free parsing algorithm

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

Communications of the ACM
Bounded context syntactic analysis

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
Precedence languages and bounded right context languages

Precedence languages and bounded right context languages
Formal languages and their relation to automata

Formal languages and their relation to automata
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages

Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes

Journal of the ACM (JACM)
Early error detection in syntax-driven parsers

IBM Journal of Research and Development
Efficient algorithms for automatic construction and compactification of parsing

ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Canonical Precedence Schemes

Journal of the ACM (JACM)
On the Parsing of Deterministic Languages

Journal of the ACM (JACM)
An Observation on Relative Parsing Time

Journal of the ACM (JACM)
On the Complete Covering Problem for LR(k)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)
Noncounting Context-Free Languages

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

Journal of the ACM (JACM)
On the covering of left recursive grammars

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Efficient algorithms for structural similarity of grammars

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Jim Gray at Berkeley

ACM SIGMOD Record - Tribute to honor Jim Gray
Efficient learning of context-free grammars from positive structural examples

Information and Computation
The nonexistence of some covering context-free grammars

Information Processing Letters
On the equivalence, containment, and covering problems for the regular and context-free languages

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract