作者: Arto Salomaa
DOI: 10.1016/S0019-9958(69)90164-8
关键词: Attribute grammar 、 Regular tree grammar 、 Unrestricted grammar 、 Programming language 、 Grammar systems theory 、 Operator-precedence grammar 、 Grammar 、 Adaptive grammar 、 Context-free language 、 Emergent grammar 、 Regular grammar 、 Mildly context-sensitive grammar formalism 、 Link grammar 、 Computer science 、 Affix grammar 、 Extended Affix Grammar 、 Lexical grammar 、 Head-driven phrase structure grammar 、 Stochastic grammar 、 Algebra 、 Relational grammar 、 Generative grammar 、 Context-free grammar 、 Phrase 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