Advertisement

Welcher Art Ergebnisse erwartet der Compilerbau von der Theoretischen Informatik?

  • Hans Langmaack
Freitagvormittag Hauptvortrag
Part of the Lecture Notes in Computer Science book series (LNCS, volume 33)

Keywords

Compiler Construction Data Structure Model Calculus Schema Block Structure Process 
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.

Literatur

  1. /1/.
    F.L. Bauer, J. Eickel (Ed.): Compiler Construction, an advanced Course. Lecture Notes in Computer Science 21, Springer, Berlin-Heidelberg-New York 1974zbMATHGoogle Scholar
  2. /2/.
    P.Naur (Ed.): Report on the algorithmic Language ALGOL 60. Num. Math. 2, 106–136 (1960)Google Scholar
  3. /3/.
    E.T. Irons: A syntax-directed Compiler for ALGOL 60. Comm.ACM 4, 51–55 (1961)CrossRefGoogle Scholar
  4. /4/.
    M. Paul: ALGOL 60 Processors and a Processor Generator. Information Processing 1962, 439–447, North Holland, Amsterdam 1963Google Scholar
  5. /5/.
    R.W. Floyd: Syntactic Analysis and Operator Precedence. J. ACM 10, 316–333 (1963)CrossRefGoogle Scholar
  6. /6/.
    J. Eickel: Generation of Parsing Algorithms for Chomsky 2-Type Languages. Math. Inst. Techn. Univ. München, Bericht 6401, 1964Google Scholar
  7. /7/.
    R.W. Floyd: Bounded Context syntactic Analysis. Comm. ACM 7, 62–67 (1964)CrossRefGoogle Scholar
  8. /8/.
    D.E. Knuth: On the Translation of Languages from left to right. Inform. and Control 8, 607–639 (1965)MathSciNetCrossRefGoogle Scholar
  9. /9/.
    N. Wirth, H. Weber: EULER — a Generalisation of ALGOL and its formal definition, Parts 1 and 2. Comm. ACM 9, 13–23, 89–99 (1966)CrossRefGoogle Scholar
  10. /10/.
    J.M. Foster: A Syntax improving Device. Computer J. 11, 31–34 (1968)CrossRefGoogle Scholar
  11. /11/.
    P.M. Lewis, R.E. Stearns: Syntax directed Transduction. J. ACM 15, 464–488 (1968)CrossRefGoogle Scholar
  12. /12/.
    A.V. Aho, J.D. Ullman: The Theory of Parsing, Translation, and Compiling. Vol. I and II, Prentice Hall, Englewood Cliffs 1972 and 1973Google Scholar
  13. /13/.
    F.L. De Remer: Simple LR(k) Grammars. Comm. ACM 14, 453–460 (1971)MathSciNetCrossRefGoogle Scholar
  14. /14/.
    W.R. La Londe, E.S. Lee, J.J. Horning: An LALR(k) Parser Generator. Proc. IFIP Congress 71, TA-3, North Holland, Amsterdam 1971Google Scholar
  15. /15/.
    A. van Wijngaarden (Ed.): Report on the algorithmic Language ALGOL 68. Num. Math. 14, 79–218 (1969)Google Scholar
  16. /16/.
    C.H.A. Koster: Affix Grammars. In: J.E.L. Peck (Ed.): ALGOL 68 Implementation. North Holland, Amsterdam 95–109 (1971)Google Scholar
  17. /17/.
    C.H.A. Koster: Using the CDL Compiler-Compiler. In /1/, 366–426 (1974)CrossRefGoogle Scholar
  18. /18/.
    H.J. Bowlden: Cascaded SLR(k) Parser in ALGOL 68. In: Zweite GI-Fachtagung über Programmiersprachen, Saarbrücken 1972. GMD, St. Augustin, 189–200 (1972)Google Scholar
  19. /19/.
    D.A.Watt: Analysis-oriented two-level Grammars. Ph.D. Thesis, Glasgow 1974Google Scholar
  20. /20/.
    T.R.Wilcox: Generating Machine Code for high-level Programming Languages. Ph.D. Thesis, Cornell Univ. 1971Google Scholar
  21. /21/.
    A.Church: The Calculi of Lambda-Conversion. Princeton Univ. Press 1941Google Scholar
  22. /22/.
    H. Langmaack: On correct Procedure Parameter Transmission in higher Programming Languages. Acta Informatica 2, 311–333 (1973)MathSciNetCrossRefGoogle Scholar
  23. /23/.
    M.S. Paterson: Decision Problems in computational Models. SIGPLAN Notices 7, 1, 74–82 (1972)CrossRefGoogle Scholar
  24. /24/.
    C. Strachey: A general Purpose Macrogenerator. Comp. Journal 8, 225–241 (1965/66)CrossRefGoogle Scholar
  25. /25/.
    H. Langmaack: On Procedures as open Subroutines I, II. Acta Informatica 2, 311–333 (1973), 3, 227–241 (1974)MathSciNetCrossRefGoogle Scholar
  26. /26/.
    W.M. Waite: The mobile Programming System: STAGE 2. Comm. ACM 13, 415–421 (1970)CrossRefGoogle Scholar
  27. /27/.
    G. Seegmüller: Einführung in die Systemprogrammierung. Bibl. Inst. Zürich 1974Google Scholar
  28. /28/.
    E.W. Dijkstra: Recursive Programming. Num. Math. 2, 312–318 (1960)MathSciNetCrossRefGoogle Scholar
  29. /29/.
    C.L. McGowan: The "most recent" Error: its Causes and it Correction. SIGPLAN Notices 7, 1, 191–202 (1972)CrossRefGoogle Scholar
  30. /30/.
    P. Kanzia: On the "most recent" property of ALGOL-like programms. In: J. Loeckx (Ed.): Automata, Languages and Programming. 2nd Coll. Univ. Saarbrücken 1974, Lecture Notes in Comp. Science 14, Springer, Berlin-Heidelberg-New York 97–111 (1974)Google Scholar
  31. /31/.
    W. Lippe: Entscheidbarkeitsprobleme bei der Übersetzung von Programmen mit einparametrigen Prozeduren. In: W. Frielinghaus, B. Schlender (Ed.): Dritte GI-Fachtagung über Programmiersprachen, Kiel 1974, Lecture Notes in Comp. Science 7, Springer, Berlin-Heidelberg-New York 11–24 (1974)Google Scholar
  32. /32/.
    J.R. Büchi: Regular canonical Systems. Arch. Math. Logik u. Grundlagenforsch. 6, 91–111 (1964)MathSciNetCrossRefGoogle Scholar
  33. /33/.
    S. Ginsburg, S.A. Greibach, M.A. Harrison: Stack-Autoamta and Compiling. J. ACM 14, 172–201 (1967)CrossRefGoogle Scholar
  34. /34/.
    W.C. Rounds: Mappings and Grammars on Trees. Math. Systems Theory 4, 257–287 (1970)MathSciNetCrossRefGoogle Scholar
  35. /35/.
    P. Wegner: Data Structure Models for Programming Languages. SIGPLAN Notices 6, 2, 1–54 (1971)CrossRefGoogle Scholar
  36. /36/.
    J.B. Johnston: The Contour Model of Block structured Processes. SIGPLAN Notices 6, 2, 55–82 (1971)CrossRefGoogle Scholar
  37. /37/.
    J. McCarthy et al.: LISP 1.5 Programmer's Manual. The M.I.T. Press, Cambridge, Mass. (1962)CrossRefGoogle Scholar
  38. /38/.
    J.C. Reynolds: GEDANKEN, a simple typeless Language based on the Principle of Completeness and the Reference Concept. Comm. ACM 13, 5, 308–319 (1970)CrossRefGoogle Scholar
  39. /39/.
    D.M. Berry: Introduction to OREGANO. SIGPLAN Notices 6, 2, 171–190 (1971)CrossRefGoogle Scholar
  40. /40/.
    M.J. Fischer: Lambda Calculus Schemata. SIGPLAN Notices 7, 1, 104–109 (1972)MathSciNetCrossRefGoogle Scholar
  41. /41/.
    D.E. Knuth, R.W. Floyd: Notes on Avoiding "goto" Statements. Inform. Proc. Letters 1, 23–31 (1971)CrossRefGoogle Scholar
  42. /42/.
    E. Ashcroft, Z. Manna: Inform. Proc. 71, North-Holland, Amsterdam 250–255 (1972)Google Scholar
  43. /43/.
    N. Wirth: The Programming Language PASCAL. Acta Informatica 1, 35–63 (1971)CrossRefGoogle Scholar
  44. /44/.
    U.Ammann: Die Entwicklung eines PASCAL-Compilers nach der Methode des strukturierten Programmierens. Diss. ETH 5456, Zürich (1975)Google Scholar
  45. /45/.
    W.M. McKeeman: Compiler Construction. In /1/, 1–36 (1974)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Hans Langmaack
    • 1
  1. 1.Institut für Informatik und Praktische Mathematik der Universität Kiel23 Kiel 1Germany

Personalised recommendations