Search results for keyword `LP'

[2]

H. Abramson. Definite clause translation grammars. In IEEE Symp. on Logic Programming, pages 233-248. Atlantic City, 1984.

The author introduces definite clause translation grammars, a new class of logic grammars which generalizes definite clause grammars and which may be thought of as a logical implementation of attribute grammars. Definite clause translation grammars permit the specification of the syntax and semantic rules in the form of Horn clauses attached to each node of the parse tree (automatically created during syntactic analysis), and which control traversal(s) of the parse tree and computation of attributes of each node. The semantic rules attached to a node constitute, therefore, a local database for the node. the separation of syntactic and sematic rules is intended to promote modularity, simplicity, clarity of definition, and ease of modification.

[46]

Isabelle Attali and Jacques Chazarain. Functional evaluation of strongly non-circular typol specifications. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 157-176. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[47]

Isabelle Attali and Paul Franchi-Zannettacci. Unification-free execution of typol programs by semantic attribute evaluation. In Actes du Séminaire Franco-Soviétique Informatika 88, pages 9-26. INRIA, Nice, February 1988. See also: rapport RR-864, INRIA, Rocquencourt (July 1988).

[49]

Isabelle Attali. Compiling typol with attribute grammars. In Pierre Deransart, Bernard Lorho, and Jan Maluszynski, editors, Programming Languages Implementation and Logic Programming, volume 348 of Lecture Notes in Computer Science, pages 252-272. Springer-Verlag, New York-Heidelberg-Berlin, May 1988. Orléans.

[165]

Bruno Courcelle and Pierre Deransart. Proofs of partial correctness for attribute grammars with application to recursive procedures and logic programming. Information and Computation, 78(1):1-55, July 1988.

[184]

Pierre Deransart and Jan Maluszynski. Modelling data dependencies in logic programs by attribute schemata. rapport RR 323, INRIA, Rocquencourt, July 1984. Also published as a report, Linköping Institute of Technology (October 1984).

[185]

Pierre Deransart and Jan Maluszynski. Relating logic programs and attribute grammars. Journal of Logic Programming, 2(2):119-155, 1985. Also published as a report, Linköping Institute of Technology (October 1984), and as rapport RR 393, INRIA, Rocquencourt (1985).

[187]

Pierre Deransart and Jan Maluszynski. A grammatical view of logic programming. In Pierre Deransart, Bernard Lorho, and Jan Maluszynski, editors, Programming Languages Implementation and Logic Programming, volume 348 of Lecture Notes in Computer Science, pages 219-251. Springer-Verlag, New York-Heidelberg-Berlin, May 1988. Orléans.

[314]

Harald Ganzinger and Michael Hanus. Modular logic programming of compilers. Forschungsbericht 189, Fachbereich Informatik, University Dortmund, 1984.

[428]

N. Iwamoto. Relational attribute grammars. M. eng. thesis, Department of Comp. Sc., Yamanashi University, 1985. (in Japanese).

[615]

J. Leszezylowski, S. Bonnier, and Jan Maluszynski. Logic programs with external procedures: Introducing S-unification. University of Linköping, April 1987.

[663]

Jan Maluszynski. Attribute grammars and logic programs: a comparison of concepts. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 330-357. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

The paper presents a unified view of attribute grammars and definite logic programs that allows for comparison of concepts and techniques used in both fields. A common basic notion of both formalisms is that of labelled tree. The semantics of attribute grammars can be defined in terms of decorated parse trees while the semantics of logic programs can be defined in terms of proof trees. The comparison of concepts shows that attribute grammars have several features not present in definite logic programs. These are: the concept of the language derived, many-sorted types, the notion of dependency relation and the notion of semantic domain with the semantic functions. After having identified these differences we mention some extensions proposed to the field of logic programming, which essentially amount to enriching definite programs with these features. The conclusions of this discussion is that a possible common denominator for logic programs and attribute grammars is the concept of constraint logic program. As a justification of this comparative study the paper gives references to the results obtained by transfer of methods between attribute grammars and logic programs.

[741]

U. Nilsson. AID: an alternative implementation of DCGs. New Generation Computing, 4, 1986.

[760]

Jukka Paakki, Ilka Miloucheva, and Hans Loeper. Prolog in practical compiler writing compiler structure engineering with attribute grammars. The Computer Journal ACM SIGPLAN Notices, ? 26(2 10):73-82, October 1991.

[768]

Jukka Paakki. Paradigms for Attribute-grammar-based Language Implementation. Ph.D. thesis, Department of Comp. Sc., University of Helsinki, February 1991.

[869]

Günter Riedewald and Uwe Lämmel. Using an attribute grammar as a logic program. In Pierre Deransart, Bernard Lorho, and Jan Maluszynski, editors, Programming Languages Implementation and Logic Programming, volume 348 of Lecture Notes in Computer Science, pages 161-179. Springer-Verlag, New York-Heidelberg-Berlin, May 1988. Orléans.

[875]

Günter Riedewald. Prototyping by using an attribute grammar as a logic program. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 401-437. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

The problem of prototyping software and languages by attribute grammars is considered. The applied attribute grammars -- Grammars of Syntactical Functions (GSF) -- are very closely related to logical programs. Therefore, prototyping exploiting PROLOG systems is suggested.

[971]

Victor E. Tavernini. Translating natural semantic specifications to attribute grammars. report UIUCDCS-R-88-1407, Department of Comp. Sc., University of Illinois at Urbana-Champaign, May 1988.