Well-Founded Semantics for Boolean Grammars

DOI10.1007/11779148_19MaRDI QIDQ3617058zbMATH OpenOpenAlexFDO

Authors Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis

Publication date 26 March 2009

Published in Developments in Language Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Well-founded semantics for Boolean grammars
• Boolean grammars
• Unambiguous Boolean grammars
• scientific article; zbMATH DE number 2040923
• Mathematical Foundations of Computer Science 2005

Cited in

(9)

• Boolean grammars
• Recursive descent parsing for Boolean grammars
• A Game-Theoretic Characterization of Boolean Grammars
• Mathematical Foundations of Computer Science 2005
• 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
• Unambiguous Boolean grammars

This page was built for publication: Well-Founded Semantics for Boolean Grammars

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