GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS

DOI10.1142/S0129054106004029MaRDI QIDQ5483377zbMATH OpenFDO

Authors Alexander Okhotin

Publication date 14 August 2006

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054106004029

zbMATH Keywords

parsinglanguage equationsBoolean grammarsconjunctive grammarsbottom-upLRshift-reduce

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Developments in Language Theory
• LR parsing for conjunctive grammars
• Generalized LR parsing algorithm for grammars with one-sided contexts
• Generalized LR parsing for grammars with contexts
• Recursive descent parsing for Boolean grammars

Cites work

• scientific article; zbMATH DE number 5254145 (Why is no real title available?)
• Boolean grammars
• Even faster generalized LR parsing
• LR parsing for conjunctive grammars
• On the translation of languages from left to right
• Principles and implementation of deductive parsing

Cited in

(19)

• Generalized LR parsing algorithm for grammars with one-sided contexts
• 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
• Generalized LR parsing for grammars with contexts
• Developments in Language Theory
• An extension of context-free grammars with one-sided context specifications
• Boolean grammars and gsm mappings
• Fast parsing for Boolean grammars: a generalization of Valiant's algorithm
• 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
• Three-valued minimal semantic parsing of Boolean grammars
• LR parsing for LCFRS
• scientific article; zbMATH DE number 2087566 (Why is no real title available?)
• Parsing by matrix multiplication generalized to Boolean grammars
• A GLR-like parsing algorithm for three-valued interpretations of Boolean grammars with strong negation

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)