Linear-time suffix parsing for deterministic languages-Reference-Cited by-同舟云学术

Linear-time suffix parsing for deterministic languages

Published:1996-05 Issue:3 Volume:43 Page:524-554
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Nederhof Mark-Jan¹,Bertsch Eberhard²

Affiliation:

1. University of Groningen, Faculty of Arts, P.O. Box 716, 9700 AS Groningen, The Netherlands

2. Ruhr University, Bochum, Germany

Abstract

We present a linear-time algorithm to decide for any fixed deterministic context-free language L and input string w whether w is a suffix of some string in L . In contrast to a previously published technique, the decision procedure may be extended to produce syntactic structures (parses) without an increase in time complexity. We also show how this algorithm may be applied to pocess incorrect input in linear time.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

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

Reference23 articles.

1. Time and tape complexity of pushdown automaton languages;AHO A. V.;Inf. Cont.,1968

2. Recognizing substrings of LR(k) languages in linear time

3. Bt~.R-rSctt. E. 1994. An asymptotically optimal algorithm for noncorrecting L L(I) error recovery. Bericht Nr. I76 Fakult~it for Mathematik Ruhr-Universit~it Bochum. Bt~.R-rSctt. E. 1994. An asymptotically optimal algorithm for noncorrecting L L(I) error recovery. Bericht Nr. I76 Fakult~it for Mathematik Ruhr-Universit~it Bochum.

4. The structure of shared forests in ambiguous parsing

5. B()t~'K.~ ~: RT. M. PIR()rrl~ A. AND SNEI.I.IN(; M. 1975. Efficient parsing algorithms for general context-free parsers ln.f Sci. 8 t-26. B()t~'K.~ ~: RT. M. PIR()rrl~ A. AND SNEI.I.IN(; M. 1975. Efficient parsing algorithms for general context-free parsers ln.f Sci. 8 t-26.

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

1. Detecting useless transitions in pushdown automata;Information and Computation;2021-08

2. Detecting Useless Transitions in Pushdown Automata;Language and Automata Theory and Applications;2017

3. String Analysis as an Abstract Interpretation;Lecture Notes in Computer Science;2011

4. Fast parallel recognition of LR language suffixes;Information Processing Letters;2004-12

5. Robust Parsing of Word Graphs;Robustness in Language and Speech Technology;2001