An efficient all-parses systolic algorithm for general context-free parsing

DOI10.1007/BF01379361zbMATH Open0723.68065MaRDI QIDQ757072FDOQ757072

Authors: Oscar H. Ibarra, Michael A. Palis 

Publication date: 1990

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

Recommendations

• scientific article; zbMATH DE number 140485
• scientific article; zbMATH DE number 4205997
• Systolic parsing of context-free languages
• scientific article; zbMATH DE number 4197438
• scientific article; zbMATH DE number 4119661

zbMATH Keywords

context-free grammarsystolic array

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Cites Work

• An efficient context-free parsing algorithm
• Recognition and parsing of context-free languages in time n3
• General context-free recognition in less than cubic time
• Optimization of LR(k) parsers
• Title not available (Why is that?)
• Systolic parsing of context-free languages
• Parallel Parsing on a One-Way Array of Finite-State Machines
• Parallel Parsing Algorithms and VLSI Implementations for Syntactic Pattern Recognition
• Title not available (Why is that?)

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• parallel parsing from recurrence equations
• Systolic parsing of context-free languages
• Fast systolic parsing of context free languages
• A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead

This page was built for publication: An efficient all-parses systolic algorithm for general context-free parsing

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