Advertisement

Acta Informatica

, Volume 14, Issue 2, pp 175–193 | Cite as

On parsing two-level grammars

  • Lutz Michael Wegner
Article

Summary

Making use of the fact that two-level grammars (TLGs) may be thought of as finite specification of context-free grammars (CFGs) with “infinite” sets of productions, known techniques for parsing CFGs are applied to TLGs by first specifying a canonical CFG G′ — called skeleton grammar — obtained from the “cross-reference” of the TLG G. Under very natural restrictions it can be shown that for these grammar pairs (G, G′) there exists a 1 — 1 correspondence between leftmost derivations in G and leftmost derivations in G′. With these results a straightforward parsing algorithm for restricted TLGs is given.

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.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aho A, Ullman J (1972) The theory of parsing, translation, and compiling, Vol.I: Parsing. Prentice Hall, Englewood Cliffs, NJGoogle Scholar
  2. 2.
    Aho A, Ullman J (1973) The theory of parsing, translation, and compiling, Vol.II: Compiling. Prentice Hall, Englewood Cliffs, NJGoogle Scholar
  3. 3.
    Ambler AL (1973) Nested LR(k) parsing using grammars of the van Wijngaarden type, Ph.D. Thesis, Dept. of Computer Sciences, Univ. of WisconsinGoogle Scholar
  4. 4.
    Baker JL (1972) Grammars with structured vocabulary: a model for the Algol 68 definition. Information and Control 20:351–395Google Scholar
  5. 5.
    Branquart P. Cardinal JP, Delescaille JP, Lewi J (1972) A context-free syntax of Algol 68. Information Processing Lett. 1:141–148Google Scholar
  6. 6.
    Deussen P (1975) A decidability criterion for van Wijngaarden grammars. Acta Informat. 5:353–375Google Scholar
  7. 7.
    Deussen P, Mehlhorn K (1977) Van Wijngaarden grammars and space complexity class EXSPACE. Acta Informat. 8:193–199Google Scholar
  8. 8.
    Deussen P, Wegner L (1978) A bibliography of van Wijngaarden grammars, Bulletin of the European Ass. for Theoretical Computer Science (EATCS) 6Google Scholar
  9. 9.
    Greibach SA (1974) Some restrictions on W-grammars, ACM Proceedings of the 6th Symposium on the Theory of Computing, SeattleGoogle Scholar
  10. 10.
    Gries D (1971) Compiler construction for digital computers. John Wiley, New YorkGoogle Scholar
  11. 11.
    Hesse W (1976) Vollständige formale Beschreibung von Programmiersprachen mit zweischichtigen Grammatiken, Dissertation, Technische Universität München, Bericht Nr. 7623Google Scholar
  12. 12.
    Koster CHA (1972) Affix grammars. In: Algol 68 implementation. Proc. of the IFIP Work. Conf. on Algol 68 implementation, 95–109, North Holland, AmsterdamGoogle Scholar
  13. 13.
    Makanin GS (1977) The problem of solvability of equations in a free semigroup (in Russian). Matematiceskij sbornik 103 (145), No. 2(6), pp. 147–236; english summary in: (1977) Dokl Akad Nauk SSSR, Soviet Math Dokl 18 330–334Google Scholar
  14. 14.
    Maurer H (1969) Theoretische Grundlagen der Programmiersprachen — Theorie der Syntax. Bibliographisches Institut, MannheimGoogle Scholar
  15. 15.
    Rounds WC (1973) Complexity of recognition in intermediate — level languages, in: Proc. of the IEEE 14th Annual Symposium on Switching and Automata Theory, 145–158Google Scholar
  16. 16.
    Salomaa A (1973) Formal languages. Academic Press, New York, LondonGoogle Scholar
  17. 17.
    Sintzoff M (1967) Existence of a van Wijngaarden syntax for every recursively enumerable set. Ann Soc Sci Bruxelles 81:115–118Google Scholar
  18. 18.
    Watt DA (1977) The parsing problem for affix grammars. Acta Informat 8:1–20Google Scholar
  19. 19.
    Wegner L (1977) Analysis of two-level grammars. Ph.D. thesis, Hochschul-Verlag, StuttgartGoogle Scholar
  20. 20.
    Wegner L (1979) Bracketed two-level grammars — a decidable and practical approach to language definitions. ICALP 79, Graz. Springer, Berlin Heidelberg New York (Lecture Notes in Computer Sciences, Vol. 71, p. 668)Google Scholar
  21. 21.
    Wegner L (1979) Two-level grammar translations, GI-9. Jahrestagung, Bonn. Springer, Berlin Heidelberg New York (Informatik Fachberichte, Band 19 (1965) p. 163)Google Scholar
  22. 22.
    Wijngaarden A van (1965) Orthogonal design and Description of formal languages. Mathematisch Centrum Amsterdam, MR 76Google Scholar
  23. 23.
    Wijngaarden A van (ed.) (1969) Report on the Algorithmic language ALGOL 68. Numer 14:79–218Google Scholar
  24. 24.
    Wijngaarden A van, Mailloux BJ, Peck JEL, Koster CHA, Sintzoff M, Lindsey CH, Meertens LGLT, Fisker RG (eds.) (1976) Revised report on the Algorithmic language ALGOL 68. Springer, Berlin Heidelberg New YorkGoogle Scholar

Copyright information

© Springer-Verlag 1980

Authors and Affiliations

  • Lutz Michael Wegner
    • 1
  1. 1.Institut für Angewandte Informatik und Formale Beschreibungsverfahren der Universität KarlsruheKarlsruhe 1Germany (Fed. Rep.)

Personalised recommendations