start  find  index  login or register  edit  
CFG
by earl, 6238 days ago
ContextFree Grammar"A contextfree grammar is a formal system that describes a language by specifying how any legal text can be derived from a distinguished symbol called the axiom, or sentence symbol. It consists of a set of productions, each of which states that a given symbol can be replaced by a given sequence of symbols." A CFG consists of four entities: the axiom (sentence nonterminal or "start" nonterminal), a set of nonterminal symbols, a set of terminal symbols and a set of production rules. A context free grammar can therefore be described as the following set: G = { S, N, T, R } S ... the nonterminal symbol being the axiom N ... the set of nonterminal symbols (also called identifiers) T ... the set of terminal symbols (also called literals) R ... the set of production rules BNF/EBNF and Prolog's DCG are examples of CFG specification methods. 
search 3 active users
backlinks (more) recent stores (more) echo earlZstrainYattr ZY @.


earl.strain.at • esa3 • online for 6934 days • c'est un vanilla site 