Advertisement

Coupled context-free grammar as a programming paradigm

  • Yoshiyuki Yamashita
  • Ikuo Nakata
Grammars
Part of the Lecture Notes in Computer Science book series (LNCS, volume 348)

Abstract

The formal grammar: Coupled Context-Free Grammar (CCFG) is interpreted as a programming system, in which context-free grammars (CFGs) represent input/output data structures and a CCFG, called a CCFG program, represents the relation between the input/output data structures. The mathematical properties of logic programs and CCFG programs are dual with each other. An arbitrary logic program can be automatically transformed into the equivalent CCFG program and vice versa. Because a data structure of the CCFG program is expressed as the CFG, the execution mechanisms of CCFG programs are the extensions of the parsing techniques for the CFGs.

Keywords

Logic Program Programming Paradigm Fibonacci Sequence Formal Grammar Attribute Grammar 
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. [AhUl]
    Aho, A. V. and Ullman, J. D.: The Theory of Parsing, Translation, and Compiling, Volume I: Parsing, Prentice-Hall (1972).Google Scholar
  2. [DeMa]
    Deransart, P. and Maluszynski, J.: A Grammatical View of Logic Programming, in this volume.Google Scholar
  3. [GaGi]
    Ganzinger, H. and Giegerich, R.: Attribute Coupled Grammars, Proc. ACM SIGPLAN '84 Symposium on Compiler Construction, SIGPLAN Notices, Vol.19, No.6 (1984).Google Scholar
  4. [Gi]
    Giegerich, R.: Composition and Evaluation of Attribute Coupled Grammars, Acta Informatica, Vol.25, pp.355–423 (1988).Google Scholar
  5. [ClMe]
    Clocksin, W. F. and Mellish, C. S.: Programming in Prolog, Springer-Verlag (1981).Google Scholar
  6. [Ja]
    Jackson, M. A.: Principles of Program Design, Academic Press (1975).Google Scholar
  7. [Kn]
    Knuth, D. E.: Semantics of Context-Free Languages, Math. Syst. Th. Vol.2, NO.2 (1968), correct ibid. Vol.5, No.1 (1971).Google Scholar
  8. [Ll]
    Lloyd, J. W.: Foundation of Logic Programming, Springer-Verlag (1984).Google Scholar
  9. [NaSa]
    Nakata, I. and Sassa, M.: Regular Expressions with semantics and their Application to Data Structure Directed Programs, Computer Software, Vol.3, No.1, pp.47–56 (1986).(In Japanese)Google Scholar
  10. [NaYa]
    Nakata, I. and Yamashita, Y.: Program transformations in Coupled Context-Free Grammar, Computer Software, Vol.5, NO.2 (1988). (In Japanese)Google Scholar
  11. [Pa]
    Pagan, F. G.: Formal Specification of Programming Languages, Prentice-Hall (1981).Google Scholar
  12. [Wi]
    van Wijnggaarden, A.: Revised Report on the Algorithmic Language ALGOL 68, Springer-Verlag (1976).Google Scholar
  13. [YaNa 1]
    Yamashita, Y. and Nakata, I.: Programming in Coupled Context-Free Grammars, Technical Report ISE-TR-88-70, University of Tsukuba (1988).Google Scholar
  14. [YaNa 2]
    Yamashita, Y. and Nakata, I.: The Least Fixpoint Semantics of CCFG Programs, an internal document (1987).Google Scholar
  15. [YaNa 3]
    Yamashita, Y. and Nakata, I.: On the Relation between CCFG Programs and Logic Programs, Technical Report ISE-TR-88-71, University of Tsukuba (1988).Google Scholar
  16. [YaNa 4]
    Yamashita, Y. and Nakata, I.: The Unfold/Fold Program Transformation in CCFG Programs, Technical Report ISE-TR-88-72, University of Tsukuba (1988).Google Scholar
  17. [YaNa 5]
    Yamashita, Y. and Nakata, I.: The Execution Methods in the Programming Language Based Coupled Context-Free Grammar, Proc. 28-th Programming Simposium, Japan Information Processing Society (1987). (In Japanese).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Yoshiyuki Yamashita
    • 1
  • Ikuo Nakata
    • 1
  1. 1.Institute of Information Sciences and ElectronicsUniversity of TsukubaJapan

Personalised recommendations