On the complexity of LR(k) testing
From MaRDI portal
Publication:4080747
DOI10.1145/361227.361232zbMath0318.68052MaRDI QIDQ4080747
Jeffrey D. Ullman, Harry B. III Hunt, Thomas G. Szymanski
Publication date: 1975
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/361227.361232
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
68N01: General topics in the theory of software
68W99: Algorithms in computer science
Related Items
Lower bounds on the size of deterministic parsers, On the complexity of LL(k) testing, A Yacc extension for LRR grammar parsing, A parsing automata approach to LR theory, Diagnostics on LALR(k) conflicts based on a method for LR(k) testing, Concerning bounded-right-context grammars, Complexity metatheorems for context-free grammar problems, On a method for optimizing LR parsers, On comparingLL(k) andLR(k) grammars