The Complexity of LALR(k) Testing

Authors:
Seppo Sippu;Eljas Soisalon-Soininen;Esko Ukkonen
Affiliations:
Department of Computer Science, University of Helsinki, Tukholmankatu 2, SF-00250, Helsinki 25, Finland;Department of Computer Science, University of Helsinki, Tukholmankatu 2, SF-00250, Helsinki 25, Finland;Department of Computer Science, University of Helsinki, Tukholmankatu 2, SF-00250, Helsinki 25, Finland
Venue:
Journal of the ACM (JACM)
Year:
1983

Methods for Computing LALR(k) Lookahead

ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Introduction to Formal Language Theory

Introduction to Formal Language Theory
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
On LALR(1) Testing

Proceedings of the 8th Colloquium on Automata, Languages and Programming
LALR(k) testing is PSPACE-complete

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
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

Hi-index	0.00