3 search results - page 1 / 1 » On Exponential-Time Completeness of the Circularity Problem ... |
CORR
2000
Springer
14 years 5 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
CC
2002
Springer
14 years 5 months ago
2002
Springer
Abstract. Forwarding is a technique for providing default attribute definitions in attribute grammars that is helpful in the modular implementation of programming languages. It com...
SCAM
2007
IEEE
15 years 10 days ago
2007
IEEE
Collection attributes, as defined by Boyland, can be used as a mechanism for concisely specifying cross-referencelike properties such as callee sets, subclass sets, and sets of v...