Affix grammar

From Wikipedia, the free encyclopedia

An affix grammar is a particular kind of formal grammar used in computer science to describe computer languages. Affix grammars are context-free, meaning that the left hand side of the language productions consist of a single symbol. Most commonly used programming languages (Java, C, etc.) can be described as a series of such productions. Most often, these are expressed using Backus–Naur form, which can be used to express an affix grammar.

CDL is a language that very directly implements affix grammars. Productions are expanded until a terminal symbol is reached. At that point, the terminal symbol is emitted.