Next: BNF (Backus-Naur Form)
Up: No Title
Previous: Language and Grammars (2)
A context-free grammar is formally defined by
- A set of terminal symbols ("0", "7", "Chelsea")
- A set of non-terminal symbols (Subject)
- A set of syntactic rules (or: productions )
(Subject="Chelsea"|"Peter".)
- A start symbol (Sentence)
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
3/16/2000