compileBNF: Compile a BNF.

In xega: Extended Evolutionary and Genetic Algorithms

Compile a BNF.

Description

compileBNF() produces a context-free grammar from its specification in Backus-Naur form (BNF). Warning: No error checking implemented.

Usage

compileBNF(g, verbose = FALSE)

Arguments

g	A character string with a BNF.
verbose	Boolean. TRUE: Show progress. Default: FALSE.

Details

A grammar consists of the symbol table ST, the production table PT, the start symbol Start, and the short production table SPT. An example BNF is provided by booleanGrammar().

The function performs the following steps:

1. Make the symbol table.

2. Make the production table.

3. Extract the start symbol.

4. Compile a short production table.

5. Return the grammar.

For a full documentation, see <https://CRAN.R-project.org/package=xegaBNF>

Value

A grammar object (list) with the attributes name (the filename of the grammar), ST (symbol table), PT (production table), Start (the start symbol of the grammar), and SPT (the short production table).

See Also

Other Grammar: booleanGrammar()

Examples

g<-compileBNF(booleanGrammar())
g$ST
g$PT
g$Start
g$SPT

xega documentation built on Feb. 17, 2026, 5:07 p.m.