Parallel string acceptance using lattice graphs

Authors:
Azriel Rosenfeld;Peter D Hyde
Affiliations:
Computer Vision Laboratory, Computer Science Center, University of Maryland, College Park, MD 20742, U.S.A.;Computer Vision Laboratory, Computer Science Center, University of Maryland, College Park, MD 20742, U.S.A.
Venue:
Pattern Recognition Letters
Year:
1983

Citing 3
Cited 1

Upper Bounds for Speedup in Parallel Parsing

Journal of the ACM (JACM)
Formal languages and their relation to automata

Formal languages and their relation to automata
General context-free recognition in less than cubic time

Journal of Computer and System Sciences

A non-left-to-right, non-directional parser for ambiguous lattices

Pattern Recognition Letters

Quantified Score

Hi-index	0.10

Visualization

Abstract

This paper describes a method of string acceptance with respect to a given grammar G by repeatedly applying the rules of G in parallel. The process differs from previous work in parallel string recognition in that when a rule, say @a-@b, is applied, @b is not replaced by @a; rather, a 'string bypass', consisting of @a, is created that joins the left context of @b to its right context. Thus, the process creates a 'lattice graph' in which any directed path from the least element to the greatest element is a string derivable (in reverse) by a sequence of rewritings of @s. For context-free grammars, this process does not lead to a combinatorial explosion, and could thus be used to parse strings very rapidly if suitable parallel hardware were available.