GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS
From MaRDI portal
Publication:5483377
Recommendations
Cites work
Cited in
(17)- Fast parsing for Boolean grammars: a generalization of Valiant's algorithm
- Boolean grammars and gsm mappings
- Language equations with complementation: expressive power
- Expressive power of \(\text{LL}(k)\) Boolean grammars
- scientific article; zbMATH DE number 2087566 (Why is no real title available?)
- Recursive descent parsing for Boolean grammars
- Unambiguous Boolean grammars
- Parsing by matrix multiplication generalized to Boolean grammars
- LR parsing for LCFRS
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- A simple P-complete problem and its language-theoretic representations
- LR parsing for conjunctive grammars
- Developments in Language Theory
- One-nonterminal conjunctive grammars over a unary alphabet
- Generalized LR parsing for grammars with contexts
- An extension of context-free grammars with one-sided context specifications
- 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)