Parallel recognition and parsing on mesh connected computers with multiple broadcasting

DOI10.1016/0096-0551(94)90013-2MaRDI QIDQ4301319zbMATH OpenOpenAlexFDO

Authors B. Pradeep, C. Siva Ram Murthy

Publication date 9 May 1995

Published in Computer Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0096-0551(94)90013-2

zbMATH Keywords

context-free languagesmultiple broadcastingparsingrecognition

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Recommendations

• A parallel parsing algorithm for arbitrary context-free grammars
• Algorithm partition and parallel recognition of general context-free languages using fixed-size VLSI architecture
• scientific article; zbMATH DE number 4119661
• scientific article; zbMATH DE number 4205997
• Formulation and analysis of parallel context-free recognition and parsing on a PRAM model

Cited in

(8)

• Algorithm partition and parallel recognition of general context-free languages using fixed-size VLSI architecture
• A parallel parsing algorithm for arbitrary context-free grammars
• Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
• scientific article; zbMATH DE number 1690124 (Why is no real title available?)
• scientific article; zbMATH DE number 2079876 (Why is no real title available?)
• scientific article; zbMATH DE number 4119661 (Why is no real title available?)
• Efficient divide-and-conquer parsing of practical context-free languages
• Formulation and analysis of parallel context-free recognition and parsing on a PRAM model

This page was built for publication: Parallel recognition and parsing on mesh connected computers with multiple broadcasting

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