P. Lee and U. Pleban, "A Realistic Compiler Generator Based on High-Level Semantics", in Proceedings of the ACM Symposium on Principles of Programming Languages, pp. 284--295, 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....be tuned in order to suggest elegant and efficient implementations. ffl It could be used as input to a compiler generator. A relatively outdated survey on semanticsdriven compiler construction is given in [Gaud81] whereas experimental systems for this purpose include SIS [Moss76, Bodw82] MESS [Lee87, Pleb88], PSP [Paul82] CERES [Jone80] Actress [Brow92] Cantor [Pals92] DML [Pett92] A more recent approach, based on the use of monads, is described in [Lian95a, Lian96] 1.3.2 Methodology The present specification for the semantics of C can be best understood as part of an abstract inter ....

P. Lee and U. Pleban, "A Realistic Compiler Generator Based on High-Level Semantics", in Proceedings of the ACM Symposium on Principles of Programming Languages, pp. 284--295, 1987.

....code, as in Paulson s compiler generator [19] No distinction was made between static and dynamic semantics in the language specification, though a compile time beta reducer could signal static errors before execution time. Lee and Pleban have taken a somewhat different approach in MESS [12] [13] [20] They factor the semantic specification into two parts, a macrosemantics, which makes no reference to the run time model (e.g. details such as whether stores or continuations are used) and a microsemantics, which supplies this model. The static semantics are captured entirely in the ....

Peter Lee and Uwe Pleban. A realistic compiler generator based on high-level semantics: Another progress report. In Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 284-- 295, 1987.

....A number of compiler generators have been built that produce compilers of a quality that compare well with commercially available compilers. Major examples are the CAT system of Schmidt and Voller [55, 56] the compiler generator of Kelsey and Hudak [21] and the Mess system of Pleban and Lee [47, 23, 49, 22]. These approaches are based on rather ad hoc notations for defining languages, and they lack correctness proofs, like the classical systems. They indicate, however, that better performance of the produced compiler is obtained when: ffl Some model details are omitted from a language definition; ....

Peter Lee and Uwe F. Pleban. A realistic compiler generator based on highlevel semantics. In Fourteenth Symposium on Principles of Programming Languages, pages 284--295, 1987.

....This system, however, produced compilers which generated code for the untyped calculus, leaving considerable (unproven) compilation still to be done before it could be executed on a realistic processor. 3.3. 2 MESS A more realistic compiler generator is the MESS system, due to Pleban and Lee[54, 55], which is capable of generating compilers for realistically sized imperative programming languages targeted at standard architectures. Languages are specified in high level semantics [56] They claim the core of their generator is verifiable with respect to the semantics of the input language, ....

Uwe F. Pleban and Peter Lee. A realistic compiler generator based on high-level semantics. In Proceedings of the 14th annual SIGACT/SIGPLAN Conference on Principles of Programming Languages, pages 284--295, Munich, West Germany, January 1987.

....A number of compiler generators have been built that produce compilers of a quality that compare well with commercially available compilers. Major examples are the CAT system of Schmidt and Voller [38, 39] the compiler generator of Kelsey and Hudak [10] and the Mess system of Pleban and Lee [33, 12, 35, 11]. These approaches are based on rather ad hoc specification languages, and, like the classical systems, they lack correctness proofs. The CAT system is aimed at generating compilers for Pascal, C, Basic, Fortran, and Cobol. The specification language, called CAT, is a simplification of the union ....

Peter Lee and Uwe F. Pleban. A realistic compiler generator based on high-level semantics. In Fourteenth Symposium on Principles of Programming Languages, pages 284--295, 1987.

....on formal language definitions. Some well known compiler generator examples (based on denotational semantics) are Mosses Semantics Implementation System (SIS) Mos79] or Wand s [Wan84] and Paulson s [Pau82] prototyping systems. More recent support systems for language descriptions are, e.g. LP87, Tof90, Ber91, BMW92, Mic93] Systems aiming at the generation of integrated environments are the earlier mentioned PSG system [BS86] and the Synthesizer Generator [RT89] as well as the Gandalf system [HN86] the Pan language based system [BGV92] or the Eli system dealing with executable ....

P. Lee and U. Pleban. A realistic compiler generator based on high-level semantics. In Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 284--295. ACM, 1987.

....can convert the AST back into FSAL source code when the AST is modified and the FSAL specification correspond to the AST is subject to recompiling. The compiler of FSAL, which consists of a macro semantic analyzer and a micro semantic analyzer [13] uses the technique of high level semantics [3] to describe the semantics of FSAL. The high level semantics separates the model independent macro semantics (static semantic) from model dependent micro semantics (dynamic semantics) of FSAL explicitly. FSAL source code is analyzed by the macro semantic analyzer, FSAL COMP, and transformed into ....

P. Lee, and U. Pleban. "A Realistic Compiler Generator Based on High-Level Semantics", Ergo Report 00-057 The University of michign, 1988

....in SML [Mas91] Compared to these, the techniques used in this paper offers a greater explanation of the denotational semantics technique and a better partitioning of the semantic values into domains. There is work in separating the concerns of the compiletime system from the run time system [LP87]. This makes compilers derived from a semantic specification much more efficient. The clear separation between the domains in this paper makes it amenable to this type of optimization. 9 Conclusions We wrap up the paper with a discussion of what was learned and a discussion of possible ....

Peter Lee and Uwe Pleban. A realistic compiler generator based on high-level semantics: Another progress report. In Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, Munich, pages 284--295. ACM, January 1987.

.... writing systems: ELI [GHLaWMW92] MUG2 [Wil81, GG82] HLP84 [KNPS88] and Rie Jun [Sas90] Moreover, based on the observation that compiling a program amounts to emitting a representation of its meaning as object code, a rich set of semantics directed compiler generation tools are reported: Mess [LP87, Lee89] Ceres [Tof90] PERLUETTE [Gau80] and [Mos76, Mos80, Pau82, NN86, CJ83, JS80, HM90] We have added system Z1 (a program analyzer generator) to this collection. Z1 is distinguished from other similar tools [TH92, Sas90, KNPS88, GG82, Wil81] in three ways. First, system Z1 is based on the ....

Peter Lee and Uwe Pleban. A realistic compiler generator based on highlevel semantics. In Proceedings of the Annual ACM Symposium on Principles of Programming Languages, pages 284--295, 1987. BIBLIOGRAPHY 164

.... [ Mosses, 1990] and the textbooks [ Tennent, 1991; Gunter, 1992 ] 172 Some recent key papers are [Felty and Miller, 1988; Harper et al. 1987; Huet and Lang, 1978; Hannan and Miller, 1988b; Hannan and Miller, 1988a; Howe, 1988; Harper et al. 1989; Huet, 1986; Knoblock and Constable, 1986; Lee and Pleban, 1987; Paulson, 1987; Pfenning, 1989; Pfenning and Rohwedder, 1991; Weber, 1991 ] 173 The notion that a formula determines a process that uniformly delineates subsets of structures is implicit already in early formalizations of Set Theory, for instance in Frege s Comprehension Principle and, in ....

P. Lee and U. F. Pleban. A realistic compiler generator based on high-level semantics. In Proceedings of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 284--295. ACM Press, New York, 1987.

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