Relevant bibliographies by topics / Meta-compiler

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Meta-compiler'

Author: Grafiati
Published: 22 February 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Meta-compiler.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Meta-compiler"

1

Izawa, Yusuke, Hidehiko Masuhara, Carl Friedrich Bolz-Tereick, and Youyou Cong. "Threaded Code Generation with a Meta-Tracing JIT Compiler." Journal of Object Technology 21, no. 2 (2022): 2:1. http://dx.doi.org/10.5381/jot.2022.21.2.a1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

DIAZ, DANIEL, SALVADOR ABREU, and PHILIPPE CODOGNET. "On the implementation ofGNU Prolog." Theory and Practice of Logic Programming 12, no. 1-2 (2011): 253–82. http://dx.doi.org/10.1017/s1471068411000470.

Full text
Abstract:
AbstractGNU Prologis a general-purpose implementation of the Prolog language, which distinguishes itself from most other systems by being, above all else, a native-code compiler which produces stand-alone executables which do not rely on any bytecode emulator or meta-interpreter. Other aspects which stand out include the explicit organization of the Prolog system as a multipass compiler, where intermediate representations are materialized, in Unix compiler tradition.GNU Prologalso includes an extensible and high-performance finite-domain constraint solver, integrated with the Prolog language but implemented using independent lower-level mechanisms. This paper discusses the main issues involved in designing and implementingGNU Prolog: requirements, system organization, performance, and portability issues as well as its position with respect to other Prolog system implementations and the ISO standardization initiative.
APA, Harvard, Vancouver, ISO, and other styles
3

Ferreira, Elisabete, Rogério Paulo, Cruz da, and Pedro Henriques. "Integration of the ST language in a model-based engineering environment for control systems: An approach for compiler implementation." Computer Science and Information Systems 5, no. 2 (2008): 87–101. http://dx.doi.org/10.2298/csis0802087f.

Full text
Abstract:
In the context of the INTEGRA project, compilation and code generation features for behavior definition are to be integrated in an existing model-based engineering environment for control systems. The devised compiler architecture is domain-specific and provides support for multiple input languages and multiple target platforms. In this paper we discuss an architectural approach in which the compiling process is organized in two different stages: the compiling stage and the linking stage. The compiling stage generates target independent code from possibly multiple input languages. The linking stage assembles precompiled code modules and generates a target specific executable code for a given virtual machine. To be more specific this paper describes the integration of the ST language in the tool core meta-model and the ST compiler is presented as an application case study. .
APA, Harvard, Vancouver, ISO, and other styles
4

Filimonov, Daniil, Andrey Svetlov, Oksana Gorban, and Marina Kosova. "Automation of Archival Documents Meta Tagging." Mathematical Physics and Computer Simulation, no. 4 (February 2021): 56–68. http://dx.doi.org/10.15688/mpcm.jvolsu.2020.4.6.

Full text
Abstract:
The main goal of this project is to create a corpus of documents from the «Mikhailovsky stanichny ataman» archival fund. The methods of corpus linguistics seem to be the most optimal in this case, since they involve the processing of a large number of texts in order to solve a wide variety of linguistic problems. Our group joined the team of philologists to provide the technical and software part of the project. The main task for us is to create a document corpus engine, that is, software that solves the tasks of storing a database of marked-up texts, executing queries to this database, and also providing users with a convenient interface for work that does not require special qualifications in the field of information technology. However, it is necessary to prepare documents for inclusion in the corpus: all texts must undergo special markup. There are many types of markup, and in the previous publications [6; 9] our group has already described the solution to the problem of morphological tagging. This article is about meta tagging. Meta tagging refers to the assignment of certain descriptive attributes to text. In the case of office documents, these are such parameters as the type of document (genre), author (compiler), addressee, date and place of creation. Meta tagging is necessary for the implementation of the corpus search features, so that the researchers can receive text samples with specified external parameters: for example, texts of a certain type, created at a certain period, addressed to a certain addressee, etc. The archives of the «Mikhailovsky stanichny ataman» fund mainly contain documents from the Chanceries of the Don Army from the mid-18th to the first third of the 19th century, that’s why there are not so many varieties of these documents. Moreover, these are mostly official documents, and they were written up according to certain templates, forms, the parameters of which can be relatively easily extracted from documents through preliminary analysis. This work is also carried out by the team of philologists from VolSU under the guidance of Professor O.A. Gorban. The result of their systematization of documents was the description of special speech markers of genre parameters for all document types in the archive. Thus, in our case, there is no need for heavy methods of statistical analysis or machine learning, it is enough to search for certain markers in the document. Moreover, the main marker in all reviewed documents is a direct indication of their type. Other markers are auxiliary elements of meta tagging. The paper is devoted to the description of the created application for determining the type of a document and its meta tagging by searching the text for certain regular expressions derived from the markers.
APA, Harvard, Vancouver, ISO, and other styles
5

HERMENEGILDO, M. V., F. BUENO, M. CARRO, et al. "An overview of Ciao and its design philosophy." Theory and Practice of Logic Programming 12, no. 1-2 (2011): 219–52. http://dx.doi.org/10.1017/s1471068411000457.

Full text
Abstract:
AbstractWe provide an overall description of the Ciao multiparadigm programming system emphasizing some of the novel aspects and motivations behind its design and implementation. An important aspect of Ciao is that, in addition to supporting logic programming (and, in particular, Prolog), it provides the programmer with a large number of useful features from different programming paradigms and styles and that the use of each of these features (including those of Prolog) can be turned on and off at will for each program module. Thus, a given module may be using, e.g., higher order functions and constraints, while another module may be using assignment, predicates, Prolog meta-programming, and concurrency. Furthermore, the language is designed to be extensible in a simple and modular way. Another important aspect of Ciao is its programming environment, which provides a powerful preprocessor (with an associated assertion language) capable of statically finding non-trivial bugs, verifying that programs comply with specifications, and performing many types of optimizations (including automatic parallelization). Such optimizations produce code that is highly competitive with other dynamic languages or, with the (experimental) optimizing compiler, even that of static languages, all while retaining the flexibility and interactive development of a dynamic language. This compilation architecture supports modularity and separate compilation throughout. The environment also includes a powerful autodocumenter and a unit testing framework, both closely integrated with the assertion system. The paper provides an informal overview of the language and program development environment. It aims at illustrating the design philosophy rather than at being exhaustive, which would be impossible in a single journal paper, pointing instead to previous Ciao literature.
APA, Harvard, Vancouver, ISO, and other styles
6

Ahuja, Sachin. "Mobile-cloud Cross Development (McX)." International Journal of Business & Technology 1, no. 2 (2013): 54–61. http://dx.doi.org/10.33107/ijbte.2013.1.2.06.

Full text
Abstract:
There is a multitude of Mobile Operating Systems (MOSs) with iOS, Android, Windows Phone and, BlackBerry leading the space. New players continue to enter the market. Without a de-facto leader in this space, it has become necessary for businesses & developers to target multiple devices & MOSs in order to establish a relevant presence within their target audience. Cross-platform Mobile Development Tools (XMTs) were born out of this need to reduce developer effort in creating mobile applications by providing “write once run anywhere” (WORA) functionality. However, most of these tools sacrifice performance, features or maintainability in order to provide WORA functionality. Furthermore, these tools only attempt to manage the user interface and related client-side functionality. Most mobile applications need to follow the same principals that guide development of non-mobile web or desktop apps. Typical apps are deployed using an n-tier, cloud-based strategy with substantial functionality delegated to cloud resources. Given the above, there are two parts of an application’s anatomy that don’t get much attention – the cloud middleware functionality, and the database/model management features. In this paper I address these problems through creation of a Mobile-cloud Cross Development (McX) tool-chain that includes a type-safe meta-programming language, an integrated cloud node and, an active compiler. In order to effectively understand the problem with the current state of the art, I use 3 of the leading XMTs alongside the developed McX tool-chain and compare the effectiveness of each. The paper further introduces the language; it’s grammar and semantic structure, and provides discussions on how this approach fits the future of cross-platform, cloud-integrated mobile application development along with the associated issues and areas for further research.
APA, Harvard, Vancouver, ISO, and other styles
7

Beevi, Nadera, M. Reghu, D. Chitraprasad, and S. Vinodchandra. "MetaJC++: A flexible and automatic program transformation technique using meta framework." Open Engineering 4, no. 3 (2014). http://dx.doi.org/10.2478/s13531-013-0161-2.

Full text
Abstract:
AbstractCompiler is a tool to translate abstract code containing natural language terms to machine code. Meta compilers are available to compile more than one languages. We have developed a meta framework intends to combine two dissimilar programming languages, namely C++ and Java to provide a flexible object oriented programming platform for the user. Suitable constructs from both the languages have been combined, thereby forming a new and stronger Meta-Language. The framework is developed using the compiler writing tools, Flex and Yacc to design the front end of the compiler. The lexer and parser have been developed to accommodate the complete keyword set and syntax set of both the languages. Two intermediate representations have been used in between the translation of the source program to machine code. Abstract Syntax Tree has been used as a high level intermediate representation that preserves the hierarchical properties of the source program. A new machine-independent stack-based byte-code has also been devised to act as a low level intermediate representation. The byte-code is essentially organised into an output class file that can be used to produce an interpreted output. The results especially in the spheres of providing C++ concepts in Java have given an insight regarding the potential strong features of the resultant meta-language.
APA, Harvard, Vancouver, ISO, and other styles
8

Kadam, Sandeep U., Sagar B. Shinde, Yogesh B. Gurav, Sunil B. Dambhare, and Chaitali R. Shewale. "A Novel Prediction Model for Compiler Optimization with Hybrid Meta-Heuristic Optimization Algorithm." International Journal of Advanced Computer Science and Applications 13, no. 10 (2022). http://dx.doi.org/10.14569/ijacsa.2022.0131068.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Brabrand, Claus, and Michael I. Schwartzbach. "Growing Languages with Metamorphic Syntax Macros." BRICS Report Series 7, no. 24 (2000). http://dx.doi.org/10.7146/brics.v7i24.20151.

Full text
Abstract:
"From now on, a main goal in designing a language should be to plan for growth."<br />Guy Steele: Growing a Language, OOPSLA'98 invited talk.<br />We present our experiences with a syntax macro language augmented with a concept of metamorphisms. We claim this forms a general abstraction mechanism for<br />growing (domain-specific) extensions of programming languages.<br />Our syntax macros are similar to previous work in that the compiler accepts collections of grammatical rules that extend the syntax in which a subsequent program may be written. We exhibit how almost arbitrary extensions can be defined in a purely declarative manner without resorting to compile-time programming. The macros are<br />thus terminating in that parsing is guaranteed to terminate, hygienic since full-conversion eliminates the risk of name clashes, and transparent such that subsequent phases in the compiler are unaware of them. Error messages from later phases in the compiler are tracked through all macro invocations to pinpoint their sources in the extended syntax. A concept of metamorphic rules allows the arguments of a macro to be defined<br />in an almost arbitrary meta level grammar and then to be morphed into the host language. We show through examples how creative use of metamorphic syntax macros may be used not only to create convenient shorthand notation but also to introduce new<br />language concepts and mechanisms. In fact, whole new languages can be created at surprisingly low cost. The resulting programs are significantly easier to understand and maintain.<br />This work is fully implemented as part of the <bigwig> system for defining<br />interactive Web services, but could find use in many other languages.
APA, Harvard, Vancouver, ISO, and other styles
10

Ager, Mads Sig, Dariusz Biernacki, Olivier Danvy, and Jan Midtgaard. "From Interpreter to Compiler and Virtual Machine: A Functional Derivation." BRICS Report Series 10, no. 14 (2003). http://dx.doi.org/10.7146/brics.v10i14.21784.

Full text
Abstract:
We show how to derive a compiler and a virtual machine from a compositional interpreter. We first illustrate the derivation with two evaluation functions and two normalization functions. We obtain Krivine's machine, Felleisen et al.'s CEK machine, and a generalization of these machines performing strong normalization, which is new. We observe that several existing compilers and virtual machines--e.g., the Categorical Abstract Machine (CAM), Schmidt's VEC machine, and Leroy's Zinc abstract machine--are already in derived form and we present the corresponding interpreter for the CAM and the VEC machine. We also consider Hannan and Miller's CLS machine and Landin's SECD machine.<br /> <br />We derived Krivine's machine via a call-by-name CPS transformation and the CEK machine via a call-by-value CPS transformation. These two derivations hold both for an evaluation function and for a normalization function. They provide a non-trivial illustration of Reynolds's warning about the evaluation order of a meta-language.
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Meta-compiler"

1

Di, Giacomo Francesco <1985&gt. "Metacasanova : a high-performance meta-compiler for domain-specific languages." Doctoral thesis, Università Ca' Foscari Venezia, 2018. http://hdl.handle.net/10579/15565.

Full text
Abstract:
Programming languages are at the foundation of computer science, as they provide abstractions that allow the expression of the logic of a program independent from the underlying hardware architecture. In particular scenarios, it can be convenient to employ Domain-Specific Languages, which are capable of providing an even higher level of abstraction to solve problems which are common in specific domains. Examples of such domains are database programming, text editing, 3D graphics, and game development. The use of a domain-specific language for the development of particular classes of software may drastically increase the development speed and the maintainability of the code, in comparison with the use of a general-purpose programming language. While the idea of having a domain-specific language for a particular domain may be appealing, implementing such a language tends to come at a heavy cost: as it is common to all programming languages, domain-specific languages require a compiler which translates their programs into executable code. Implementing a compiler tends to be an expensive and time-consuming task, which may very well be a burden which overshadows the advantages of having a domain-specific language. To ease the process of developing compilers, a special class of compilers called ``meta-compilers'' has been created. Meta-compilers have the advantage of requiring only the definition of a language in order to generate executable code for a program written in that language, thus skipping the arduous task of writing a hard-coded compiler for the new language. A disadvantage of meta-compilers is that they tend to generate slow executables, so they are usually only employed for rapid prototyping of a new language. The main aim of this thesis is to create a meta-compiler which does not suffer from the disadvantage of inefficiency. It presents a meta-compiler called ``Metacasanova'', which eases the development cost of a compiler while simultaneously generating efficient executable code. The thesis starts by analysing the recurring patterns of implementing a compiler, to define a series of requirements for Metacasanova. It then explains the architecture of the meta-compiler and provides examples of its usage by implementing a small imperative language called C--, followed by the reimplementation of a particular, existing domain-specific language, namely Casanova, which has been created for use in game development. The thesis presents a novel way to optimize the performance of generated code by means of functors; it demonstrates the effect of this optimization by comparing the efficiency of Casanova code generated with and without it. Finally, the thesis demonstrates the advantages of having a meta-compiler like Metacasanova, by using Metacasanova to extend the semantics of Casanova to allow the definition of multiplayer online games.
APA, Harvard, Vancouver, ISO, and other styles
2

Narayanamurthy, Nithya. "Finding resilience-friendly compiler optimizations using meta-heuristic search techniques." Thesis, University of British Columbia, 2015. http://hdl.handle.net/2429/54951.

Full text
Abstract:
With the projected increase in hardware error rates in the future, software needs to be resilient to hardware faults. An important factor affecting a program's error resilience is the set of optimizations used when compiling it. Compiler optimizations typically optimize for performance or space, and rarely for error resilience. However, prior work has found that applying optimizations injudiciously can lower the program's error resilience as they often eliminate redundancy in the program. In this work, we propose automated techniques to find the set of compiler optimizations that can boost performance without degrading its overall resilience. Due to the large size of the search space, we use search heuristic algorithms to efficiently explore the space and find an optimal sequence of optimizations for a given program. We find that the resulting optimization sequences have significantly higher error resilience than the standard optimization levels (i.e., O1, O2, O3), while attaining comparable performance improvements with the optimizations levels. We also find that the resulting sequences reduce the overall vulnerability of the applications compared to the standard optimization levels.<br>Applied Science, Faculty of<br>Electrical and Computer Engineering, Department of<br>Graduate
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Meta-compiler"

1

Haß, Manfred. "Development and application of a META IV compiler." In VDM '87 VDM — A Formal Method at Work. Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-17654-3_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gjøsæter, Terje, and Andreas Prinz. "Teaching Computer Language Handling - From Compiler Theory to Meta-modelling." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-18023-1_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Debray, Saumya K. "Compiler optimizations for low-level redundancy elimination: An application of meta-level prolog primitives." In Meta-Programming in Logic. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-56282-6_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Huang, Ruochen, Hidehiko Masuhara, and Tomoyuki Aotani. "Improving Sequential Performance of Erlang Based on a Meta-tracing Just-In-Time Compiler." In Lecture Notes in Computer Science. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-14805-8_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Meta-compiler"

1

Di Giacomo, Francesco, Mohamed Abbadi, Agostino Cortesi, Pieter Spronck, and Giuseppe Maggiore. "Metacasanova: an optimized meta-compiler for domain-specific languages." In SPLASH '17: Conference on Systems, Programming, Languages, and Applications: Software for Humanity. ACM, 2017. http://dx.doi.org/10.1145/3136014.3136015.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Narayanamurthy, Nithya, Karthik Pattabiraman, and Matei Ripeanu. "Finding Resilience-Friendly Compiler Optimizations Using Meta-Heuristic Search Techniques." In 2016 12th European Dependable Computing Conference (EDCC). IEEE, 2016. http://dx.doi.org/10.1109/edcc.2016.26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Izawa, Yusuke, and Hidehiko Masuhara. "Amalgamating different JIT compilations in a meta-tracing JIT compiler framework." In SPLASH '20: Conference on Systems, Programming, Languages, and Applications, Software for Humanity. ACM, 2020. http://dx.doi.org/10.1145/3426422.3426977.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Izawa, Yusuke, Hidehiko Masuhara, and Tomoyuki Aotani. "Extending a meta-tracing compiler to mix method and tracing compilation." In the 3rd International Companion Conference. ACM Press, 2019. http://dx.doi.org/10.1145/3328433.3328439.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Xydis, Sotirios, Gianluca Palermo, Vittorio Zaccaria, and Cristina Silvano. "A Meta-Model Assisted Coprocessor Synthesis Framework for Compiler/Architecture Parameters Customization." In Design Automation and Test in Europe. IEEE Conference Publications, 2013. http://dx.doi.org/10.7873/date.2013.143.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Shen, Yanyi, Hongli Chen, Tao Ding, Tianyi Liu, and Junjie Tang. "Development and Application of a Real-Time Visualization and Simulation Platform Based on the Generic Platform Interface ICoCo and the Qt Framework." In 2022 29th International Conference on Nuclear Engineering. American Society of Mechanical Engineers, 2022. http://dx.doi.org/10.1115/icone29-91644.

Full text
Abstract:
Abstract It is of necessity and importance for the development of a real-time visualization and simulation platform for the lead-cooled fast reactor in order to provide a better learning and research platform for technicians. In this research, a visualization platform for the primary loop system of medium-sized modular lead-cooled fast reactor M2LFR-1000 has been developed based on Generic Platform Interface ICoCo and Qt framework, relying on the system code Relap5. The simulation code used in the visualization platform is first wrapped by the generic platform interface ICoCo (Interface for Code Coupling) and then compiled to a shared library. A multithreading C++ script is developed as the supervisor, which supervises the system code Relap5 and realizes the control of real-time simulation. The graphical man-machine interface of the platform is developed by a set of UI elements provided by Qt Widgets Module. The communication between simulation code and GUI is performed with the signals and slots mechanism, which requires a Qt’s C++ extension developed as the meta-object compiler (moc). Via the actual operation by the visualization and simulation platform, the results verify that the platform can realize the real-time simulation and control of the primary loop system of M2LFR-1000 and provide a practical means of real-time monitoring and regulation of reactor operations for technicians.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography