
Accession Number : AD0697148
Title : STRING ADJUNCT GRAMMARS.
Descriptive Note : Technical rept.,
Corporate Author : PENNSYLVANIA UNIV PHILADELPHIA MOORE SCHOOL OF ELECTRICAL ENGINEERING
Personal Author(s) : Joshi,A. K. ; Kosaraju,S. R. ; Yamada,H.
Report Date : FEB 1969
Pagination or Media Count : 146
Abstract : A new style of formal grammars called String Adjunct Grammars(AG) is introduced. Briefly an AG consists of a finite alphabet, a finite set of strings on this alphabet and a finite set of adjunction rules which state how certain adjunct strings are adjoined to certain host strings. The corresponding language called a String Adjunct Language (AL) is then defined as the set of all strings derived from a certain specified subset of the given set of finite strings. The rules in an AG have a considerably different formal character as compared to the rewrite rule in a general phrase structure grammar(PSG). The language hierarchies of AG's and PSG's cut across in many interesting ways. (Author)
Descriptors : (*GRAMMARS, ANALYSIS), SET THEORY, PHRASE STRUCTURE GRAMMARS, LANGUAGE
Subject Categories : Linguistics
Distribution Statement : APPROVED FOR PUBLIC RELEASE