Relating logic programs and attribute grammars

DOI10.1016/0743-1066(85)90015-9MaRDI QIDQ3711779zbMATH OpenOpenAlexFDO

Authors Pierre Deransart, Jan Maluszyński

Publication date 1985

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00076163/file/RR-0393.pdf

zbMATH Keywords

decorated treesfunctional attribute grammarproof treessimple definite-clause program

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Theory of software (68N99)

Recommendations

• scientific article; zbMATH DE number 4195156
• scientific article; zbMATH DE number 870438
• scientific article; zbMATH DE number 4195155
• Can we transform logic programs into attribute grammars ?
• scientific article; zbMATH DE number 5198991

Cited in

(21)

• AID: an alternative implementation of DCGs
• Inductive assertion method for logic pograms
• An operational formal definition of PROLOG: A specification method and its application
• Relating attribute grammars and lexical-functional grammars
• Context-free hypergraph grammars have the same term-generating power as attribute grammars
• Attribute and unification grammar: A review and analysis of formalisms
• Evolution of rule-based programs
• Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming
• scientific article; zbMATH DE number 4195156 (Why is no real title available?)
• scientific article; zbMATH DE number 4035104 (Why is no real title available?)
• Can we transform logic programs into attribute grammars ?
• scientific article; zbMATH DE number 177436 (Why is no real title available?)
• scientific article; zbMATH DE number 1354904 (Why is no real title available?)
• On the relationship between indexed grammars and logic programs
• scientific article; zbMATH DE number 870438 (Why is no real title available?)
• The accepting power of unary string logic programs
• A relaxed condition for avoiding the occur-check
• On the complexity of regular-grammars with integer attributes
• Proof methods of declarative properties of definite programs
• On attribute grammars without attribute synthesis
• Computational and attribute models of formal languages

This page was built for publication: Relating logic programs and attribute grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3711779)