Skip to search formSkip to main contentSkip to account menu

Boolean grammar

Boolean grammars are a class of formal grammars studied in formal language theory. They extend the basic type of grammars, the context-free grammars… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We propose an enhancement to current parsing and transformation systems by leveraging the expressive power of Boolean grammars, a… 
2010
2010
It is proved that the language family generated by Boolean grammars is effectively closed under injective gsm mappings and… 
2008
2008
Boolean grammars extend context-free grammars by allowing conjunction and negation in rule bodies. This new formalism appears to… 
2007
2007
The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which… 
Review
2007
Review
2007
Conjunctive grammars are context-free grammars with an explicit conjunction operation in the formalism of rules; Boolean grammars… 
2006
2006
2006
2006
Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications… 
2005
2005
We study Boolean grammars. We introduce stratified semantics for Boolean grammars. We show, how to check, if a Boolean grammar… 
2004
2004
The well-known recursive descent parsing method for context-free grammars is extended for their generalization, Boolean grammars…