• Boolean grammars, introduced by Okhotin [Wikidata], are a class of formal grammars studied in formal language theory. They extend the basic type of grammars...
    4 KB (514 words) - 13:31, 10 March 2025
  • grammars, deterministic Boolean grammars. This table compares parser generator languages with a general context-free grammar, a conjunctive grammar,...
    50 KB (1,133 words) - 03:56, 22 May 2025
  • Thumbnail for Context-free 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...
    46 KB (6,141 words) - 08:53, 8 July 2025
  • 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...
    75 KB (9,572 words) - 17:48, 4 July 2025
  • 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...
    24 KB (2,900 words) - 02:49, 26 May 2025
  • grammars. Conjunction can be used, in particular, to specify intersection of languages. A further extension of conjunctive grammars known as Boolean grammars...
    9 KB (1,396 words) - 11:32, 13 April 2025
  • Thumbnail for Boolean function
    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...
    23 KB (2,887 words) - 21:32, 19 June 2025
  • syntax utilizing the LPeg library. Boolean context-free grammar Compiler Description Language (CDL) Formal grammar Regular expression Top-down parsing...
    47 KB (6,505 words) - 20:06, 19 June 2025
  • Thumbnail for Formal grammar
    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...
    24 KB (3,450 words) - 20:46, 12 May 2025
  • The Scannerless Boolean Parser is an open-source scannerless GLR parser generator for boolean grammars. It was implemented in the Java programming language...
    1 KB (51 words) - 11:26, 17 March 2022
  • expressions that a binary expression tree can represent are algebraic and boolean. These trees can represent expressions that contain both unary and binary...
    4 KB (367 words) - 17:17, 24 February 2024
  • 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...
    4 KB (504 words) - 08:29, 8 May 2025
  • 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...
    9 KB (1,127 words) - 17:09, 13 January 2024
  • form (Boolean algebra) Boolean conjunctive query Boolean-valued model Boolean domain Boolean expression Boolean ring Boolean function Boolean-valued...
    25 KB (2,115 words) - 23:00, 25 June 2025
  • Lee, Lillian (January 2002). "Fast Context-Free Grammar Parsing Requires Fast Boolean Matrix Multiplication" (PDF). J ACM. 49 (1): 1–15. arXiv:cs/0112018...
    15 KB (2,152 words) - 18:30, 9 December 2024
  • site Alexander Okhotin's Conjunctive Grammars Page Alexander Okhotin's Boolean Grammars Page The Packrat Parsing and Parsing Expression Grammars Page...
    15 KB (1,813 words) - 15:28, 16 December 2024
  • 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...
    27 KB (2,979 words) - 05:54, 21 June 2025
  • approach to graph rewriting, based mainly on Boolean algebra and an algebra of matrices, called matrix graph grammars. Yet another approach to graph rewriting...
    15 KB (1,815 words) - 20:31, 4 May 2025
  • F. (1991). Logic, Language and Meaning: Intensional Logic and Logical Grammar. University of Chicago Press. p. 122. ISBN 0-226-28088-8. King, Jeffrey...
    22 KB (2,558 words) - 19:40, 8 July 2025
  • Thumbnail for Logical disjunction
    will come.' Affirming a disjunct Boolean algebra (logic) Boolean algebra topics Boolean domain Boolean function Boolean-valued function Conjunction/disjunction...
    16 KB (1,937 words) - 20:20, 25 April 2025
  • 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...
    15 KB (1,865 words) - 16:28, 28 May 2024
  • 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...
    17 KB (2,189 words) - 06:15, 3 August 2024
  • Thumbnail for Logical conjunction
    elimination Conjunction (grammar) De Morgan's laws First-order logic Fréchet inequalities Homogeneity (linguistics) List of Boolean algebra topics Logical...
    18 KB (1,465 words) - 05:16, 22 February 2025
  • properties of regular expressions and context-sensitive grammars, determining the truth of quantified Boolean formulas, step-by-step changes between solutions...
    13 KB (1,564 words) - 01:41, 8 November 2024
  • Parsing," Perfection, Vol. 1 No. 4, April 2000. Okhotin, Alexander, Boolean Grammars: Expressive Power and Algorithms, Doctoral thesis, School of Computing...
    18 KB (1,920 words) - 08:31, 27 May 2025
  • 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....
    16 KB (1,957 words) - 15:12, 13 January 2025
  • 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...
    43 KB (1,963 words) - 02:44, 23 April 2025
  • is defined as a propositional formula that is true under any possible Boolean valuation of its propositional variables. A key property of tautologies...
    23 KB (3,114 words) - 23:43, 3 July 2025
  • penguin}. Abstract algebraic logic Ampheck Boolean algebra (logic) Boolean domain Boolean function Boolean logic Causality Deductive reasoning Logic gate...
    17 KB (1,910 words) - 22:09, 28 January 2025
  • are usually considered primitive in other notations (such as integers, Booleans, pairs, lists, and tagged unions) are mapped to higher-order functions...
    48 KB (8,556 words) - 17:17, 6 June 2025