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) - 23:03, 13 January 2024
Comparison of parser generators (redirect from List of parser generators for context-sensitive grammars)
grammars, deterministic boolean grammars. This table compares parser generator languages with a general context-free grammar, a conjunctive grammar,...
49 KB (1,115 words) - 20:27, 17 October 2024
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...
74 KB (9,506 words) - 18:23, 19 October 2024
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) - 19:44, 25 October 2024
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) - 15:27, 16 February 2024
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,200 words) - 04:04, 26 October 2024
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
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
A formal grammar describes which strings from an alphabet of a formal language are valid according to the language's syntax. A grammar does not describe...
23 KB (3,439 words) - 18:37, 29 October 2024
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,914 words) - 08:59, 7 October 2024
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) - 08:51, 7 October 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,811 words) - 08:58, 7 October 2024
And (section Logic, grammar and computing)
logic, notated as "∧", "⋅", "&", or simple juxtaposition Bitwise AND, a Boolean operation in programming, typically notated as "and" or "&" Short-circuit...
2 KB (267 words) - 23:29, 2 November 2024
Backus–Naur form (redirect from BNF grammar)
Peter Naur. BNF can be described as a metasyntax notation for context-free grammars. Backus–Naur form is applied wherever exact descriptions of languages are...
31 KB (3,646 words) - 11:05, 29 September 2024
Functional completeness (redirect from Complete set of Boolean operators)
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,951 words) - 10:25, 19 September 2024
Context-free language (section Context-free grammar)
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,134 words) - 16:57, 23 September 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:14, 26 August 2023
form (Boolean algebra) Boolean conjunctive query Boolean-valued model Boolean domain Boolean expression Boolean ring Boolean function Boolean-valued...
25 KB (2,096 words) - 12:43, 3 November 2024
Bonnot Gang Book of Causes Book of Changes Book of Life Boolean algebra (logic) Boolean grammar Bootstrapping Borden Parker Bowne Boredom Boris Chicherin...
72 KB (6,948 words) - 17:10, 28 October 2024
Church encoding (redirect from Church boolean)
are usually considered primitive in other notations (such as integers, Booleans, pairs, lists, and tagged unions) are mapped to higher-order functions...
40 KB (6,538 words) - 20:45, 9 October 2024
Algebra of sets (redirect from Set operations (Boolean))
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
Parsing," Perfection, Vol. 1 No. 4, April 2000. Okhotin, Alexander, Boolean Grammars: Expressive Power and Algorithms, Doctoral thesis, School of Computing...
18 KB (1,921 words) - 16:01, 18 September 2022
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
function Finitary relation, or n-ary predicate Boolean-valued function Syntactic predicate, in formal grammars and parsers Functional predicate Predication...
852 bytes (129 words) - 23:18, 23 November 2022
Binary expression tree (section Boolean expressions)
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
Logical disjunction (redirect from Boolean OR)
will come.' Affirming a disjunct Boolean algebra (logic) Boolean algebra topics Boolean domain Boolean function Boolean-valued function Conjunction/disjunction...
16 KB (1,941 words) - 04:06, 2 November 2024
elimination Conjunction (grammar) De Morgan's laws First-order logic Fréchet inequalities Homogeneity (linguistics) List of Boolean algebra topics Logical...
18 KB (1,455 words) - 00:43, 30 September 2024
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) - 19:46, 25 August 2024
Conjunction/disjunction duality (redirect from Duality principle (Boolean algebra))
In propositional logic and Boolean algebra, there is a duality between conjunction and disjunction, also called the duality principle. It is the most...
9 KB (1,210 words) - 19:57, 25 October 2024
type, with a grammar rule, like "a string of digits" for an integer literal. Some literals are specific keywords, like true for the Boolean literal "true"...
4 KB (388 words) - 02:58, 24 July 2024