An efficient parallel parsing algorithm for context-free languages based on Earley's method

An efficient parallel parsing algorithm for context-free languages based on Earley's method

0.00 Avg rating0 Votes
Article ID: iaor19962188
Country: Japan
Volume: E79-A
Issue: 4
Start Page Number: 547
End Page Number: 552
Publication Date: Apr 1996
Journal: IEICE Transactions on Fundamentals
Authors: ,
Keywords: graphs, computational analysis: parallel computers
Abstract:

The authors propose a parallel parsing algorithm based on Earley's method, which works in equ1 time using equ2 processors on CREW PRAM. This algorithm runs with less number of processors compared with previously proposed W. Rytter's algorithm.

Reviews

Required fields are marked *. Your email address will not be published.