An Improved Context-Free Recognizer
From MaRDI portal
Publication:3911426
DOI10.1145/357103.357112zbMath0461.68084MaRDI QIDQ3911426
Walter L. Ruzzo, Michael A. Harrison, Susan L. Graham
Publication date: 1980
Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/357103.357112
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
68N20: Theory of compilers and interpreters
68N25: Theory of operating systems
Related Items
Conjunctive and Boolean grammars: the true general case of the context-free grammars, Sparse RNA folding: time and space efficient algorithms, An efficient recognizer for the Boolean closure of context-free languages, A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead, Parallel on-line parsing in constant time per word, A recognition and parsing algorithm for arbitrary conjunctive grammars., New architectures for constructed complex systems, A divide-and-conquer approach to general context-free parsing, Finding the smallest binarization of a CFG is NP-hard, Schrödinger's token, Direct parsing of ID/LP grammars