In abstract mathematical terms, a language is a set of alphanumeric strings of finite length over some fixed, finite alphabet. A grammar is a set of production rules that specify how valid strings in the language may be got--every formal language has a...

n. (CF-rule) (more fully, context-free phrase structure rule, or CF-PS-rule) 1. A rewrite rule which expands exactly one category into an ordered string of zero or more categories and for the application of which no environment is specified. Examples...

// n. (CFG) (more fully, context-free phrase structure grammar, or CF-PSG) (also type 2 grammar) A formal grammar in which all of the rules which directly license local subtrees are context-free rules. Among current theories of grammar, GPSG represents...

A phrase structure rule which is formulated without any regard for context. ( also generative grammar, phrase structure rule, transformational...

In formal language theory, a context-free grammar (CFG) is a grammar in which every production rule is of the...

This is the first general biographical study of Janac ek to appear in English since Ian Horsbrugh's Leos Janac ek: the field that prospered, published over twenty years ago (and, incidentally, a book which doesn't make it into Zemanova's bibliography). Since then, Janac ek...

In the African language Bambara, the phrase wuluniyninanyinina o wulunyininanyinina means "whoever searches for dog serchers." Although this expression doesn't slip smoothly into typical cocktail party chatter, the recent recognition of this type of grammatical construction settles a longstanding linguistic dispute. At issue...