Compiling circular attribute grammars into Prolog

Journal Article · Thu May 01 00:00:00 EDT 1986 · IBM J. Res. Dev.; (United States)

DOI:https://doi.org/10.1147/rd.303.0294· OSTI ID:5480888

Arbab, B

This paper describes an algorithm for compiling attribute grammars into Prolog. The attribute grammars may include inherited and synthesized attributes and contain recursive (circular) definitions. The semantics of the recursive definitions is defined in terms of a fixed-point finding function. The generated Prolog code stands in direct relation to its attribute grammar, where logical variables play the role of synthesized or inherited attributes. Thus an effective method for the execution of recursive attribute grammars has been defined and applied.

• Research Organization: IBM Scientific Center, 11601 Wilshire Boulevard, Los Angeles, CA 90025
• OSTI ID: 5480888
• Journal Information: IBM J. Res. Dev.; (United States), Vol. 30:3
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
PROLOG
ALGORITHMS
TRANSLATORS
FUNCTIONS
PROGRAMMING
STANDARDIZED TERMINOLOGY
COMPUTER CODES
MATHEMATICAL LOGIC
PROGRAMMING LANGUAGES
990200* - Mathematics & Computers