Abstract
Based on the LL(k) — property of contextfree grammars a family of grammars, called PLL(k) — grammars, is introduced. Derivations in a PLL(k) — grammar are governed by a new type of control mechanism. Each contextfree LL(k) — grammar is a PLL(k) — grammar. Important non — contextfree languages, e. g. declarative programming languages, can be described by PLL(k) — grammars. An algorithm for the syntactical check of PLL(k) — languages is developed and shown that its implementation on a Turing — machine takes O(n2) time in the worst case. Using RAM — models an improvement can be achieved with 0(n) expected time complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho, J. E. Hopcroft, J. D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974
A. V. Aho, J. D. Ullman: The Theory of Parsing, Translation and Compiling, Vol. 1. Prentice-Hall, 1972
G. Barth: Protokollgrammatiken — Ein Konzept zur zeitvarianten Kontrolle bei kontextfreien Ersetzungen. Dissertation Universität Kaiserslautern, 1977
S. Ginsburg, E. H. Spanier: Control Sets on Grammars. Math. Systems Theory 2 (1968), 159–177
J. E. Hopcroft, J. D. Ullman: Formal Languages and Their Relation to Automata. Addison-Wesley, 1969
K. Jensen, N. Wirth: PASCAL-User Manual And Report. Springer Study Edition, 1975
T. Kasai: A Hierarchy Between Context-Free and Context-Sensitive Languages. JCSS 4 (1970), 492
D. E. Knuth: The Art of Computer Programming, Vol. 3. Addison-Wesley, 1975 2nd edition
H. Maurer: Datenstrukturen und Programmierverfahren. Teubner, 1974
J. H. Morris, V. R. Pratt: A Linear Pattern Matching Algorithm. Technical Report No. 40, Computing Center, University of California, Berkeley, 1970
A. Salomaa: Formal Languages. Academic Press, 1973
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Barth, G. (1977). Efficient non — Contextfree Parsing. In: Schneider, H.J. (eds) GI — 7. Jahrestagung. Informatik — Fachberichte, vol 10. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-48908-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-48908-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08425-9
Online ISBN: 978-3-642-48908-2
eBook Packages: Springer Book Archive