| Lex Augusteijn. The Elegant compiler generator system. In Attribute Grammars and their Applications, volume 461 of LNCS. Springer-Verlag, 1990. |
....syntactic correctness, of course) Regarding macro processors, we refer to the comprehensive survey that we provide in [3] Our present tool is unique in simultaneously being parameterized with the grammar of the host language and providing strong safety guarantees. Compiler generators, such as [9,1,7,11], have wider ambitions than our work, supporting specifications of full scale compilers including static and dynamic semantics. Invariably, this involves Turing complete computations on parse trees which of course precludes our level of safety guarantees. The extensible grammars of [4] share our ....
Lex Augusteijn. The Elegant compiler generator system. In Attribute Grammars and their Applications, volume 461 of LNCS. Springer-Verlag, 1990.
....By contrast, XT supports multiple programming languages, and offers an extendible set of components that can combined in various ways. Many tools and frameworks for program transformation, or for some of its sub scenarios, already exist. Among these are attribute grammar systems (e.g. Elegant [3]) algebraic rewriting systems (e.g. ASF SDF Meta Environment [27] ELAN [20] and object oriented systems (e.g. the Smalltalk refactoring browser [123] and OPENC [42] See [143] for a more complete overview of transformation frameworks. Generally, these systems are closed in the sense that ....
L. Augusteijn. The elegant compiler generator system. In P. Deransart and M. Jourdan, editors, Attribute Grammars and their Applications, volume 461 of Lecture Notes in Computer Science, pages 238--254. SpringerVerlag, September 1990.
....since A is not equal to or a subclass of B. 7 Related work The idea to support non local dependencies has been suggested in a number of systems in various ways. Many of these approaches provide some kind of special support for nested scopes (supporting Algol like block structure) such as [13, 14, 3, 17, 11, 2], but fail to handle more complex scope combinations such as inheritance or qualified access of identifiers. In contrast, RAGs allow the scope mechanisms to be defined completely within the grammar formalism and are not restricted to predefined combinations. Some systems support limited kinds of ....
....statement back to the first instruction. However, for the purpose of the attribute evaluation, these references are just treated as constants and may not be dereferenced. Dereferencing can only be done after the attribution is complete, by an interpreter written directly in C. The Elegant system [2] also supports the construction of a cyclic program construct graph which is essentially the syntax tree extended with edges from use sites to declaration sites. However, the additional edges cannot be dereferenced in order to define other attributes. They may, however, be dereferenced after the ....
L. Augusteijn. The Elegant Compiler Generator System. In Attribute Grammars and their Applications, pp 238-254, LNCS 461, Springer-Verlag, September 1990.
....which does make it possible to automatically generate a compiler from a given formal language speci cation. An obvious advantage of this approach is that the compiler is always up to date w.r.t. the language speci cation. For the de nition of the Elegant language we refer to [Aug00] In [Aug90], the implementation of Elegant is described. The scanner generator constructs a scanner according to the techniques described in [ASU86] This scanner is a nite state machine with state transitions dictated by the current character of the input text. We do not discuss its implementation any ....
Lex Augusteijn. The Elegant compiler generator system. In P. Deransart and M. Jourdan, editors, Attribute Grammars and their Applications, Lecture Notes in Computer Science 461, pages 238-254. Springer Verlag, Berlin, 1990.
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