Abstract
An extension of PROLOG which supports software specification by means of a class of two-level grammars is presented. AFFLOG logic programs are typed and modes can be specified if desired. By examining their underlying grammatical properties, a static analysis is performed. Our purpose is to support translator writing starting from a grammatical model that has been checked and debugged.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
ABRAMSON (H.). Definite Clause Grammars and the Logical Specification of Data Types as Unambiguous CF-Grammars. Proc. of Int. Conf. of FGCS, Tokyo (J), 1984, p. 678–685.
BENEY (J.), BOULICAUT (J.F.). STARLET: an affix-based compiler compiler designed as a Logic Programming System. In: Proceedings of the Third International Workshop on Compiler Compilers CC'90, October 22–24, 1990, Schwerin (G), D. HAMMER Ed., Springer-Verlag, LNCS 477, p. 71–85.
BORLAND Int. Turbo Prolog Owner's Handbook, Scott Valley (USA), 1986.
BOULICAUT (J.F.). Towards a Wide Spectrum Grammatical Programming Framework. Ph-D Thesis: INSA Lyon, february 1992, 320 p. (in Frencl)
COLMERAUER (A.). Metamorphosis Grammars. Research Report GIA (Aix-Marseille II, Luminy), november 1975.
DAHL(V.), ABRAMSON(H.). On Gapping Grammars, in: Proceedings of the 2nd. ICLP, Uppsala (S), 1984.
DERANSART (P.), MALUSZYNSKI (J.). A Grammatical View of Logic Programming, in: Proceedings of the 1st Int. Workshop Plilp 88, Orléans, mai 1988, (P. DERANSART, B. LOHRO, J. MALUSZYNSKI Eds), Springer-Verlag, LNCS 348, p. 219–251.
GOGUEN J.A. & al. Initial Algebra Semantics and Continuous Algebras. JACM Vol. 24, nℴ1, January 1977, pp. 68–95.
HEHNER E.C.R., SILVERBERG B.A.. Programming with Grammars: An Exercise in Methodology-Directed Language Design. The Computer Journal, Vol. 26, 1983, p. 277–281.
ISAKOWITZ T.. Can we transforme logic programms into attribute grammars? RAIRO Informatique Théorique et Applications. Vol. 25, nℴ 6, 1991, p. 499–543.
KOWALSKI (R.). Logic for Problem Soving. North-Holland, 1979.
MALUSZYNSKI (J.), NILSSON(J.F). A comparison of the logic programming language Prolog with two-level grammars, in: Proceedings of the 1st ICLP, Marseille (F), 1982, M. van CANEGHEM Ed., p. 193–199.
MALUSZYNSKI J., NILSSON J.F.. Grammatical Unification. Information Processing Letters, Vol. 15, nℴ4, 1982, p. 150–158.
MALUSZYNSKI (J.), NILSSON(J.F). A version of Prolog based on the notion of two-level grammars. Working paper at the “Prolog programming environments workshop”, Linköping Institute of Technology (S), march 1982, 15 p.
MALUSZYNSKI J.. Towards a programming language based on the notion of two-level grammars. TCS, Vol. 28, 1984, p. 13–43.
NASLUND (T.). An experimental implementation of a compiler for two-level grammars. in: Proceedings of the 2nd int. symp. on methodologies for intelligent systems, (Z.W.RAS & M. ZEMANKOVA Eds.), pp.424–431.
NILSSON (U.). AID: an Alternative Implementation of Definite Clause Grammars. New Generation Computing, 1986, p. 385–398.
PEREIRA F.C.N., WARREN D.H.D.. Definite Clause Grammars for Language Analysis: a survey of the formalism and a comparison with ATN. Artificial Intelligence, Vol 13, 1980, p. 231–278.
PLOTKING. A Note on Inductive Generalization. Machine intelligence 5, 1969, p. 153–163.
SAIDI (S.). Associative Unification in the AFFLOG Grammatical Logic Programming System. in: Proceedings of JFPL'92, 25–27 may 1992, Lille (F), (J.P Delahaye Ed.), p.107–126 (in french)
SAIDI (S.). Grammatical Extensions to Logic Programming. Ph-D Thesis: Ecole Centrale de Lyon, may 1992, 172 p. (in french).
TORII (K.), MORISAWA (Y.), SUGIYAMA (Y.), KASAMI (T.). Functional programming and logical programming for the telegram analysis problem. in: Proceedings of 1st IEEE Int. Symp. on Logic Programming, Atlantic City (USA),1984, p. 463–472.
WATT (D.A.). Analysis-oriented two-level grammars. Ph.D. thesis: University of Glasgow, 1974, 285 p.
WEGNER L.M.. On Parsing Two-Level Grammars Acta Informatica, Vol. 14, 1980, p. 175–193.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saidi, S., Boulicaut, JF. (1992). Checking and debugging of two-level grammars. In: Bruynooghe, M., Wirsing, M. (eds) Programming Language Implementation and Logic Programming. PLILP 1992. Lecture Notes in Computer Science, vol 631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55844-6_134
Download citation
DOI: https://doi.org/10.1007/3-540-55844-6_134
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55844-6
Online ISBN: 978-3-540-47297-1
eBook Packages: Springer Book Archive