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
SPPF (shared packed parse forest) is the best known graph representation of a parse forest (family of related parse trees) used… 
2010
2010
  • A. Okhotin
  • Developments in Language Theory
  • 2010
  • Corpus ID: 1337403
The well-known parsing algorithm for the context-free grammars due to Valiant ("General context-free recognition in less than… 
2010
2010
It is proved that the language family generated by Boolean grammars is effectively closed under injective gsm mappings and… 
2007
2007
The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which… 
2006
2006
  • A. Okhotin
  • Int. J. Found. Comput. Sci.
  • 2006
  • Corpus ID: 15251745
The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a… 
2005
2005
We study Boolean grammars. We introduce stratified semantics for Boolean grammars. We show, how to check, if a Boolean grammar… 
2004
2004
  • A. Okhotin
  • Theor. Comput. Sci.
  • 2004
  • Corpus ID: 15046272
Highly Cited
2004
Highly Cited
2004
  • A. Okhotin
  • RAIRO Theor. Informatics Appl.
  • 2004
  • Corpus ID: 36191995
This paper establishes computational equivalence of two seemingly unrelated concepts: linear conjunctive grammars and trellis… 
Highly Cited
2003
Highly Cited
2003
  • A. Okhotin
  • Developments in Language Theory
  • 2003
  • Corpus ID: 6890024
As a direct continuation of the earlier research on conjunctive grammars - context-free grammars equipped with intersection…