An efficient all-parses systolic algorithm for general context-free parsing
From MaRDI portal
Publication:757072
DOI10.1007/BF01379361zbMath0723.68065MaRDI QIDQ757072
Oscar H. Ibarra, Michael A. Palis
Publication date: 1990
Published in: International Journal of Parallel Programming (Search for Journal in Brave)
68Q45: Formal languages and automata
68N20: Theory of compilers and interpreters
68Q42: Grammars and rewriting systems
Related Items
parallel parsing from recurrence equations, Systolic parsing of context-free languages, Fast systolic parsing of context free languages
Cites Work
- Systolic parsing of context-free languages
- General context-free recognition in less than cubic time
- Optimization of LR(k) parsers
- Parallel Parsing Algorithms and VLSI Implementations for Syntactic Pattern Recognition
- Parallel Parsing on a One-Way Array of Finite-State Machines
- Recognition and parsing of context-free languages in time n3
- An efficient context-free parsing algorithm
- Unnamed Item
- Unnamed Item