Accession Number : AD0661970

Title :   CONTROL SETS ON GRAMMARS.

Descriptive Note : Scientific rept. no. 9,

Corporate Author : SYSTEM DEVELOPMENT CORP SANTA MONICA CALIF

Personal Author(s) : Ginsburg,Seymour ; Spanier,Edwin H.

Report Date : 07 AUG 1967

Pagination or Media Count : 40

Abstract : Given a set C of strings of rewriting rules of a phrase structure grammar G, we consider the set LC(G) of those words generated by leftmost derivations in G whose corresponding string of rewriting rules is an element of C. The paper concerns the nature of the set LC(G) when C and G are assumed to have special form. For example, for G an arbitrary phase structure grammar, LC(G) is an abstract family of languages if C is an abstract family of languages, and LC(G) is bounded if C is bounded. (Author)

Descriptors :   (*LANGUAGE, THEORY), (*PHRASE STRUCTURE GRAMMARS, ANALYSIS), LINGUISTICS, CONTEXT FREE GRAMMARS, COMPUTATIONAL LINGUISTICS, CONTEXT SENSITIVE GRAMMARS, AUTOMATA, GRAMMARS

Subject Categories : Linguistics

Distribution Statement : APPROVED FOR PUBLIC RELEASE