Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345MaRDI QIDQ5492910zbMATH OpenOpenAlexFDO

Authors Michał Wrona

Publication date 20 October 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11549345

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Locally stratified Boolean grammars
• Boolean grammars
• Well-Founded Semantics for Boolean Grammars
• scientific article; zbMATH DE number 2040923
• Well-founded semantics for Boolean grammars

Cited in

(10)

• Boolean grammars
• Recursive descent parsing for Boolean grammars
• Boolean grammars and gsm mappings
• Well-Founded Semantics for Boolean Grammars
• A Game-Theoretic Characterization of Boolean Grammars
• Conjunctive and Boolean grammars: the true general case of the context-free grammars
• A game-theoretic characterization of Boolean grammars
• Expressive power of \(\text{LL}(k)\) Boolean grammars
• Well-founded semantics for Boolean grammars
• Locally stratified Boolean grammars

This page was built for publication: Mathematical Foundations of Computer Science 2005

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492910)