scientific article; zbMATH DE number 4197438
From MaRDI portal
Publication:5203697
zbMATH Open0725.68066MaRDI QIDQ5203697FDOQ5203697
Authors: Peichen Pan
Publication date: 1989
Title of this publication is not available (Why is that?)
Recommendations
context-free grammarEarley's algorithmdesign and analysis of algorithmcontext-free parsing algorithm
Cited In (41)
- A cubic time extensions of context-free grammars
- Combinatorial Pattern Matching
- Multipass precedence analysis
- Title not available (Why is that?)
- The Cocke-Younger-Kasami algorithm. -- Revised
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized LR parsing for grammars with contexts
- Chart algorithm-based binary combinatorial grammar parsing
- An error correcting parser for context free grammars that takes less than cubic time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Practical Earley Parsing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient \(LR(1)\) processor construction
- A polynomial-time parsing algorithm for \(K\)-depth languages
- Pattern selector grammars and several parsing algorithms in the context- free style
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recognition is not parsing - SPPF-style parsing from cubic recognisers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast context-free grammar parsing requires fast Boolean matrix multiplication
- Title not available (Why is that?)
- Producing the left parse during bottom-up parsing
- Dynamic programming parsing for context-free grammars in continuous speech recognition
- FUNCTIONAL PEARL Functional chart parsing of context-free grammars
- Deterministic parsing for augmented context-free grammars
- A new approach to Earley's parsing algorithm
- Title not available (Why is that?)
- A yo-yo parsing algorithm for a large class of van Wijngaarden grammars
- Bounding the Maximal Parsing Performance of Non-Terminally Separated Grammars
- A Linear Parsing Algorithm For Parenthesis Terms
- Linear algorithm for lexicographic enumeration of CFG parse trees
- Title not available (Why is that?)
- On parsing and condensing substrings of LR languages in linear time
- A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead
- Generalized LR parsing algorithm for grammars with one-sided contexts
- Derivatives of parsing expression grammars
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5203697)