Thumbnail
Access Restriction
Subscribed

Author Nederhof, Mark-Jan ♦ Bertsch, Eberhard
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1996
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract We present a linear-time algorithm to decide for any fixed deterministic context-free language $\textit{L}$ and input string $\textit{w}$ whether $\textit{w}is$ a suffix of some string in $\textit{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.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1996-05-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 43
Issue Number 3
Page Count 31
Starting Page 524
Ending Page 554


Open content in new tab

   Open content in new tab
Source: ACM Digital Library