Higher order attribute grammars

Vogt, Harald; Swierstra, S. Doaitse; Kuiper, M.F.

doi:10.1145/73141.74830

Cited by 121 publications

(54 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The synthetic nodes are constructed using the attribute grammar mechanism of non-terminal attributes (NTAs) [40], i.e., attributes whose values are new AST children. In JastAddJ, all attributes are computed automatically by the attribute grammar evaluator, and on demand, constructing only the synthetic decorating nodes that are needed for a particular program.…”

Section: Methodsmentioning

confidence: 99%

Multitudes of Objects: First Implementation and Case Study for Java.

Steimann¹,

Öqvist²,

Hedin³

2014

JOT

View full text Add to dashboard Cite

In object-oriented programs, the relationship of an object to many objects is usually implemented using indirection through a collection. This is in contrast to a relationship to one object, which is usually implemented directly. However, using collections for relationships to many objects does not only mean that accessing the related objects always requires accessing the collection first, it also presents a lurking maintenance problem that manifests itself when a relationship needs to be changed from to-one to to-many or vice versa. Continuing our prior work on fixing this problem, we show how we have extended the Java 7 programming language with multiplicities, that is, with expressions that evaluate to a number of objects not wrapped in a container, and report on the experience we have gathered using these multiplicities in a case study.

show abstract

Section: Methodsmentioning

confidence: 99%

Multitudes of Objects: First Implementation and Case Study for Java.

Steimann¹,

Öqvist²,

Hedin³

2014

JOT

View full text Add to dashboard Cite

show abstract

“…For lazyEval, we need some special behavior: in that case, a coroutine resumes and runs immediately towards its end. It 8 Alternatively, the additional nonterminal can be specified as a higher-order attribute using Higher-Order AGs [25] (supported by UUAG), which has the advantage that it is not externally visible in the grammar. 9 Actually, the Progress nonterminal can be implemented using a merge-rule (Appendix A).…”

Section: Hybrid On-demand and Stepwise Evaluationmentioning

confidence: 99%

Stepwise evaluation of attribute grammars

Middelkoop

Dijkstra

Swierstra

2011

Proceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications

View full text Add to dashboard Cite

Attribute Grammars are a powerful formalism to specify and implement the semantics of programming languages (e.g. as in a compiler), in particular when the semantics are syntax directed. Advanced type systems, however, use nondeterminism in their specifications to encode decisions that are independent of syntax. The implementation of such decisions is hard to express algorithmically using conventional attribute evaluation.This paper presents Stepwise Attribute Grammars (SAGs). In a SAG, nondeterministic choices can be expressed in a natural way in conjunction with unambiguous resolution strategies based on attribute values. SAGs preserve the functional relationships between attributes and support on-demand evaluation. Nondeterminism is encoded as a choice between the semantic results of children. Evaluation of a child can be performed in a stepwise fashion: it is paused after each step and yields a progress report with intermediate results, until the child is reduced to its semantic value. This facilitates a breadth-first exploration of choices, until choices can be resolved based on the progress reports.

show abstract

“…The PROTOS project [17,18] at Oulu University uses a higher order attribute grammar [31] to both decode the protocol data and to generate test sets. A grammar structure is instantiated to make a concrete data set that is used for the test.…”

Section: Related Workmentioning

confidence: 99%

Packet decoding using context sensitive parsing

Marquis

Dean

Knight

2006

Proceedings of the 2006 Conference of the Center for Advanced Studies on Collaborative Research - CASCON '06

View full text Add to dashboard Cite

Protocol tester is a project at RMC andQueen's that applies program transformation techniques to protocol data to evaluate the security of network applications. As part of this process, binary protocols are translated into a textual representation. This paper describes a translation process using a context sensitive parser that eliminates the need to write custom code to decode each individual protocol. It is a template driven top down parser augmented by a constraint engine. The constraint engine is used to implement the context sensitive restrictions.

show abstract

Higher order attribute grammars

Cited by 121 publications

References 6 publications

Multitudes of Objects: First Implementation and Case Study for Java.

Multitudes of Objects: First Implementation and Case Study for Java.

Stepwise evaluation of attribute grammars

Packet decoding using context sensitive parsing

Contact Info

Product

Resources

About