Parallel \(LL\) parsing

DOI10.1007/s00236-006-0031-yzbMath1111.68049OpenAlexW4241089204MaRDI QIDQ878376

Ladislav Vagner, Bořivoj Melichar

Publication date: 26 April 2007

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-006-0031-y

zbMATH Keywords

\(LLP\) grammarsdeterministic parallel \(LL\) parsing algorithm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Parallel algorithms in computer science (68W10) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel parsing on the connection machine
• Parallel lexical analysis and parsing on the AMT distributed array processor
• A parallel parsing algorithm for arbitrary context-free grammars
• 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
• Speed of Recognition of Context-Free Languages by Array Automata
• Notes on top-down languages
• Even faster generalized LR parsing