An efficient all-parses systolic algorithm for general context-free parsing

DOI10.1007/BF01379361zbMath0723.68065MaRDI QIDQ757072

Michael A. Palis, Oscar H. Ibarra

Publication date: 1990

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

zbMATH Keywords

systolic arraycontext-free grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Related Items (3)

parallel parsing from recurrence equations ⋮ Fast systolic parsing of context free languages ⋮ Systolic parsing of context-free languages

Cites Work

• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: An efficient all-parses systolic algorithm for general context-free parsing