Pattern selector grammars and several parsing algorithms in the context-free style
- 30 June 1985
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 30 (3) , 249-273
- https://doi.org/10.1016/0022-0000(85)90046-7
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Context-free like restrictions on selective rewritingTheoretical Computer Science, 1981
- Time and space complexity of inside-out macro languagesInternational Journal of Computer Mathematics, 1981
- Recognition of deterministic ETOL languages in logarithmic spaceInformation and Control, 1977
- The complexity of the membership problem for some extensions of context-free languagest†International Journal of Computer Mathematics, 1977
- The tape-complexity of context-independent developmental languagesJournal of Computer and System Sciences, 1975
- The membership question for ETOL-languages is polynomially completeInformation Processing Letters, 1975
- General context-free recognition in less than cubic timeJournal of Computer and System Sciences, 1975
- Recognition and parsing of context-free languages in time n3Information and Control, 1967