Relating logic programs and attribute grammars

Deransart, Pierre; Maluszynski, Jan

doi:10.1016/0743-1066(85)90015-9

Cited by 90 publications

(36 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In [9], Deransart Maluszynski show how to construct a Relational Attribute Grammar semantically equivalent to a Logic Program. How does our result differ?…”

Section: Comparison With Previous Published Resultsmentioning

confidence: 99%

“…Deransart and Maluszynski [9] show how to transform arbitrary LPs into Relational Attribute Grammars (RAGs). In RAGs attribute equations are replaced by first order formulae, thus RAGs are more general than AAGs which only permit equational formulae.…”

Section: Related Workmentioning

confidence: 99%

“…The notion of a direction assignment (d-assig) presented in [9] provides the ability to talk about the different behaviors of the arguments of predicates appearing in a LP by classifying them into input or output. This notion extends to AAGs.…”

Section: Center For Digital Economy Research Stem School Of Business mentioning

confidence: 99%

“…The work presented here originated in [13] and was developed independently by the author. In this paper we have adopted terminology similar to the one used in [9]. As an example of the applications that a translation of the type investigated here has, we point out to work by Attali and Franchi-Zanettacci [2].…”

Section: Introductionmentioning

confidence: 99%

“…Deransart and Maluszynski [9] show how to perform this translation for a restricted class of LPs. Our method is more general in the sense that it applies to arbitrary LPs.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Can we transform logic programs into attribute grammars ?

Isakowitz¹

1991

RAIRO-Theor. Inf. Appl.

View full text Add to dashboard Cite

“…In [9], Deransart Maluszynski show how to construct a Relational Attribute Grammar semantically equivalent to a Logic Program. How does our result differ?…”

Section: Comparison With Previous Published Resultsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Center For Digital Economy Research Stem School Of Business mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…Deransart and Maluszynski [9] show how to perform this translation for a restricted class of LPs. Our method is more general in the sense that it applies to arbitrary LPs.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Can we transform logic programs into attribute grammars ?

Isakowitz¹

1991

RAIRO-Theor. Inf. Appl.

View full text Add to dashboard Cite

From programs to object code and back again using logic programming: Compilation and decompilation

Bowen¹

1993

J. Softw. Maint: Res. Pract.

View full text Add to dashboard Cite

A compiler may be specified by a description of how each construct of the source language is translated into a sequence of object code instructions. It is possible to produce a compiler prototype almost directly from this specification in the form of a logic program. This defines a relation between allowed high‐level and low‐level program constructs. Normally a high‐level program is supplied as input to a compiler and object code is returned. Because of the declarative nature of a logic program, it is possible for the object code to be supplied and the allowed high‐level programs returned, resulting in a decompiler, provided enough information is available in the object code. This paper discusses the problems of adopting such an approach in practice. A simple compiler and decompiler are presented in full as an example in the logic programming language Prolog, together with some sample output. The possible benefits of using constraint logic programming are also considered. Potential applications include reverse‐engineering in the software maintenance process, verification of safety‐critical object code, quality assessment of code and program debugging tools.

show abstract

Towards a clean amalgamation of logic programs with external procedures

Bonnier

Maluszynski

1989

Programming Languages Implementation and Logic Programming

View full text Add to dashboard Cite

Relating logic programs and attribute grammars

Cited by 90 publications

References 11 publications

Can we transform logic programs into attribute grammars ?

Can we transform logic programs into attribute grammars ?

From programs to object code and back again using logic programming: Compilation and decompilation

Towards a clean amalgamation of logic programs with external procedures

Contact Info

Product

Resources

About