GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS
From MaRDI portal
Publication:5483377
DOI10.1142/S0129054106004029zbMATH Open1098.68060MaRDI QIDQ5483377FDOQ5483377
Publication date: 14 August 2006
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (17)
- A simple P-complete problem and its language-theoretic representations
- One-nonterminal conjunctive grammars over a unary alphabet
- Expressive power of \(\text{LL}(k)\) Boolean grammars
- Unambiguous Boolean grammars
- Developments in Language Theory
- An extension of context-free grammars with one-sided context specifications
- Fast parsing for Boolean grammars: a generalization of Valiant's algorithm
- Boolean grammars and gsm mappings
- LR parsing for conjunctive grammars
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- Language equations with complementation: expressive power
- Recursive descent parsing for Boolean grammars
- Generalized LR Parsing for Grammars with Contexts
- Title not available (Why is that?)
- LR parsing for LCFRS
- Parsing by matrix multiplication generalized to Boolean grammars
- Generalized LR parsing algorithm for grammars with one-sided contexts
This page was built for publication: GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5483377)