Formal language definitions can be made practical

Part I String Processing Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 205)


Formal Definition Source Program Semantic Domain Language Feature Definition Method 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4.4. References for Chapter 4

  1. [Gordon79]
    Gordon, M.J.C., The Denotational Description of Programming Languages, Springer-Verlag, 1979.Google Scholar
  2. [Jones80]
    Jones, N.D., Semantics-directed Compiler Generation, Springer-Verlag, 1980.Google Scholar
  3. [Klint81a]
    "Formal language definitions can be made practical", in: De Bakker, J.W. & Van Vliet, J.C. (editors), Algorithmic Languages, IFIP, North-Holland, 1981, 115–132.Google Scholar
  4. [Landin64]
    Landin, P.J., "The mechanical evaluation of expressions", Computer Journal, 6 (1964), 308–320.Google Scholar
  5. [Marcotty76]
    Marcotty, M., Ledgard, H.F. & Bochmann, G.V., "A sampler of formal definitions", Computing Surveys, 8 (1976) 191–276.Google Scholar
  6. [Reynolds72]
    Reynolds, J.C., "Definitional interpreters for higher-order languages", Proceedings ACM Annual Conference, 1972, 717–740.Google Scholar
  7. [Wegner72]
    Wegner, P., "The Vienna Definition Language", Computing Surveys, 4 (1972), 5–63.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Personalised recommendations