检索结果-内蒙古大学图书馆

Modular language implementation in Rascal - experience report

SCIENCE OF COMPUTER PROGRAMMING 2015年第Pt.3期114卷 7-19页

作者： Basten, Bas van den Bos, Jeroen Hills, Mark Klint, Paul Lankamp, Arnold Lisser, Bert van der Ploeg, Atze van der Storm, Tijs Vinju, Jurgen Ctr Wiskunde & Informat Amsterdam Netherlands Chalmers Univ Technol S-41296 Gothenburg Sweden INRIA Lille Nord Europe Lille France E Carolina Univ Greenville NC 27858 USA Xebia Hilversum Netherlands Netherlands Forens Inst The Hague Netherlands

All software evolves, and programming languages and programming language tools are no exception. And just like in ordinary software construction, modular implementations can help ease the process of changing a language implementation and its dependent tools. However, the syntactic and semantic dependencies between language features make this a challenging problem. In this paper we detail how programming languages can be implemented in a modular fashion using the RASCAL meta-programming language. RASCAL supports extensible definition of concrete syntax, abstract syntax and operations on concrete and abstract syntax trees like matching, traversal and transformation. As a result, new language features can be added without having to change existing code. As a case study, we detail our solution of the LDTA'11 Tool Challenge: a modular implementation of OBERON-0, a relatively simple imperative programming language. The approach we sketch can be applied equally well to the implementation of domain-specific languages. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Language engineering Language workbench Meta-programming Modularity compiler generators

来源：评论

学校读者我要写书评

暂无评论

A self-applicable online partial evaluator for recursive flowchart languages

引用

SOFTWARE-PRACTICE & EXPERIENCE 2012年第6期42卷 649-673页

作者： Gluck, Robert Univ Copenhagen Dept Comp Sci DIKU DK-2100 Copenhagen Denmark

This paper describes a self-applicable online partial evaluator for a flowchart language with recursive calls. Self-application of the partial evaluator yields generating extensions that are as efficient as those reported in the literature for offline partial evaluation. This result is remarkable because it has been assumed that online partial evaluation techniques unavoidably lead to inefficient and overgeneralized generating extensions. The purpose of this paper is not to determine which kind of partial evaluation is better, but to show how the problem can be solved by recursive polyvariant specialization. The design of the self-applicable online partial evaluator is based on a number of known techniques, but by combining them in a new way this result can be produced. The partial evaluator, its techniques, and its implementation are presented in full. Self-application according to all three Futamura projections is demonstrated. The complete bootstrap of a compiler generator from a partial evaluator is also reported. Copyright (c) 2011 John Wiley & Sons, Ltd.

关键词： partial evaluation self-application Futamura projections Ershov generating extensions compiler generators bootstrapping

来源：评论

学校读者我要写书评

暂无评论

Distributed Shared Memory Based on Offloading to Cluster Network

Distributed Shared Memory Based on Offloading to Cluster Net...

引用

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)

作者： Wada, Koichi Kawaguchi, Shinsuke Ono, Masaaki Yonezawa, Naoki Univ Tsukuba Dept Comp Sci 1-1-1 Tennodai Tsukuba Ibaraki 3058573 Japan Kanagawa Univ Dept Informat & Comp Sci Kanagawa Japan

ISBN: (纸本)9781457702518

Distributed shared memory (DSM) is an important technology that provides programmers the underlying execution mechanism for shared memory programs. To improve the performance of DSM, recent studies have been carried out with introducing compiler assistance. The compiler generates codes for dependency analysis and communication. This paper proposes high-performance DSM, called Offloaded-DSM, in which the processes of dependency analysis and communication are offloaded to the cluster network. In Offloaded-DSM, the host machine can concentrate on computation of an application itself, while the network maintains coherency in parallel. Through the results of preliminary evaluation, Offloaded-DSM reduces execution time up to 32% in eight nodes and exhibits good scalability.

关键词： Arrays Field programmable gate arrays Libraries Nickel Runtime library Switches Synchronization cluster network offloading compiler assistance compiler code generation compiler generators dependency analysis distributed shared memory distributed shared me

来源：评论

学校读者我要写书评

暂无评论

AspectLISA: An Aspect-oriented compiler Construction System Based on Attribute Grammars

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2006年第2期164卷 37-53页

作者： Rebernak, Damijan Mernik, Marjan Henriques, Pedro Rangel Varanda Pereira, Maria Joao Univ Maribor Fac Elect Engn & Comp Sci Smetanova Ul 17 Maribor 2000 Slovenia Univ Minho Dept Comp Sci Campus Gualtar P-4710057 Braga Portugal

The use of object-oriented techniques and concepts, like encapsulation and inheritance, greatly improves language specifications towards better modularity, reusability and extensibility. Additional improvements can be achieved with aspect-oriented techniques since semantic aspects also crosscut many language constructs. Indeed, aspect-oriented constructs have been already added to some language specifications. The LISA compiler construction system follows an object-oriented approach and has already implemented mechanisms for inheritance, modularity and extensibility. Adding aspects to LISA will lead to more reusable language specifications. In the paper, aspect-oriented attribute grammars are introduced, and the underlying ideas are incorporated into AspectLISA, an aspect-oriented compiler generator based on attribute grammars.

关键词： Attribute grammars aspect-oriented programming compiler generators

来源：评论

学校读者我要写书评

暂无评论

Using cornpiler-generated approximate critical path information to prioritise instructions for value prediction

引用

IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES 2004年第5期151卷 321-331页

作者： Zhao, Q Lilja, DJ Sun Microsyst Inc Menlo Pk CA USA Univ Minnesota Dept Elect & Comp Engn Minneapolis MN 55455 USA Univ Minnesota Minnesota Supercomp Inst Minneapolis MN 55455 USA

One of the potential difficulties in developing cost-effective value prediction mechanisms is determining which instructions should be selected for prediction when the hardware resources are limited. The authors examine a compiler algorithm that statically assigns priorities to instructions using approximate critical path information to identify the best candidates for value prediction. This static priority information is encoded into the instructions and subsequently used by the hardware to choose the most critical instructions at run-time for value prediction. The algorithm is implemented in the GCC compiler and performance potential is evaluated using an extended version of the SimpleScalar processor simulator. Our results with the SPEC95 and SPEC2000 benchmark programs show that this approximate algorithm can effectively capture the critical path information to consistently improve the performance of a processor with a hybrid value predictor compared to using no information about the criticality of instructions. Furthermore, it is shown that using only four priority levels encoded into two instruction bits is sufficient to capture enough priority information to effectively use the value prediction hardware.

关键词： hybrid value predictor compiler generators compiler-generated critical path information compilers, interpreters and other processors static priority assignment Parallel architecture program control structures SPEC95 benchmark instruction sets GCC compiler instruction prioritisation SimpleScalar processor simulator SPEC2000 benchmark approximate critical path information Performance evaluation and testing parallel architectures performance evaluation value prediction

来源：评论

学校读者我要写书评

暂无评论

Natural semantics as a static program analysis framework

引用

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS 2004年第3期26卷 510-577页

作者： Glesner, S Zimmermann, W Univ Karlsruhe Inst Programmstrukturen & Datenorg D-76128 Karlsruhe Germany Univ Halle Wittenberg Inst Informat D-06099 Halle An Der Saale Germany

Natural semantics specifications have become mainstream in the formal specification of programming language semantics during the last 10 years. In this article, we set up sorted natural semantics as a specification framework which is able to express static semantic information of programming languages declaratively in a uniform way and allows one at the same time to generate corresponding analyses. Such static semantic information comprises context-sensitive properties which are checked in the semantic analysis phase of compilers as well as further static program analyses such as, for example, classical data and control flow analyses or type and effect systems. The latter require fixed-point analyses to determine their solutions. We show that, given a sorted natural semantics specification, we can generate the corresponding analysis. Therefore, we classify the solution of such an analysis by the notion of a proof tree. We show that a proof tree can be computed by solving an equivalent residuation problem. In case of the semantic analysis, this solution can be found by a basic algorithm. We show that its efficiency can be enhanced using solution strategies. We also demonstrate our prototype implementation of the basic algorithm which proves its applicability in practical situations. With the results of this article, we have established natural semantics as a framework which closes the gap between declarative and operational specification methods for static semantic properties as well as between specification frameworks for the semantic analysis. In particular, we show that natural semantics is expressive enough to define fixed-point program analyses.

关键词： languages natural semantics static program analysis semantic analysis fixed-point program analyses constraint solving compiler generators

来源：评论

学校读者我要写书评

暂无评论

Design space exploration for DSP applications using the ASIP development system PEAS-III

Design space exploration for DSP applications using the ASIP...

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Kobayashi, S Mita, K Takeuchi, Y Imai, M Osaka Univ Grad Sch Engn Sci Dept Informat & Math Sci Osaka Japan

ISBN: (纸本)0780374029

This paper describes rapid design space exploration for DSP applications using the PEAS-III system, which is a configurable processor development environment for application domain specific embedded systems. First, a compiler generation method, which is one of the key technologies in the PEAS-III system, is proposed. The target compiler is generated from the same information as used for the synthesizable HDL generation of the target processor. Using the PEAS-III system, not only the processor HDL description but also its target compiler are generated. Therefore, execution time which is computed from execution cycles of applications and generated processor's frequency can be rapidly evaluated. Experimental results showed that the trade-offs between area and performance of processors for DCT and FIR filter applications were analyzed in 4.1 hours and the optimal processor was selected under the design constraint by using generated compilers and processors.

关键词： digital signal processing chips embedded systems compiler generators hardware description languages discrete cosine transforms FIR filters integrated circuit layout digital integrated circuits high level synthesis application specific integrated circuits electronic design automation design space exploration DSP applications application specific instruction set processors ASIP application specific integrated processor PEAS-III configurable processor development environment embedded systems compiler generation method synthesisable HDL generation DCT FIR filter

来源：评论

学校读者我要写书评

暂无评论

Graph rewrite systems for program optimization

引用

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS 2000年第4期22卷 583-637页

作者： Assmann, U Univ Karlsruhe Inst Programmstrukturen & Datenorg D-76128 Karlsruhe Germany

Graph rewrite systems can be used to specify and generate program optimizations. For termination of the systems several rule-based criteria are developed, defining exhaustive graph reunite systems. For nondeterministic systems stratification is introduced which automatically selects single normal forms. To illustrate hew far the methodology reaches, parts of the lazy code motion optimization are specified. The resulting graph rewrite system classes can be evaluated by a uniform algorithm, which forms the basis for the optimizer generator OPTIMIX. With this tool several optimizer components have been generated, and some numbers on their speed are presented.

关键词： algorithms languages performance theory graph rewrite systems compiler generators program analysis program optimization program transformation specification stratification very high-level languages visual programming

来源：评论

学校读者我要写书评

暂无评论

MDL: A Language And compiler For Dynamic Program Instrumentation 97

MDL: A Language And Compiler For Dynamic Program Instrumenta...

引用

Proceedings of the 1997 International Conference on Parallel Architectures and Compilation Techniques

作者： J. K. Hollingsworth O. Niam B. P. Miller Zhichen Xu M. J. R. Goncalves Ling Zheng

ISBN: (纸本)9780818680908

We use a form of dynamic code generation, called dynamic instrumentation, to collect data about the execution of an application program. Dynamic instrumentation allows us to instrument running programs to collect performance and other types of information. The instrumentation code is generated incrementally and can be inserted and removed at any time. Our instrumentation currently runs on the SPARC, PA-RISC, Power 2, Alpha, and x86 architectures. Specification of what data to collect are written in a specialized language called the Metric Description Language, that is part of the Paradyn Parallel Performance Tools. This language allows platform independent descriptions of how to collect performance data. It also provides a concise way to specify, how to constrain performance data to particular resources such as modules, procedures, nodes, files, or message channels (or combinations of these resources). We also describe the details of how we weave instrumentation into a running program.

关键词： procedures platform independent descriptions instrumentation code dynamic code generation files Paradyn Parallel Performance Tools Alpha architecture running programs MDL modules x86 architecture message channels SPARC Power 2 architecture Metric Description Language PA-RISC performance data nodes dynamic program instrumentation application program compiler generators

来源：评论

学校读者我要写书评

暂无评论

An introduction to partial evaluation

引用

ACM COMPUTING SURVEYS 1996年第3期28卷 480-503页

作者： Jones, ND Univ. of Copenhagen Copenhagen East Denmark

Partial evaluation provides a unifying paradigm for a broad spectrum of work in program optimization, compiling, interpretation and the generation of automatic program generators [Bjorner et al. 1987;Ershov 1992;and Jones et al. 1993]. It is a program optimization technique, perhaps better called program specialization, closely related to but different from Jorring and Scherlis' staging transformations [1986]. It emphasizes, in comparison with Burstall and Darlington [1977] and Jorring and Scherlis [1986] and other program transformation work, full automation and the generation of program generators as well as transforming single programs. Much partial evaluation work to date has concerned automatic compiler generation hom an interpretive definition of a programming language, but it also has important applications to scientific computing, logic programming, metaprogramming, and expert systems;some pointers are given later.

关键词： compilers compiler generators interpreters partial evaluation program specialization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：