parallel parsing from recurrence equations

DOI10.1080/00207169608804462zbMATH Open0841.68069OpenAlexW1998024048MaRDI QIDQ4870969FDOQ4870969

Authors: Corneliu Bârsan, D. J. Evans 

Publication date: 8 April 1996

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169608804462

Recommendations

• scientific article; zbMATH DE number 4119661
• A parallel parsing algorithm for arbitrary context-free grammars
• scientific article; zbMATH DE number 4205997
• scientific article; zbMATH DE number 140111

zbMATH Keywords

parallel parsingVLSI automatic synthesis procedures

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• An efficient context-free parsing algorithm
• Title not available (Why is that?)
• Systolic parsing of context-free languages
• The Organization of Computations for Uniform Recurrence Equations
• Parallel Parsing Algorithms and VLSI Implementations for Syntactic Pattern Recognition
• The mapping of linear recurrence equations on regular arrays
• An efficient all-parses systolic algorithm for general context-free parsing
• Parallel lexical analysis and parsing on the AMT distributed array processor
• Parallel parsing on a one-way linear array of finite-state machines

Cited In (1)

• Title not available (Why is that?)

Uses Software

• YACC

This page was built for publication: parallel parsing from recurrence equations

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