Boolean grammars, introduced by Okhotin [Wikidata], are a class of formal grammars studied in formal language theory. They extend the basic type of grammars...

grammars, deterministic Boolean grammars. This table compares parser generator languages with a general context-free grammar, a conjunctive grammar,...

1016/s0022-0000(75)80046-8. Lillian Lee (2002). "Fast Context-Free Grammar Parsing Requires Fast Boolean Matrix Multiplication" (PDF). J ACM. 49 (1): 1–15. arXiv:cs/0112018...

In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the...

grammars. Conjunction can be used, in particular, to specify intersection of languages. A further extension of conjunctive grammars known as Boolean grammars...

In computer science, a Van Wijngaarden grammar (also vW-grammar or W-grammar) is a formalism for defining formal languages. The name derives from the...

In mathematics, a Boolean function is a function whose arguments and result assume values from a two-element set (usually {true, false}, {0,1} or {−1...

syntax utilizing the LPeg library. Boolean context-free grammar Compiler Description Language (CDL) Formal grammar Regular expression Top-down parsing...

The Scannerless Boolean Parser is an open-source scannerless GLR parser generator for boolean grammars. It was implemented in the Java programming language...

A formal grammar is a set of symbols and the production rules for rewriting some of them into every possible string of a formal language over an alphabet...

expressions that a binary expression tree can represent are algebraic and boolean. These trees can represent expressions that contain both unary and binary...

scanner-based parsing. SBP is a scannerless parser for Boolean grammars (a superset of context-free grammars), written in Java. Laja is a two-phase scannerless...

developed by John Backus and Peter Naur. It is a metasyntax for context-free grammars, providing a precise way to outline the rules of a language's structure...

form (Boolean algebra) Boolean conjunctive query Boolean-valued model Boolean domain Boolean expression Boolean ring Boolean function Boolean-valued...

Lee, Lillian (January 2002). "Fast Context-Free Grammar Parsing Requires Fast Boolean Matrix Multiplication" (PDF). J ACM. 49 (1): 1–15. arXiv:cs/0112018...

conjunctive grammars. By this method Jeż and Okhotin proved that every recursive unary language is a unique solution of some equation. Boolean grammar Arden's...

site Alexander Okhotin's Conjunctive Grammars Page Alexander Okhotin's Boolean Grammars Page The Packrat Parsing and Parsing Expression Grammars Page...

approach to graph rewriting, based mainly on Boolean algebra and an algebra of matrices, called matrix graph grammars. Yet another approach to graph rewriting...

F. (1991). Logic, Language and Meaning: Intensional Logic and Logical Grammar. University of Chicago Press. p. 122. ISBN 0-226-28088-8. King, Jeffrey...

will come.' Affirming a disjunct Boolean algebra (logic) Boolean algebra topics Boolean domain Boolean function Boolean-valued function Conjunction/disjunction...

elimination Conjunction (grammar) De Morgan's laws First-order logic Fréchet inequalities Homogeneity (linguistics) List of Boolean algebra topics Logical...

characters: a1 ... an. let the grammar contain r nonterminal symbols R1 ... Rr, with start symbol R1. let P[n,n,r] be an array of booleans. Initialize all elements...

relations. Any set of sets closed under the set-theoretic operations forms a Boolean algebra with the join operator being union, the meet operator being intersection...

Parsing," Perfection, Vol. 1 No. 4, April 2000. Okhotin, Alexander, Boolean Grammars: Expressive Power and Algorithms, Doctoral thesis, School of Computing...

properties of regular expressions and context-sensitive grammars, determining the truth of quantified Boolean formulas, step-by-step changes between solutions...

connectives or Boolean operators is one that can be used to express all possible truth tables by combining members of the set into a Boolean expression....

depending on whether they are used in a 'truth-value context' (i.e. when a Boolean value was expected, for example in if (a==b & c) {...} it behaved as a...

are usually considered primitive in other notations (such as integers, Booleans, pairs, lists, and tagged unions) are mapped to higher-order functions...

Model-theoretic grammars, also known as constraint-based grammars, contrast with generative grammars in the way they define sets of sentences: they state...

is defined as a propositional formula that is true under any possible Boolean valuation of its propositional variables. A key property of tautologies...