Parallel Parsing Algorithms and VLSI Implementations for Syntactic Pattern Recognition
From MaRDI portal
Publication:3311705
Cited in
(11)- A parallel parsing algorithm for arbitrary context-free grammars
- An NC algorithm for recognizing tree adjoining languages
- VLSI architectures for string matching and pattern matching
- Efficient reconfigurable embedded parsers
- Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs
- Parallel \(LL\) parsing
- An efficient all-parses systolic algorithm for general context-free parsing
- parallel parsing from recurrence equations
- Systolic parsing of context-free languages
- Efficient error-correcting parsing for (attributed and stochastic) tree grammars
- Algorithm partition and parallel recognition of general context-free languages using fixed-size VLSI architecture
This page was built for publication: Parallel Parsing Algorithms and VLSI Implementations for Syntactic Pattern Recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3311705)