Lämmel, R.: Extensible parameterized context-free grammars by transforming attributions, Draft, partially to be submitted to PLILP'96 together with Riedewald, G. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A calculus for modular and extensible language definition in LDL - Lämmel, Riedewald (1996) Self-citation (Lmmel) (Correct)
....LDL like specifications Current work in the LDL project is on establishing a calculus over the exploited specification formalisms (AGs, in particular GSFs, and RFDs) The calculus offers operations and schemes of definition which support modularity and extensibility in language definition. In [L m96] we address the problem of extensibility of GSF schemes in detail. Here, we present an overview on the calculus concentrating on extensibility of GSF schemes. Fig.2 presents the signature of some operations on GSF schemes. CFG s GSF schemes O verr ide Jo in Construc t P ro paga t e M erge GSF ....
....specifications. Thus, the approach has to be distinguished from particular extensions at the level of AG specification languages (as e.g. in Tools) Such operations as we have presented above can be formalised naturally in terms of a natural semantics description or by an algebraic specification [L m96]. Some of these operations can even be understood in terms of a compositional denotational semantics (e.g. Merge) Other rather demand to think of them as transformations in the sense of meta programming (e.g. Construct) To our knowledge this consequent operation based style as well as the ....
Lämmel, R.: Extensible parameterized context-free grammars by transforming attributions, Draft, partially to be submitted to PLILP'96 together with Riedewald, G.
Operating on Parameterized Context-Free Grammars - Lämmel, Riedewald (1996) Self-citation (Lmmel) (Correct)
....several aspects have been formalised in natural semantics. The approach is expected to be useful in the context of other formalisms with parameterized symbols such as algebraic specification, recursive function definition and logic programming and also for problems beside language definition. See [L m96] for details. 1 Overview Espinosa demonstrated by his system Semantic Lego [Esp94] how to turn the progress in formal semantics (denotational style with monads) into system support. Essentially, semantic aspects can be described in separation and the system offers a powerful assembling process ....
Lämmel, R.: Extensible parameterized context-free grammars by transforming attributions, Draft, Fachbereich Informatik, Universität Rostock
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