An Improved Context-Free Recognizer-Reference-Cited by-同舟云学术

An Improved Context-Free Recognizer

Published:1980-07 Issue:3 Volume:2 Page:415-462
ISSN:0164-0925
Container-title:ACM Transactions on Programming Languages and Systems
language:en
Short-container-title:ACM Trans. Program. Lang. Syst.

Author:

Graham Susan L.¹,Harrison Michael¹,Ruzzo Walter L.²

Affiliation:

1. Computer Science Division, University of California, Berkeley, CA

2. Paul G. Allen School of Computer Science & Engineering, University of Washington, Seattle, WA

Abstract

A new algorithm for recognizing and parsing arbitrary context-free languages is presented, and several new results are given on the computational complexity of these problems. The new algorithm is of both practical and theoretical interest. It is conceptually simple and allows a variety of efficient implementations, which are worked out in detail. Two versions are given which run in faster than cubic time. Surprisingly close connections between the Cocke-Kasami-Younger and Earley algorithms are established which reveal that the two algorithms are “almost” identical.

Publisher

Association for Computing Machinery (ACM)

Subject

Software

Link

https://dl.acm.org/doi/pdf/10.1145/357103.357112

Reference35 articles.

1. On economical construction of the transitive closure of a directed graph;ARLAZAROV V.L.;Dokl. Akad. Nauk SSSR,1970

2. Efficient parsing algorithms for general context-free parsers

Cited by 103 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Syntactic Pattern Recognition for the Prediction of L-Type Pseudoknots in RNA;Applied Sciences;2023-04-21

2. Knotify+: Toward the Prediction of RNA H-Type Pseudoknots, Including Bulges and Internal Loops;Biomolecules;2023-02-06

3. Time-and-Space-Efficient Weighted Deduction;Transactions of the Association for Computational Linguistics;2023

4. Bibliography;Engineering a Compiler;2023

5. Instruction Selection;Engineering a Compiler;2023