Single Tree Grammars

A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various properties of this class of grammars are studied. Although most properties of STG's are undecidable, every linear STG generates a bounded language and a deterministic context-free language, so most properties of linear STG's are decidable. Finally, we show that STG grammars have natural applications for logic database query languages. Keywords. Formal languages, context-free grammars, closure properties, decidability, logic databases. 1 Research of Weiping Shi was supported in part by the Semiconductor Research Corporation under contract 88-DP-109 and in part by the National Science Foundation under grant CCR-8710730. Research of Shai Simonson was supported by the National Science Foundation under grant CCR-8710730. 2 Department of Computer Science, University of California at Los Angeles, Los Angeles, C...

• Type: Conference
• Year: 1992
• Where: BIRTHDAY
• Authors: Sheila A. Greibach, Weiping Shi, Shai Simonson
• Keywords: Applied Computing, BIRTHDAY 1992, Context-free Grammars, Linear Stg, National Science Foundation