booleanGrammar {xegaDerivationTrees}

A constant function which returns the BNF (Backus-Naur Form) of a context-free grammar for the XOR problem.

Description

A constant function which returns the BNF (Backus-Naur Form) of a context-free grammar for the XOR problem.

Usage

booleanGrammar()

Details

Imported from package xegaBNF for use in examples.

Value

A named list with elements $filename and $BNF representing the grammar of a boolean grammar with two variables and the boolean functions AND, OR, and NOT.

See Also

Other Grammar: compileBNF()

Examples

booleanGrammar()