CONTROL SETS ON GRAMMARS.
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)
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 07, 1967
- Accession Number
- AD0661970
Entities
People
- Edwin H. Spanier
- Seymour Ginsburg
Organizations
- System Development Corporation