A “yo-yo” parsing algorithm for a large class of van Wijngaarden grammars
Article
Received:
- 44 Downloads
- 1 Citations
Abstract
An algorithm is described for parsing a large class of van Wijngaarden grammars in polynomial time. The algorithm is based on Earley's context-free parsing algorithm, with the addition of a bottom-up component and a mechanism for implementing consistent substitution. In contrast to earlier algorithms, this algorithm works for grammars which are both non-left-bound and non-right-bound.
Keywords
Information System Operating System Data Structure Communication Network Information Theory
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Deussen, P.: A decidability criterion for van Wijngaarden grammars. Acta Inf.5, 353–375 (1975)Google Scholar
- 2.Deussen, P., Mehlhorn, K.: Van Wijngaarden grammars and space complexity class EXSPACE. Acta Inf.8, 193–199 (1977)Google Scholar
- 3.Earley, J.: An efficient context-free parsing algorithm. CACM13(2), 94–102 (February 1970)Google Scholar
- 4.Fisher, A.J.: The generation of parsers for two-level grammars. Thesis. Prifysgol Cymru, Aberystwyth, Wales (1982)Google Scholar
- 5.Fisher, A.J.: Practical LL(1)-based parsing of van Wijngaarden grammars. Acta Inf.21, 559–584 (1985)Google Scholar
- 6.Lewis, P.M. II, Rosencrantz, D.J., Stearns, R.E.: Compiler design theory. Reading, MA: Addison-Wesley 1976Google Scholar
- 7.Pagan, F.G.: Formal specification of programming languages. Englewood Cliffs, NJ: Prentice-Hall 1981Google Scholar
- 8.Salomaa, A.: Formal languages. London: Academic Press 1973Google Scholar
- 9.Simonet, M.: W. grammaires et logique du premier ordre pour la définition et l'implantation des langages. Thesis, l'Université Scientifique et Médicale de Grenoble (July 1981)Google Scholar
- 10.Sintzoff, M.: Existence of a van Wijngaarden syntax for every recursively enumerable set. Ann. Soc. Sci. Brux.81, II (1967)Google Scholar
- 11.Wegner, L.M.: On parsing two-level grammars. Acta Inf.14, 175–193 (1980)Google Scholar
- 12.Wegner, L.M.: Bracketed two-level grammars — a decidable and practical approach to language definitions. ICALP 79, Graz. (Lect. Notes Comput., Vol.71, p. 668) Berlin Heidelberg New York: Springer 1979Google Scholar
- 13.Wijngaarden, A. van, Mailloux, B.J., Peck, J.E.L., Koster, C.H.A., Sintzoff, M. (eds.) Revised report on the algorithmic language Algol 68. Berlin, Heidelberg, New York: Springer 1976Google Scholar
Copyright information
© Springer-Verlag 1992