Filters








8,986 Hits in 4.4 sec

Rie and Jun: Towards the generation of all compiler phases [chapter]

Masataka Sassa
1991 Lecture Notes in Computer Science  
It is based on finitely recursive attribute grammars, a class of attribute grammars which allow circularities in attribute dependency [Farrow 86].  ...  Pie is a compiler generator based on a one-pass attribute grammar called ECLR-attributed grammar [Sassa 87]. The generated compiler evaluates attributes in parallel with LR parsing.  ...  Hayashi for helpful comments to the manuscript.  ... 
doi:10.1007/3-540-53669-8_74 fatcat:imlv4o63rjgfpc22za3rlmpite

Storage allocation strategies for recursive attribute evaluators [chapter]

Kazunori Mizushima, Takuya Katayama
1998 Lecture Notes in Computer Science  
A is a set of attributes. Each nonterminal X E VN has a subset A[X] of A. A[X] is a disjoint union of the set INH[X] of inherited attributes, which pass  ...  As for attribute grammars, if there is a pebbling of attributes under a shared edge set, it is an evaluable sequence.  ...  Restrictions on Allocation Storage allocation for recursive evaluator studied in [7] and [10] takes exponential time for finding an optimum allocation.  ... 
doi:10.1007/bfb0026422 fatcat:hvkiuqb76jeoxbo3rbino7k5wu

Parallel schedule synthesis for attribute grammars

Leo A. Meyerovich, Matthew E. Torok, Eric Atkinson, Rastislav Bodik
2013 Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '13  
In our system, programs are declaratively specified as attribute grammars and parallel traversals are defined by a compiler designed to optimize them for both GPUs and multicore CPUs.  ...  Second, we created a GPU-accelerated visualization language for real-time interactive animations of over 100,000 nodes.  ...  An attribute grammar may be scheduled in many ways.  ... 
doi:10.1145/2442516.2442535 dblp:conf/ppopp/MeyerovichTAB13 fatcat:ur4c67whyjabzj73btlbadzbze

Page 6650 of Mathematical Reviews Vol. , Issue 90K [page]

1990 Mathematical Reviews  
Summary: “Transformations of attributed program trees form an essential part of compiler optimizations.  ...  This attribute evaluation and tree transformation strategy shows similarities with the evaluation methods for circular attribute grammars.” 90k:68097 68Q50 03D05 68Q45 Buszkowski, Wojciech (PL-POZN) Gaifman  ... 

Parallel schedule synthesis for attribute grammars

Leo A. Meyerovich, Matthew E. Torok, Eric Atkinson, Rastislav Bodik
2013 SIGPLAN notices  
In our system, programs are declaratively specified as attribute grammars and parallel traversals are defined by a compiler designed to optimize them for both GPUs and multicore CPUs.  ...  Second, we created a GPU-accelerated visualization language for real-time interactive animations of over 100,000 nodes.  ...  An attribute grammar may be scheduled in many ways.  ... 
doi:10.1145/2517327.2442535 fatcat:j4arv2rp4zeqtcequ2oongsadu

Circular reference attributed grammars — their evaluation and applications

Eva Magnusson, Görel Hedin
2007 Science of Computer Programming  
We also present a general demand-driven evaluation algorithm for CRAGs and some optimizations of it.  ...  This paper presents a combination of Reference Attributed Grammars (RAGs) and Circular Attribute Grammars (CAGs).  ...  Acknowledgements We are grateful to John Boyland and the anonymous reviewers for valuable feedback and helpful comments.  ... 
doi:10.1016/j.scico.2005.06.005 fatcat:hkqkf4tydnb77ioya3gawad56e

Circular Reference Attributed Grammars - their Evaluation and Applications

Eva Magnusson, Görel Hedin
2003 Electronical Notes in Theoretical Computer Science  
We also present a general demand-driven evaluation algorithm for CRAGs and some optimizations of it.  ...  This paper presents a combination of Reference Attributed Grammars (RAGs) and Circular Attribute Grammars (CAGs).  ...  Acknowledgements We are grateful to John Boyland and the anonymous reviewers for valuable feedback and helpful comments.  ... 
doi:10.1016/s1571-0661(05)82627-1 fatcat:ydkadgttjveudbj4idtlomrcny

A systematic approach to the implementation of attribute grammars with conventional compiler construction tools

Daniel Rodríguez-Cerezo, Antonio Sarasa-Cabezuelo, José-Luis Sierra
2012 Computer Science and Information Systems  
By providing alternative implementations for these attribution operations, it is possible to plug in different semantic evaluation strategies in a seamlessly way (e.g., a demand-driven strategy, or a data-driven  ...  This article describes structure-preserving coding patterns to code arbitrary non-circular attribute grammars as syntax-directed translation schemes for bottom-up and top-down parser generation tools.  ...  -If the implementation uses the data-driven evaluation style, the performance will be optimal for s-attributed grammars.  ... 
doi:10.2298/csis111223022r fatcat:32xttlaltzazpaa4xtyqpj6bje

Circular attribute grammars with remote attribute references and their evaluators

Akira Sasaki, Masataka Sassa
2004 New generation computing  
We will also show a way to construct an efficient evaluator for CRAGs called a mostly static evaluator.  ...  Attribute grammars (AGs) are a suitable formalism for development of language processing systems.  ...  Acknowledgements The authors would like to thank John Tang Boyland and the anonymous referees for their comments on an earlier draft. * 11 Boyland's circular and remote AGs have more expressive power in  ... 
doi:10.1007/bf03037280 fatcat:nfznbfklmzhtxh2shqdacbqynm

A semantics-directed compiler generator

Lawrence Paulson
1982 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '82  
I would fike to thank my advisor, John Hennessy, for supervising and supporting this research. Pascal's grammar reveals some trouble spots.  ...  Replace the simplifier with two specialized, more efficient routines: an evaluator for static semantics, and an optimizer for dynamic semantics. q Compile programs one procedure at a time, so that programs  ...  Semantic Grammars A semantic grammar is an attribute grammar that uses the domains and formulas of denotational semantics.  ... 
doi:10.1145/582153.582178 dblp:conf/popl/Paulson82 fatcat:psc6pxgo6jehtj7d5az5utkzte

Algebraic optimization of recursive queries

Maurice A.W. Houtsma, Peter M.G. Apers
1992 Data & Knowledge Engineering  
strategies for recursive queries.  ...  In this paper we describe an optimization strategy that rewrites regular (in the context of formal grammars) mutually recursive queries into standard Relational Algebra and transitive closure operations  ...  Acknowledgements We thank the reviewers for their comments, which have greatly improved the quality of the paper.  ... 
doi:10.1016/0169-023x(92)90029-b fatcat:tcydmhdf6zcgri3ty3dmhgmd5i

Composable XML integration grammars

Wenfei Fan, Minos Garofalakis, Ming Xiong, Xibei Jia
2004 Proceedings of the Thirteenth ACM conference on Information and knowledge management - CIKM '04  
To efficiently evaluate XIGs we provide algorithms for merging XML queries in an XIG and for scheduling queries and embedded XIGs.  ...  its evaluation.  ...  Note that for each , its inherited attribute is evaluated first, then its synthesized attribute, which is an -subtree.  ... 
doi:10.1145/1031171.1031176 dblp:conf/cikm/FanGXJ04 fatcat:3ke56qlkabbulbjprtxtokknzm

On the optimality of change propagation for incremental evaluation of hierarchical attribute grammars

Alan Carle, Lori Pollock
1996 ACM Transactions on Programming Languages and Systems  
In this short article, we present a characterization of optimal incremental evaluation that indicates the unsuitability of change propagation as the basis of an optimal incremental evaluator for hierarchical  ...  attribute grammars.  ...  A CHARACTERIZATION OF OPTIMALITY FOR HIERARCHICAL ATTRIBUTE GRAMMARS The goal of an optimal evaluator is to minimize the total time required to update a set of module instances in response to a change  ... 
doi:10.1145/225540.225542 fatcat:dopl5c2d7bbqrencrqcddx42ia

LINGUIST-86

Rodney Farrow
1982 SIGPLAN notices  
; if the input attribute grammar is evaluable in 4 alternating passes then then the seventh overlay is run 4 times.  ...  The timing figures indicate that this pass spends about 20 seconds doing something We have also timed LINGUIST-86 processing our attribute grammar for Pascal.  ... 
doi:10.1145/872726.806992 fatcat:i7q2hpk3tjgbto6y6y2dy4sw34

Incremental evaluation for a general class of circular attribute grammars

J. A. Walz, G. F. Johnson
1988 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation - PLDI '88  
The recursive synth-function evaluator described in [Far861 addresses evaluation process termination problems in recursive attribute grammars by pulling the evaluation of an SCC into a single  ...  grammars, [Knu68], is an algorithm for testing attribute grammars for noncircutarity.  ... 
doi:10.1145/53990.54011 dblp:conf/pldi/WalzJ88 fatcat:di6gt2yvk5gcdjheldar6tko74
« Previous Showing results 1 — 15 out of 8,986 results