Advertisement

Transformational grammars

  • F. L. DeRemer
Chapter 2.: Analysis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 21)

Keywords

Language Description Tree Automaton Machine Code Attribute Grammar Abstract Syntax Tree 
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.V., Ullman, J.D.: The theory of parsing, translation, and compiling. Englewood Cliffs (N.J.): Prentice-Hall 1972Google Scholar
  2. [2]
    Chomsky, N.: On certain formal properties of grammars. Information and Control 2 (2), pp. 137–167, 1959Google Scholar
  3. [3]
    DeRemer, F.L.: Simple LR(k) grammars. Comm. ACM 14 (7), pp. 453–460, 1971Google Scholar
  4. [4]
    DeRemer, F.L.: Transformational grammars for languages and compilers. Technical Report No. 50, Computing Laboratory. University of Newcastle upon Tyne, England, July, 1973Google Scholar
  5. [5]
    Evans, Jr., A.: A language designed for teaching programming linguistics. Proc ACM 23rd Natl. Conf., Princeton, NJ, pp. 395–403, 1968Google Scholar
  6. [6]
    Feldman, J.A., Gries, D.: Translator writing systems. Comm. ACM 11 (2), pp. 77–113, 1968Google Scholar
  7. [7]
    Ginsburg, S., Partee, B.: A mathematical model of transformational grammars. Information and Control 15 (4), pp. 297–334, 1969Google Scholar
  8. [8]
    Hennie, F.C.: Finite-state models for logical machines. John Wiley & Sons, NY, 1968Google Scholar
  9. [9]
    Johnson, W.R., Porter J.S., Ackley S.I., Ross D.T.: Automatic generation of efficient lexical processors using finite state techniques. Comm. ACM 11, 805–813 (1968)Google Scholar
  10. [10]
    Kimball, J.: The formal theory of grammar. Prentice-Hall, Englewood Cliffs, NJ, 1973Google Scholar
  11. [11]
    Knuth, D.E.: On the translation of languages from left to right. Information and Control 8 (October), pp. 607–639, 1965Google Scholar
  12. [12]
    Knuth, D.E.: Semantics of context-free languages. Mathematical Systems Theory 2 (2), pp. 127–146, 1968Google Scholar
  13. [13]
    Knuth, D.E.: An empirical study of FORTRAN programs. Software Practice and Experience 1 (2), pp. 105–134, 1971Google Scholar
  14. [14]
    Lewis, P.M., Stearns, R.E.: Syntax-directed transduction. J. Assoc. Comp. Mach. 15, 1968Google Scholar
  15. [15]
    Peters, P.S., Ritchie, R.W.: On the generative power of transformational grammars. Info. Sci. 6, 1973Google Scholar
  16. [16]
    Rosen, B.K.: Tree-manipulation systems and Church-Rosser theorems. J. Assoc. Comp. Mach. 20 (1), pp. 160–187, 1973Google Scholar
  17. [17]
    Rounds, W.C.: Mappings and grammars on trees. Mathematical Systems Theory 4 (3), pp. 257–287, 1971Google Scholar
  18. [18]
    Wozencraft, J.M., Evans, Jr., A.: Notes on programming linguistics. Dept. of Electrical Engineering, Massachusetts Institute of Technology, Cambridge, MA 1969Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • F. L. DeRemer
    • 1
  1. 1.University of CaliforniaSanta CruzUSA

Personalised recommendations