Affiliation:
1. Univ. of California, Berkeley
Abstract
A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both Knuth's LR(
k
) algorithm and the familiar top-down algorithm. It has a time bound proportional to
n
3
(where
n
is the length of the string being parsed) in general; it has an
n
2
bound for unambiguous grammars; and it runs in linear time on a large class of grammars, which seems to include most practical context-free programming language grammars. In an empirical comparison it appears to be superior to the top-down and bottom-up algorithms studied by Griffiths and Petrick.
Publisher
Association for Computing Machinery (ACM)
Cited by
696 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Enumerating grammar-based extractions;Discrete Applied Mathematics;2023-12
2. Fulmqa: a fuzzy logic-based model for social media data quality assessment;Social Network Analysis and Mining;2023-11-08
3. Saggitarius: A DSL for Specifying Grammatical Domains;Proceedings of the ACM on Programming Languages;2023-10-16
4. Rhombus: A New Spin on Macros without All the Parentheses;Proceedings of the ACM on Programming Languages;2023-10-16
5. An Arabic Probabilistic Parser Based on a Property Grammar;ACM Transactions on Asian and Low-Resource Language Information Processing;2023-10-13