Two-level grammar

From Free net encyclopedia

A two-level grammar is essentially a grammar that is used to construct another grammar. A context free meta-grammar that defines the rules for a second grammar yields an effectively infinite set of rules for the derived grammar. Two-level grammars are more powerful than normal context free grammars; they have actually been shown to be Turing complete.

Template:Ling-stub