On the complexity of LR(k) testing
From MaRDI portal
Publication:4080747
DOI10.1145/361227.361232zbMath0318.68052OpenAlexW2027251041MaRDI QIDQ4080747
Jeffrey D. Ullman, Thomas G. Szymanski, Harry B. III Hunt
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
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (9)
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 ⋮ On a method for optimizing LR parsers ⋮ Concerning bounded-right-context grammars ⋮ Complexity metatheorems for context-free grammar problems ⋮ On comparingLL(k) andLR(k) grammars ⋮ Lower bounds on the size of deterministic parsers ⋮ On the complexity of LL(k) testing
This page was built for publication: On the complexity of LR(k) testing
