Systolic parsing of context-free languages

DOI10.1007/BF01379362zbMath0722.68073MaRDI QIDQ756431

Laurent Langlois

Publication date: 1990

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

zbMATH Keywords

dynamic programmingcontext-free languagesystolic arrayprocessor arrayparallel parsingcompiling

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 ⋮ An efficient all-parses systolic algorithm for general context-free parsing

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient all-parses systolic algorithm for general context-free parsing
• Spacetime representations of computational structures
• Parallel parsing on the connection machine
• Tree-size bounded alternation
• 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
• On Parsing and Compiling Arithmetic Expressions on Vector Computers
• Upper Bounds for Speedup in Parallel Parsing
• Speed of Recognition of Context-Free Languages by Array Automata
• An efficient context-free parsing algorithm

This page was built for publication: Systolic parsing of context-free languages