An implementation of affix grammars

  • Hans Meijer
Attribute And Affix Grammars
Part of the Lecture Notes in Computer Science book series (LNCS, volume 94)


Intermediate results and current problems in an ongoing implemention of minimally restricted, possibly ambiguous Affix Grammars are described. Affix Grammars are informally introduced. A Recursive Backup Parsing Algorithm, suitable for any context-free grammar which is not left-recursive is presented, together with a heuristic scheme which is particularly effective at the lexical level. The main intermediate result is a transcription for affixes which allows affixes to be referenced before they are defined. The implementation of context sensitivity, which is the main current problem, is discussed. Other remaining problems are listed.

This publication contains material which may be used in the author's forthcoming doctoral dissertation.


Input String Context Sensitivity Lexical Level Attribute Grammar Applied Position 
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.


  1. [CDL]
    Koster, C.H.A. Using the CDL Compiler Compiler. In: Compiler Construction, An Advanced Course (F.L. Bauer, J. Eickel, eds.), Lecture Notes in Computer Science, 21, Springer Verlag, Berlin-Heidelberg-New York, 1974.Google Scholar
  2. [EAGLE]
    Franzen, H., Hoffman, B., Petersen, I.R. Ein Parser-Generator fuer Erweiterte Affix-Grammatiken. Diplomarbeit, Technische Universitaet Berlin, Fachbereich Informatik, Bericht Nr. 76-24, Oktober 1976.Google Scholar
  3. [FRANZEN]
    Franzen, H. and Hoffmann, B. Automatic Determination of Data Flow in Extended Affix Grammars. Technische Universitaet Berlin, Fachbereich Informatik, Bericht Nr. 79-20, September 1979.Google Scholar
    Hoporoft, J.E., Ullman, J.D. Formal Languages and Their Relation to Automata. Addison-Wesley, 1969.Google Scholar
  5. [KNUTH]
    Knuth, D.E. Semantics of Context-Free Languages. Mathematical Systems Theory 2, 127–145 (1968).CrossRefGoogle Scholar
  6. [KOSTER 1971]
    Koster, C.H.A. Affix Grammars. In: ALGOL 68 Implementation (J.E. Peck, ed.), North-Holland Publishing Company, Amsterdam, 1971.Google Scholar
  7. [KOSTER 1974]
    Koster, C.H.A. A Technique for Parsing Ambiguous Grammars. In: Lecture Notes in Computer Science, 26, Springer Verlag, Berlin-Heidelberg-New York, 1974.Google Scholar
    Kuehling, P. Affix-Grammatiken zur Beschreibung von Programmiersprachen. Dissertation, Technische Universitaet Berlin, Fachbereich Informatik, Februar 1978.Google Scholar
  9. [WATT]
    Watt, D.A. Analysis-oriented Two-level Grammars. Ph.D. thesis, University of Glasgow, January 1974.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Hans Meijer
    • 1
  1. 1.Informatics DepartmentNijmegen UniversityThe Netherlands

Personalised recommendations