next up previous
Next: BNF (Backus-Naur Form) Up: No Title Previous: Language and Grammars (2)

Context-free Grammars

A context-free grammar is formally defined by

A grammar defines as its language the set of those sequences of terminal symbols which can be derived from the start symbol by successive application of productions.

Q: What are all the terminals, non-terminals, rules, start-symbols of the number example?

Christoph Zenger