Bounded nesting in macro grammars
- 1 August 1979
- journal article
- Published by Elsevier in Information and Control
- Vol. 42 (2) , 157-193
- https://doi.org/10.1016/s0019-9958(79)90635-1
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Surface tree languages and parallel derivation treesTheoretical Computer Science, 1976
- One counter languages and the IRS conditionJournal of Computer and System Sciences, 1975
- A few remarks on the index of context-free grammars and languagesInformation and Control, 1971
- Tree acceptors and some of their applicationsJournal of Computer and System Sciences, 1970
- Nested Stack AutomataJournal of the ACM, 1969
- Derivation-bounded languagesJournal of Computer and System Sciences, 1968
- Grammars with macro-like productionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1968
- An analog of a theorem about context-free languagesInformation and Control, 1967
- Bracketed context-free languagesJournal of Computer and System Sciences, 1967
- Finite-Turn Pushdown AutomataSIAM Journal on Control, 1966