Kyung-Goo Doh and Peter D. Mosses. Composing programming languages by combining action-semantics modules. Sci. Comput. Program., 47(1):3--36, 2003.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....circled node AN2 represents all modules of evalan, the action interpreter. Module Pico Trans defines functions which translate various lowlevel Pico sorts (integers, identifiers) to their action semantic counterparts. Note that the definition of Pico is not composed in the way as advocated in [14]. In that approach, there is one module for each syntactic construct, semantic entity, semantic function and semantic equation. The high degree of modularity thus obtained allows programming languages to be defined just by composing the appropriate modules. Although reuse of specifications has ....

Kyung-Goo Doh and Peter D. Mosses. Composing programming languages by combining action-semantics modules. Science of Computer Programming, 47(1):3--36, April 2003.

....be divided into systems based on a denotational approach and systems based on an operational approach. In the denotational approach a program expression is translated to its computational value. Typical systems supporting this approach are action semantics, LPS, and Montages. In action semantics [5] an expression is translated to an action, which represents its computation. In the LPS system [11] an expression is mapped onto a monadic computation [12] In Montages programs are translated to abstract state machines [10] While denotational This is a preliminary version. The final version will ....

....are reusable and can be combined using di#erent strategies, making it easy to experiment with evaluation strategy and language configurations. Such configurations do not depend on the module structure of the specification as is the case, for example, in the approach to modular action semantics [5]; it is possible to define di#erent interpreters in the same specification module based on the same set of rules. For example, in [6] interpreters based on lazy and strict evaluation for RhoStratego are defined using the same set of rules. Furthermore, the set of rules can be used for other ....

K.-G. Doh and P. D. Mosses. Composing programming languages by combining action-semantics modules. In Workshop on Language Descriptions, Tools and Applications (LDTA'2001.

....be divided into systems based on a denotational approach and systems based on an operational approach. In the denotational approach a program expression is translated to its computational value. Typical systems supporting this approach are action semantics, LPS, and Montages. In action semantics [5] an expression is translated to an action, which represents its computation. In the LPS system [11] an expression is mapped onto a monadic computation [12] In Montages programs are translated to abstract state machines [10] While denotational c 2002 Published by Elsevier Science B. V. ....

....are reusable and can be combined using di erent strategies, making it easy to experiment with evaluation strategy and language con gurations. Such con gurations do not depend on the module structure of the speci cation as is the case, for example, in the approach to modular action semantics [5]; it is possible to de ne di erent interpreters in the same speci cation module based on the same set of rules. For example, in [6] interpreters based on lazy and strict evaluation for RhoStratego are de ned using the same set of rules. Furthermore, the set of rules can be used for other ....

K.-G. Doh and P. D. Mosses. Composing programming languages by combining action-semantics modules. In Workshop on Language Descriptions, Tools and Applications (LDTA'2001.

....Suppose we have the simple context free grammar for terms as presented in Figure 1. An Id is de ned to be one ore more characters from the class [a z] and two terms are separated by whitespace consisting of zero or more spaces or newlines. Term : Id Nat Term Ws Term Id : a z] Nat : [0 9] Ws : n] restrictions Id [a z] Nat [0 9] Ws [ n] Figure 1. Term language with follow restrictions. Without any lexical disambiguation, this grammar is ambiguous. For example, the sentence hi can be parsed as Term(Id( hi ) or as Term(Id( h ) Ws( Term(Id( i ) ....

....presented in Figure 1. An Id is de ned to be one ore more characters from the class [a z] and two terms are separated by whitespace consisting of zero or more spaces or newlines. Term : Id Nat Term Ws Term Id : a z] Nat : 0 9] Ws : n] restrictions Id [a z] Nat [0 9] Ws [ n] Figure 1. Term language with follow restrictions. Without any lexical disambiguation, this grammar is ambiguous. For example, the sentence hi can be parsed as Term(Id( hi ) or as Term(Id( h ) Ws( Term(Id( i ) Assuming the rst is the intended derivation, we add a ....

[Article contains additional citation context not shown here]

K.-G. Doh and P.D. Mosses. Composing programming languages by combining action-semantics modules. In M.G.J. van den Brand and D. Parigot, editors, Electronic Notes in Theoretical Computer Science, volume 44, 2001.

....of interactive and object oriented features [4,24,23,29,49] Another line of research is the automatic derivation of compilers from the obtained interpreters. This line has already been started in [13,14] LPS allows the definition of a language from reusable semantic building blocks. In [8], the same problem is solved in the Action Semantics framework. In our approach, however, there are no conflicts leading to inconsistencies because the combined constructions belong to di#erent abstract syntax entities. It would be very interesting to make deeper comparisons of the modularity of ....

K. Doh and P. Mosses. Composing programming languages by combining action-semantics modules. In M. van den Brand, M. Mernik, and D. Parigot, editors, First workshop on Language, Descriptions, Tools and Applications, Genova, Italy, April 2001.

.... Interpreters with Rewriting Strategies Eelco Dolstra and Eelco Visser Institute of Information and Computing Sciences, Universiteit Utrecht, P.O. Box 80089, 3508 TB Utrecht, The Netherlands. http: www.cs.uu.nl people eelco,visser eelco cs.uu.nl, visser acm.org Abstract Programming language semantics based on pure rewrite rules su#ers from the gap between rewriting strategy implemented in rewriting engines and the intended evaluation ....

....Interpreters with Rewriting Strategies Eelco Dolstra and Eelco Visser Institute of Information and Computing Sciences, Universiteit Utrecht, P.O. Box 80089, 3508 TB Utrecht, The Netherlands. http: www.cs.uu.nl people eelco,visser eelco cs.uu.nl, visser acm.org Abstract Programming language semantics based on pure rewrite rules su#ers from the gap between rewriting strategy implemented in rewriting engines and the intended evaluation strategy. ....

[Article contains additional citation context not shown here]

K.-G. Doh and P. D. Mosses. Composing programming languages by combining action-semantics modules. In Workshop on Language Descriptions, Tools and Applications (LDTA'

....has been used in a number of industrial and scientific projects. Amongst others it was used for parsing and compiling Asf Sdf specifications, automatically renovating Cobol code, program analysis of legacy code via so called island grammars [21] and development of new Action Notation syntax [14]. 5.2 ELAN ELAN [6] is a modular algebraic specification language with sophisticated mixfix syntax. ELAN supports the prototyping of theorem provers, constraint solvers and decision procedures. The ELAN system provides an environment for specifying and prototyping deduction systems in a language ....

Kyung-Goo Doh and Peter D. Mosses. Composing programming languages by combining action-semantics modules. In Mark van den Brand and Didier Parigot, editors, Electronic Notes in Theoretical Computer Science, volume 44. Elsevier Science Publishers, 2001.

No context found.

Kyung-Goo Doh and Peter D. Mosses. Composing programming languages by combining action-semantics modules. Science of Computer Programming, 47(1):3--36, 2003.

No context found.

K.-G. Doh and P. D. Mosses. Composing programming languages by combining action-semantics modules. Sci. Comput. Programming, 47(1):3--36, 2003.

....module, since it is unusual for two different languages to have exactly the same constructs of any sort except when one of them is simply an extension of the other. With the aim of allowing direct reuse, a new modular structure for action semantics was proposed by Doh and the author at LDTA 01 [2]. The main idea, taken from the Montages framework [4] is to let the description of each individual programming construct be a separate module. Such a module specifies both the syntax and semantics of a construct together with any assumptions that have to be made about the semantic entities ....

K.-G. Doh and P. D. Mosses. Composing programming languages by combining action-semantics modules. In M. van den Brand and D. Parigot, editors, Electronic Notes in Theoretical Computer Science, volume 44. Elsevier Science Publishers, 2001.

No context found.

Kyung-Goo Doh and Peter D. Mosses. Composing programming languages by combining action-semantics modules. Sci. Comput. Program., 47(1):3--36, 2003.

No context found.

K.-G. Doh and P. D. Mosses. Composing programming languages by combining action-semantics modules. Sci. Comput. Programming, 47(1):3--36, 2003.

No context found.

Kyung-Goo Doh and Peter D. Mosses. Composing programming languages by combining action-semantics modules. In Mark van den Brand and Didier Parigot, editors, Electronic Notes in Theoretical Computer Science, volume 44. Elsevier Science Publishers, 2001.

No context found.

K. G. Doh and P. D. Mosses. Composing programming languages by combining action-semantics modules. Science of Computer Programming, 47(1):3--36, 2003.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC