An Overview of the Theory of Computational Complexity
Journal of the ACM (JACM)
On the Covering and Reduction Problems for Context-Free Grammars
Journal of the ACM (JACM)
On the Parsing of Deterministic Languages
Journal of the ACM (JACM)
On the Complete Covering Problem for LR(k)Grammars
Journal of the ACM (JACM)
Lower Bounds and Reductions Between Grammar Problems
Journal of the ACM (JACM)
Compiler Design Theory
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
Generalized bottom-up parsing.
Generalized bottom-up parsing.
Formal languages and their relation to automata
Formal languages and their relation to automata
Efficient algorithms for automatic construction and compactification of parsing
ACM Transactions on Programming Languages and Systems (TOPLAS)
The language intersection problem for non-recursive context-free grammars
Information and Computation
| Hi-index | 0.00 |