Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,398,464 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Comparison of parser generators
Conjunctive grammar
DLT
Formal language
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Source Transformation with Boolean Grammars
Andrew Stevenson
2015
Corpus ID: 210936558
We propose an enhancement to current parsing and transformation systems by leveraging the expressive power of Boolean grammars, a…
Expand
2014
2014
An extension of context-free grammars with one-sided context specifications
M. Barash
,
A. Okhotin
Information and Computation
2014
Corpus ID: 12262732
2010
2010
Boolean Grammars and GSM Mappings
T. Lehtinen
,
A. Okhotin
International Journal of Foundations of Computer…
2010
Corpus ID: 811525
It is proved that the language family generated by Boolean grammars is effectively closed under injective gsm mappings and…
Expand
2008
2008
On the Semantic Approaches to Boolean Grammars
Vassilis Kountouriotis
,
C. Nomikos
,
P. Rondogiannis
Topological and Game-Theoretic Aspects of…
2008
Corpus ID: 16739295
Boolean grammars extend context-free grammars by allowing conjunction and negation in rule bodies. This new formalism appears to…
Expand
2007
2007
Recursive descent parsing for Boolean grammars
A. Okhotin
Acta Informatica
2007
Corpus ID: 12917673
The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which…
Expand
Review
2007
Review
2007
Nine Open Problems on Conjunctive and Boolean Grammars
A. Okhotin
Bull. EATCS
2007
Corpus ID: 11639501
Conjunctive grammars are context-free grammars with an explicit conjunction operation in the formalism of rules; Boolean grammars…
Expand
2006
2006
Scannerless Boolean Parsing
Adam Megacz
LDTA@ETAPS
2006
Corpus ID: 11065686
2006
2006
sbp: A Scannerless Boolean Parser
Adam Megacz
2006
Corpus ID: 16742870
Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications…
Expand
2005
2005
Stratified Boolean Grammars
Michał Wrona
International Symposium on Mathematical…
2005
Corpus ID: 37087057
We study Boolean grammars. We introduce stratified semantics for Boolean grammars. We show, how to check, if a Boolean grammar…
Expand
2004
2004
An extension of recursive descent parsing for Boolean grammars
A. Okhotin
2004
Corpus ID: 14341515
The well-known recursive descent parsing method for context-free grammars is extended for their generalization, Boolean grammars…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE