A parallel parsing algorithm for arbitrary context-free grammars

DOI10.1016/0020-0190(96)00023-3zbMath1023.68879OpenAlexW1525869800WikidataQ127296904 ScholiaQ127296904MaRDI QIDQ1350210

Dong-Yul Ra, Jong-Hyun Kim

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00023-3

zbMATH Keywords

parallel algorithmscontext-free grammarsmultiprocessorsparsing

Mathematics Subject Classification ID

Theory of programming languages (68N15) Parallel algorithms in computer science (68W10) Grammars and rewriting systems (68Q42)

Related Items (2)

Parallel \(LL\) parsing ⋮ Efficient reconfigurable embedded parsers

Uses Software

• PROTEUS

Cites Work

• 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
• Parallel recognition and parsing on the hypercube

This page was built for publication: A parallel parsing algorithm for arbitrary context-free grammars