Parallel Earley's parser and its application to syntactic image analysis
A complete Earley parser which includes recognition and parse extraction has been implemented on a triangular array of processors. The detailed analysis of the complete parser is given. The recognition algorithm is executed in parallel by adopting a new operator, x/sup */, and restricting the input context-free grammar to be lamda-free. The parse extraction algorithm which follows recognition uses a nonrecursive subroutine to generate the correct right-parse in parallel. A special busing arrangement within this array enables the right data to reach the right place at the right time. Simulation examples are provided. The results show that when a string of length >n> is under testing, at the system time 2>n> + 1, the correct right-parse will be obtained if the string is accepted. 15 references.
- OSTI ID:
- 5209642
- Resource Relation:
- Conference: Sponsored by IEEE, Pasadena, CA, USA, 12 Oct 1983
- Country of Publication:
- United States
- Language:
- English
Similar Records
VLSI architecture for fast context-free language recognition (Earley's algorithm)
VLSI architectures for syntactic pattern recognition