A parallel parsing algorithm for arbitrary context-free grammars

DOI10.1016/0020-0190(96)00023-3MaRDI QIDQ1350210zbMATH OpenOpenAlexWikidataFDO

Authors 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

context-free grammarsparallel algorithmsparsingmultiprocessors

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4119661
• scientific article; zbMATH DE number 975704
• Parallel recognition and parsing on mesh connected computers with multiple broadcasting
• On the complexity of parallel parsing of general context-free languages
• Formulation and analysis of parallel context-free recognition and parsing on a PRAM model

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
• Parallel recognition and parsing on the hypercube
• Speed of Recognition of Context-Free Languages by Array Automata

Cited in

(24)

• Algorithm partition and parallel recognition of general context-free languages using fixed-size VLSI architecture
• Systolic parsing of context-free languages
• Parallel Parsing on a One-Way Array of Finite-State Machines
• scientific article; zbMATH DE number 140485 (Why is no real title available?)
• scientific article; zbMATH DE number 1759522 (Why is no real title available?)
• scientific article; zbMATH DE number 3860425 (Why is no real title available?)
• Parallel \(LL\) parsing
• Deterministic parsing for augmented context-free grammars
• Parallel recognition and parsing on mesh connected computers with multiple broadcasting
• scientific article; zbMATH DE number 1690124 (Why is no real title available?)
• A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead
• scientific article; zbMATH DE number 140111 (Why is no real title available?)
• Efficient parallel and incremental parsing of practical context-free languages
• Optimal parallel parsing of bracket languages
• scientific article; zbMATH DE number 4119661 (Why is no real title available?)
• Efficient divide-and-conquer parsing of practical context-free languages
• Pattern selector grammars and several parsing algorithms in the context- free style
• Logical Aspects of Computational Linguistics
• Efficient reconfigurable embedded parsers
• On the complexity of parallel parsing of general context-free languages
• Bounding the Maximal Parsing Performance of Non-Terminally Separated Grammars
• INSTANCE-SPECIFIC SOLUTIONS FOR ACCELERATING THE CKY PARSING OF LARGE CONTEXT-FREE GRAMMARS
• scientific article; zbMATH DE number 1955814 (Why is no real title available?)
• scientific article; zbMATH DE number 4121469 (Why is no real title available?)

Describes a project that uses

Uses Software

• PROTEUS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1350210)