On the complexity of LR(k) testing
Communications of the ACM
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Characterizations of the LL(k) Property
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Efficient computation of LALR(1) look-ahead sets
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
The Complexity of LALR(k) Testing
Journal of the ACM (JACM)
| Hi-index | 0.00 |
The problem of testing whether or not an arbitrary context-free grammar is LALR(k) for a fixed integer k ≥ 1 (i.e. only the subject grammar is a problem parameter) is shown to be PSPACE-complete. The result is in contrast with testing the membership in several other easily parsed classes of grammars, such as LR(k), SLR(k), LC(k) and LL(k) grammars, for which deterministic polynomial time membership tests are known. The PSPACE-hardness of the problem is proved using a transformation from the finite state automaton non-universality problem. A nondeterministic algorithm for constructing sets of LR(k) items leads to a polynomially space bounded algorithm for LALR(k) testing.