Systolic parsing of context-free languages
- Cite this article as:
- Langlois, L. Int J Parallel Prog (1990) 19: 333. doi:10.1007/BF01379362
- 27 Downloads
We report on a new systolic context-free language parsing algorithm. We present both single parse and multiple parse versions of the algorithm. For an input of lengthn the single parse version has a time complexity ofO(n) and a space complexity ofO(n)2. This equals the performance of the most effcient known single parse algorithm. The space complexity of the multiple parse version is also ofO(n)2 while its time complexity is ofO(mn) wherem is the number of differenti parses for the input. This equals the time complexity of the most efficient known multiple parse algorithms and brings an improvenment of a factor of logn over its space complexity.