Semantic Scholar uses AI to extract papers important to this topic.
It is proved that the language family generated by Boolean grammars is effectively closed under injective gsm mappings and… Expand The well-known parsing algorithm for the context-free grammars due to Valiant ("General context-free recognition in less than… Expand Boolean grammars [A. Okhotin, Boolean grammars, Information and Computation 194 (1) (2004) 19-48] are a promising extension of… Expand Boolean grammars are an extension of context-free grammars, in which conjunction and negation may be explicitly used in the rules… Expand The family of languages generated by Boolean grammars and usable with recursive descent parsing is studied. It is demonstrated… Expand The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a… Expand We study Boolean grammars. We introduce stratified semantics for Boolean grammars. We show, how to check, if a Boolean grammar… Expand A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an… Expand This paper establishes computational equivalence of two seemingly unrelated concepts: linear conjunctive grammars and trellis… Expand As a direct continuation of the earlier research on conjunctive grammars - context-free grammars equipped with intersection… Expand