On the index of a context-free grammar and language

作者: Arto Salomaa

DOI: 10.1016/S0019-9958(69)90164-8

关键词: Attribute grammarRegular tree grammarUnrestricted grammarProgramming languageGrammar systems theoryOperator-precedence grammarGrammarAdaptive grammarContext-free languageEmergent grammarRegular grammarMildly context-sensitive grammar formalismLink grammarComputer scienceAffix grammarExtended Affix GrammarLexical grammarHead-driven phrase structure grammarStochastic grammarAlgebraRelational grammarGenerative grammarContext-free grammarPhrase structure rules

摘要: An example is given of a context-free grammar with infinite index. This solves problem proposed by Brainerd. The notion index extended to concern languages, and an language

参考文章(4)
Arto Salomaa, Ian N. Sneddon, Theory of automata ,(1969)
Noam Chomsky, On certain formal properties of grammars Information & Computation. ,vol. 2, pp. 137- 167 ,(1959) , 10.1016/S0019-9958(59)90362-6
Barron Brainerd, An analog of a theorem about context-free languages Information & Computation. ,vol. 11, pp. 561- 567 ,(1967) , 10.1016/S0019-9958(67)90771-1