Translation of attribute grammars into procedures

Katayama, Takuya

doi:10.1145/579.586

Cited by 48 publications

(16 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When a model is instantiated, a new parser/analyzer instance is created. During the execution of the instance, attributes and semantic functions are evaluated and executed, following traditional techniques for L-attributed grammars [Katayama 1984]. Look-ahead sets are computed in advance and may be used for enabling/disabling of widgets (see section 2.2).…”

Section: Run Time Architecturementioning

confidence: 99%

A scalable formal method for design and automatic checking of user interfaces

Berstel

Reghizzi

Roussel

et al. 2005

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Cite

The paper addresses the formal specification, design and implementation of the behavioral component of graphical user interfaces. The complex sequences of visual events and actions that constitute dialogs are speci-fied by means of modular, communicating grammars called VEG (Visual Event Grammars), which extend traditional BNF grammars to make them more convenient to model dialogs. A VEG specification is independent of the actual layout of the GUI, but it can easily be integrated with various layout design toolkits. Moreover, a VEG specification may be verified with the model checker SPIN, in order to test consistency and correctness, to detect deadlocks and unreachable states, and also to generate test cases for validation purposes. Efficient code is automatically generated by the VEG toolkit, based on compiler technology. Realistic applica-tions have been specified, verified and implemented, like a Notepad-style editor, a graph construction library and a large real application to medical software. It is also argued that VEG can be used to specify and test voice interfaces and multi-modal dialogs. The major contribution of our work is blending together a set of features coming from GUI design, compilers, software engineering and formal verification. Even though we do not claim novelty in each of the techniques adopted for VEG, they have been united into a toolkit supporting all GUI design phases, i.e., specification, design, verification and validation, linking to applications and coding.

show abstract

Section: Run Time Architecturementioning

confidence: 99%

A scalable formal method for design and automatic checking of user interfaces

Berstel

Reghizzi

Roussel

et al. 2005

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Cite

show abstract

“…A tree-walking evaluator traverses a syntax tree computing attribute values that are then stored in cells associated with each of the syntax tree nodes. In contrast, applicative evaluators first translate an attribute grammar into a program consisting of a collection of recursive applicative functions and then simply apply the function defining the result attribute of the attribute grammar to a syntax tree [Franchi-Zannettacci 1982;Katayama 1984].…”

Section: Optimal Incremental Evaluation Of Nonhierarchical Attribute mentioning

confidence: 99%

“…Time-optimal algorithms must, therefore, in constant time locate the "first" inconsistent attribute and, at any time during change propagation, determine the "next" inconsistent attribute to evaluate in accordance with the topological ordering of all of the attributes in the syntax tree. The well-known algorithms of Yeh [1983] and Reps [1982;1984] do just this. …”

Section: · Alan Carle and Lori Pollockmentioning

confidence: 99%

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

Carle

Pollock

1996

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

Several new attribute grammar dialects have recently been developed, all with the common goal of allowing large, complex language translators to be specified through a modular composition of smaller attribute grammars. We refer to the class of dialects as hierarchical attribute grammars. 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. This result lends strong support to the use of incremental evaluators based on more applicative approaches to attribute evaluation, such as Carle and Pollock's evaluator based on caching of partially attributed subtrees, Pugh's evaluator based on function caching of semantic functions, and Swierstra and Vogt's evaluator based on function caching of visit sequences.

show abstract

“…We suppose the class of attribute grammars is absolutely non-circular and their evaluator is a recursive attribute evaluator proposed in [6]. The structure of this paper is as follows.…”

Section: Introductionmentioning

confidence: 99%

“…This grammar computes the value and the length of fractional binary notation [6]. The evaluator targeted in this paper is a recursive evaluator proposed in the literature [6]. The evaluator is able to evaluate the class of absolutely non-circular attribute grammars.…”

Section: Introductionmentioning

confidence: 99%

Storage allocation strategies for recursive attribute evaluators

Mizushima¹,

Katayama

1998

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

I n t r o d u c t i o nOne of the features of attribute grammars is their evaluators can be generated automatically by mechanical transformations, and many research efforts have been focused on generating efficient evaluators. Generally, it is considered that the efficiency depends mainly on storage allocation for attributes. However there is a correlation between the storage allocation and evaluation order of attributes [I, 2]. This makes the allocation difficult.Most researches on the storage allocation are divided into two categories: one gives priority to evaluation order and the other to storage allocation. The former method such as [1,3,4,5,11] first firms up the evaluation order, and then allocates attributes to storage. Conversely, the latter method such as [2, 7, 10, 13] first makes some allocation for attributes, and then examines whether an evaluable order exists under that allocation or not and chooses evaluable and the most optimized one. The latter allows us to get more optimized allocation than the former. However, the allocation problem of the latter is known to be NP-complete [2,13].In this paper we propose an allocation strategy in order to solve the problem within a practical amount of time. We suppose the class of attribute grammars is absolutely non-circular and their evaluator is a recursive attribute evaluator proposed in [6]. The structure of this paper is as follows. In Section 2, we explain notations used in this paper and the recursive evaluator. In Section 3, restrictions on the allocation are introduced and a formal definition of allocation problem is given. Reduction theorems to solve the a~ocation problem within a practical amount of time are proved in Section 4. Basic method called single-chain is suggested in Section 5 and two improved methods are suggested in Section 6. Section 7 is the conclusion.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

show abstract

Translation of attribute grammars into procedures

Cited by 48 publications

References 14 publications

A scalable formal method for design and automatic checking of user interfaces

A scalable formal method for design and automatic checking of user interfaces

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

Storage allocation strategies for recursive attribute evaluators

Contact Info

Product

Resources

About