Accession Number : AD0645451

Title :   THE QUEENS GRAMMAR,

Corporate Author : RAND CORP SANTA MONICA CALIF

Personal Author(s) : Lieman,Stephen L.

Report Date : JAN 1967

Pagination or Media Count : 47

Abstract : The famous eight-queens problem is presented and then generalized into a language over strings of integers. Various formalisms are shown to be able to describe this language, including arithmetical relations defined on each pair of integers in the string, programs for actually generating and parsing strings in the language, and a 'relational grammar'. It is shown that context-sensitive grammar and transformational grammar are likely to be capable of defining the language. The simplicity and elegance of the arithmetical formulation and the computer programs that are easily derived from it are contrasted to the counterintuitive properties of relational grammars, context-sensitive grammars and transformational grammars that define the same language. A natural language counterpart to the Queens Language is given, and new measures of linguistic adequacy are defined. The implications of these new measures of adequacy to efforts for finding appropriate linguistic formalisms is discussed. (Author)

Descriptors :   (*GRAMMARS, COMPUTER PROGRAMS), LANGUAGE, LINGUISTICS, CONTEXT SENSITIVE GRAMMARS, TRANSFORMATIONAL GRAMMARS, PROGRAMMING LANGUAGES

Subject Categories : Linguistics
      Computer Programming and Software

Distribution Statement : APPROVED FOR PUBLIC RELEASE