Generating Spreadsheet-Like Tools from Strong Attribute Grammars

Saraiva, João; Swierstra, Doaitse

doi:10.1007/978-3-540-39815-8_19

Cited by 11 publications

(15 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, we have been able to implement in our environment all the standard examples that have been proposed in the attribute grammar literature. This is the case of repmin [35], HTML table formatting [13], and smart parentheses, an illustrative example of [16], that are available through the cabal package ZipperAG 12 .…”

Section: Related Workmentioning

confidence: 99%

“…Secondly, AG-based systems have extended the standard AG formalism which improves the expressiveness of AGs. Higher-order AGs (HOAGs) [12,13] provide a modular extension to AGs in which abstract trees can be stored as attribute values. Reference AGs (RAGs) [14,15] allow the definition of references to remote parts of the tree, and, thus, extend the traditional tree-based algorithms to graphs.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Embedding attribute grammars and their extensions using functional zippers

Martins

Fernandes

Saraiva

et al. 2016

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

Attribute grammars are a suitable formalism to express complex software language analysis and manipulation algorithms, which rely on multiple traversals of the underlying syntax tree. Attribute grammars have been extended with mechanisms such as reference, higher-order and circular attributes. Such extensions provide a powerful modular mechanism and allow the specification of complex computations. This paper studies an elegant and simple, zipper-based embedding of attribute grammars and their extensions as first class citizens. In this setting, language specifications are defined as a set of independent, off-the-shelf components that can easily be composed into a powerful, executable language processor. Techniques to describe automatic bidirectional transformations between grammars in this setting are also described. Several real examples of language specification and processing programs have been implemented.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Embedding attribute grammars and their extensions using functional zippers

Martins

Fernandes

Saraiva

et al. 2016

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…The layout engine must solve for all remaining x, y, width, and height attributes. The layout language of horizontal boxes, H-AG (Figure 2 (b)) can be declaratively specified as an attribute grammar [15,21,24]. First, the specification defines the set of well-formed input trees as the derivations of a context-free grammar.…”

Section: Attribute Grammarsmentioning

confidence: 99%

“…Saraiva and Swierstra [24] specify non-automatic HTML table layout with attribute grammars and Meyerovich and Bodík [21] first examine CSS.…”

Section: Related Workmentioning

confidence: 99%

Parallel schedule synthesis for attribute grammars

et al. 2013

View full text Add to dashboard Cite

We examine how to synthesize a parallel schedule of structured traversals over trees. In our system, programs are declaratively specified as attribute grammars. Our synthesizer automatically, correctly, and quickly schedules the attribute grammar as a composition of parallel tree traversals. Our downstream compiler optimizes for GPUs and multicore CPUs.We provide support for designing efficient schedules. First, we introduce a declarative language of schedules where programmers may constrain any part of the schedule and the synthesizer will complete and autotune the rest. Furthermore, the synthesizer answers debugging queries about how schedules may be completed.We evaluate our approach with two case studies. First, we created the first parallel schedule for a large fragment of CSS and report a 3X multicore speedup. Second, we created an interactive GPU-accelerated animation of over 100,000 nodes.

show abstract

“…Thus the analysis cannot show termination of many grammars such as the Strong Attribute Grammars (SAG) described by Saraiva [55]. The simple production ordering procedure described in Section 5.5.3 would not succeed on the rules that would be generated for inductive functions.…”

Section: Handling Functions With Inductive Denitionsmentioning

confidence: 99%

Composable semantics using higher-order attribute grammars

Manjacheri¹

View full text Add to dashboard Cite

Generating Spreadsheet-Like Tools from Strong Attribute Grammars

Cited by 11 publications

References 18 publications

Embedding attribute grammars and their extensions using functional zippers

Embedding attribute grammars and their extensions using functional zippers

Parallel schedule synthesis for attribute grammars

Composable semantics using higher-order attribute grammars

Contact Info

Product

Resources

About