Incremental algorithms in PROF-LP

  • T. Gyimóthy
  • T. Horváth
  • F. Kocsis
  • J. Toczki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 371)


PROF-LP is a programgenerator system for IBM XT/AT compatible computers. On the basis of an attribute grammar description the system generates a Pascal program which can be considered as the processor of the given specification. PROF-LP can be used for generating one-pass and multi-pass language processors. The generated one-pass processors use LL(1) method for syntactic analysis and L-attribute evaluation strategy. The multi-pass processors use LALR(1) type syntactic parser and OAG attribute evaluation strategy.

The attribute grammar definition can be created in an incremental way as well. In this paper an incremental method for generating LL(1) parsing table is presented. The main advantage of the incremental system is the very fast generation of language processors.


attribute grammars incremental parsing software generation 


  1. [1]
    Aho-Ulmann: The theory of parsing, translation and compiling, Prentice Hall, Englewood Cliffs, N. J. 1973.Google Scholar
  2. [2]
    Bochmann, G.V.: Semantic evaluation from left to right, Comm. ACM 19. 55–62 (1976).Google Scholar
  3. [3]
    Gyimothy at al.: An implementation of the HLP, Acta Cybernetica, 6. 3 (1983) 315–327.Google Scholar
  4. [4]
    Gyimothy, T. and Toczki, J.: Syntactic pattern recognition in the HLP/PAS system, Acta Cybernetica 8.1. (1987) 79–88.Google Scholar
  5. [5]
    Kastens, U.: Ordered attribute grammars, Acta Inf. 13. 229–256 (1981)Google Scholar
  6. [6]
    PROFLP User's guide — batch version, HLP-team of the Research Group on Theory of Automata, Rep., draft, Szeged 1986.Google Scholar
  7. [7]
    PROFLP User's guide — interactive version, HLP-team of the Research Group on Theory of Automata, Rep., draft, Szeged 1987.Google Scholar
  8. [8]
    Toczki et al.: Automatic compiler generation, Proc. of Symp. on Automata, Languages and Pr. Systems, Salgotarjan (1986).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • T. Gyimóthy
    • 1
  • T. Horváth
    • 1
  • F. Kocsis
    • 1
  • J. Toczki
    • 1
  1. 1.Research Group on Theory of AutomataHungarian Academy of SciencesSzegedHungary

Personalised recommendations