Fast parallel recognition of LR language suffixes

Authors:
E. Bertsch;M.-J. Nederhof
Affiliations:
Ruhr University, Faculty of Mathematics, Universitätsstraße 150, D-44780 Bochum, Germany;University of Groningen, Faculty of Arts, P.O. Box 716, NL-9700 AS Groningen, The Netherlands
Venue:
Information Processing Letters
Year:
2004

Citing 13
Cited 0

Noncorrecting syntax error recovery

ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel time O (log n) recognition of unambiguous context-free languages

Information and Computation
On the complexity of parallel parsing of general context-free languages

Theoretical Computer Science
Parallel time O(log n) acceptance of deterministic CFLs on an exclusive-write P-RAM

SIAM Journal on Computing
On efficient computations of costs of paths on a grid graph

Information Processing Letters
On the parallel recognition of ambiguous context-free languages

Theoretical Computer Science
An introduction to parallel algorithms

An introduction to parallel algorithms
Fast recognition of deterministic cfl's with a smaller number of processors

Theoretical Computer Science
Recognizing substrings of LR(k) languages in linear time

ACM Transactions on Programming Languages and Systems (TOPLAS)
Linear-time suffix parsing for deterministic languages

Journal of the ACM (JACM)
Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages

Theoretical Computer Science
Regular Closure of Deterministic Languages

SIAM Journal on Computing
Parallel RAMs with owned global memory and deterministic context-free language recognition

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.89

Visualization

Abstract

It is shown that suffix recognition for deterministic context-free languages can be done on a PRAM multi-processor within the upper complexity bounds of the graph reachability problem.