On the complexity of LR(k) testing

DOI10.1145/361227.361232MaRDI QIDQ4080747zbMATH OpenOpenAlexFDO

Authors Thomas G. Szymanski, Jeffrey D. Ullman, H. 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

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Cited in

(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
• 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
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4080747)