parallel parsing from recurrence equations
From MaRDI portal
Publication:4870969
DOI10.1080/00207169608804462zbMath0841.68069MaRDI QIDQ4870969
David J. Evans, Corneliu Bârsan
Publication date: 8 April 1996
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169608804462
Uses Software
Cites Work
- Unnamed Item
- Systolic parsing of context-free languages
- An efficient all-parses systolic algorithm for general context-free parsing
- Parallel parsing on a one-way linear array of finite-state machines
- Parallel lexical analysis and parsing on the AMT distributed array processor
- Parallel Parsing Algorithms and VLSI Implementations for Syntactic Pattern Recognition
- The mapping of linear recurrence equations on regular arrays
- The Organization of Computations for Uniform Recurrence Equations
- An efficient context-free parsing algorithm