Refimprove date August 2010 About bootstrappingcompilers the general concept Bootstrapping In computer science , bootstrapping is the process of writing a compiler or assembly language Assembler assembler in the target programming language which it is intended to compile. Applying this technique leads to a self hosting compiler. A large proportion of programming languages are bootstrapped, including BASIC , C programming language C , Pascal programming language Pascal , Factor programming language Factor , Haskell programming language Haskell , Modula 2 , Oberon programming language Oberon , OCaml , Common Lisp , Scheme programming language Scheme , Python programming language Python and more. Advantages Bootstrapping a compiler has the following advantages ref Compilers and Compiler Generators An Introduction With C . Patrick D. Terry 1997. International Thomson Computer Press. ISBN 1850322988 ref ref name terry Compiler Construction and Bootstrapping by P.D.Terry 2000. http www.oopweb.com Compilers Documents Compilers Volume cha03s.htm HTML . http webster.cs.ucr.edu AsmTools RollYourOwn CompilerBook CHAP03.PDF PDF . http cm.bell labs.com who ken trust.html HTML . ref it is a non ... DEFAULTSORT BootstrappingCompilers Category Compilers Category Compiler construction cs Bootstrapping de Bootstrapping Programmierung et Alglaadur fr Bootstrap compilateur nl Bootstrapcompiler ja pt Bootstrapping ru sr ... compiled from another architecture where there exists a compiler for X this is how compilers for C ... used this for his WEB literate programming system. Methods for distributing compilers in source ... a series of ever more sophisticated assemblers and compilers. ref http homepage.ntlworld.com edmund.grimley evans bcompiler.html Bootstrapping a simple compiler from nothing by Edmund GRIMLEY EVANS ... is undecidable. List of self hosting compilers The following languages have self hosting compilers ... more details
by using the tool they had developed to improve the tool. Compilers main Bootstrappingcompilers The development of compilers for new programming languages first developed in an existing language but then rewritten in the new language and compiled by itself, is another example of the bootstrapping ...otheruses Booting disambiguation Bootstrapping or booting refers to a group of metaphor s that share ... 0 930405 87 0 ref Thus, computer bootstrapping is a technique by which a simple computer instruction ... systems into the main memory of computers. Software bootstrapping This section is linked from Kermit protocol Bootstrapping can also refer to the development of successively more complex, faster programming ... programming language . Historically, bootstrapping also refers to early computer program development .... Bootstrapping in program development began during the 1950s when each program was constructed on paper .... This was how the early assembly program SOAP Symbolic Optimal Assembly Program was developed. Compilers, linkers, loaders, and utilities were then coded in assembly language, further continuing the bootstrapping ... installs other prerequisites for the software during the bootstrapping process. Overlay networks main Bootstrapping node A bootstrapping node, also known as a rendezvous host, ref name Francis01 cite ... sequence of events. A technique called bootstrapping the simulation model is used, which bootstraps ... its steady state the bootstrapping behavior is overwhelmed by steady state behavior. Artificial intelligence and machine learning main Bootstrap aggregating Seed AI Bootstrapping is a technique ... that the development of seed AI will rapidly yield ever smarter intelligence via bootstrapping and thus a new era. Statistics main Bootstrapping statistics Bootstrapping populations Bootstrapping ... Bootstrapping business Bootstrapping in business means starting a business without external help ... company can grow by reinvesting profits in its own growth, if its bootstrapping costs are low and return ... more details
used languages is available at http ideone.com . Ada compilers Expand list date January 2009 ... source No ALGOL compilers Expand list date December 2010 class wikitable sortable style width 95 Compiler ... Proprietary Copyright only Yes BASIC compilers Expand list date June 2011 class wikitable sortable ... Yes Yes Yes Proprietary Yes Visual Basic Microsoft Yes No Yes DOS Proprietary Yes C compilers expand ... Gnu Project yes yes no free Open source ? C compilers Expand list date March 2009 class wikitable sortable ... IAR C C Compilers IAR Systems Yes No No Proprietary Yes Interactive C http www.kipr.org KISS Institute ... AIX No Proprietary Yes Eclipse software Eclipse C compilers Expand list date August 2008 There s a link to this section from List of C compilers class wikitable sortable style width 95 Compiler Author ... , Code Blocks HP aC Hewlett Packard No Yes No Proprietary No http www.iar.com IAR C C Compilers ... Diab Compiler Wind River Diab Compiler Wind River Systems Yes Yes Yes Proprietary Yes COBOL compilers ... programming language D compilers class wikitable sortable style width 95 Compiler Author style width ... Yes Yes 32 bit Linux, Mac OS X, FreeBSD No free Open source No Common Lisp compilers class wikitable ... programming language Eiffel compilers Expand list date February 2010 class wikitable sortable ... compilers expand list date December 2011 class wikitable sortable style width 95 Compiler Author style ... No Fortran compilers Expand list date January 2009 class wikitable sortable style width 95 Compiler ... Cell and AIX Yes BlueGene Proprietary Yes Eclipse software Eclipse Haskell compilers HaskellWiki ... . Many of them are compilers. Expand list date November 2009 class wikitable sortable style width 95 ... No free Open source Yes Java programming language Java compilers class wikitable sortable style width ... software Eclipse project Yes Yes Yes unknown unknown Pascal compilers Expand list date August 2008 class ... WDSibyl Wolfgang Draxler and Speed Soft Yes No Yes OS 2 free GPL Yes PL I compilers Expand list ... more details
Refimprove date December 2009 In psycholinguistics , bootstrapping refers to the question of how language acquisition gets started. A child gradually acquires a great deal of interlocking knowledge about the structure and vocabulary of his or her language. It has sometimes been proposed that some specific type of linguistic knowledge can be acquired early, and that this enables the child to analyze words or sentences well enough to acquire further knowledge from them. Metaphorically, this early knowledge would serve as bootstrapping bootstraps by which the child pulls himself or herself up. Syntactic bootstrapping Syntactic bootstrapping proposes that syntax comes that Language acquisition children use syntactic knowledge they have developed to help learn what words mean. That is, semantics builds on top of syntax. This idea was first tested experimentally by Lila R. Gleitman Lila Gleitman 1991 . Semantic bootstrapping Semantic bootstrapping in linguistics refers to the hypothesis that children utilize innately known conceptual knowledge to create grammatical category grammatical categories when language acquisition acquiring their first language . Thus, for example, categories like type of object person maps directly onto the linguistic category noun , category like action onto verb , etc. It is proposed that this will get children started on their way to acquiring part of speech parts of speech , which later can be supplemented by other linguistic information. The hypothesis ..., year 1999, ref Prosodic bootstrapping Empty section date January 2012 Bootstrapping of compositional ... Children and Adults Semantic Bootstrapping among the Deaf and Blind References http www.ling.ed.ac.uk ... onderzoek OND1293234 Project Transmitting knowledge through the bootstrapping of compositional language . Reflist DEFAULTSORT Semantic Bootstrapping Category Language acquisition linguistics stub de Bootstrapping Syntaktik ... more details
Refimprove date July 2007 Otheruses Bootstrapping The bootstrapping rule in the rules of evidence dealt with admissibility as non hearsay of statements of conspiracy in United States federal courts . The rule was, in a criminal prosecution for conspiracy crime conspiracy , the court, in deciding whether to allow the jury to consider a statement of conspiracy, cannot hear the statement itself, and that the allegation should be supported by independent evidence. If the independent evidence convinced the court that a conspiracy probably existed, only then could such a statement be introduced into trial and heard by the jury. Allowing such statements of conspiracy to prove the existence of conspiracy was considered similar to bootstrapping. In the United States, the bootstrapping rule has been eliminated from the Federal Rules of Evidence , as decided by the Supreme Court of the United States Supreme Court in the Bourjaily case. ref Bourjaily v. United States , 483 U.S. 171 1987 . ref For example, say a man commits four crimes. Unless the evidence is connectable to each crime, each piece of evidence can be used only in each separate crime and not to link each crime to the other. In law, bootstrapping can also refer to an attempt to gain jurisdiction over a non jurisdictional matter through its circuitous relationship to a jurisdictional matter. References references Category Evidence law law term stub ... more details
Unreferenced date December 2009 Orphan date December 2009 The idea of bootstrapping is significant in a number of fields in the biology biological sciences . The process by which a fertilised ovum develops into an embryo , particularly the way in which the nuclear genome is expressed differently in its various cells as these differentiate, is one example of bootstrapping. The evolution of progressively better adapted Organ anatomy organs through natural selection in a lineage of organism s is another. Some biologists, including Graham Cairns Smith , believe that the origin of life itself may have been a bootstrap process as one or more systems of biological information storage formed the foundation for successor systems that ultimately supplanted them culminating in the emergence of our current DNA based system. See also embryology ontogeny and phylogeny RNA World DEFAULTSORT Bootstrapping Biology Category Embryology ... more details
A bootstrapping node , also known as a rendezvous host, ref name Francis01 cite journal title Yoid Extending the Internet Multicast Architecture publisher www.aciri.org author Francis, Paul date 2000 04 02 url http www.cs.cornell.edu people francis yoidArch.pdf accessdate 2008 12 24 ref is a Node networking node in an overlay network that provides initial configuration information to newly joining nodes so that they may successfully join the overlay network. ref name sun01 cite web url http www.google.com patents?id 6cF3AAAAEBAJ title US Patent 7,065,579 accessdate 2008 12 23 author Traversat et al. date 2006 06 20 ref ref name Saxena01 cite journal title Admission Control in Peer to Peer Design and Performance Evaluation publisher In ACM Workshop on Security of Ad Hoc and Sensor Networks SASN 2003 author Saxena et al. year 2003 url http www.ics.uci.edu gts paps sty03.pdf accessdate 2008 12 24 ref Bootstrapping nodes are predominantly found in decentralized peer to peer P2P networks because of the dynamically changing identities and configurations of member nodes in these networks. Overview .... ref name sun01 Identifying a bootstrapping node A newly joining node may identify which nodes are bootstrapping nodes by using multiple different ways. New nodes may be pre configured at creation with IP address Static and dynamic IP addresses static addresses of the bootstrapping nodes. ref name sun01 In such a case, the bootstrapping node addresses can not change, and therefore ... System DNS service, where a domain name resolves to one of the bootstrapping nodes addresses. ref name ... sylvia cans.pdf accessdate 2008 12 23 ref This allows the bootstrapping nodes addresses to change ... The objective of the bootstrapping node is to provide newly joining nodes with sufficient configuration ... protocols or admission policies. ref name Saxena01 Networks that utilize bootstrapping nodes ... Chord project Chord References reflist See also Bootstrapping Network topology DEFAULTSORT Bootstrapping ... more details
Context date October 2009 Bootstrapping is a method for constructing a Zero coupon bond zero coupon fixed income yield curve from the prices of a set of coupon bearing products by forward substitution . Using these zero coupon products it becomes possible to derive par swap rates forward and spot for all maturities by making a few assumptions including linear interpolation . The term structure of spot returns is recovered from the bond yields by solving for them recursively, this iterative process is called the Bootstrap Method . Given that, in general, we lack data points in a yield curve there are only a fixed number of products in the market and more importantly these have varying coupon frequencies, it makes sense to construct a curve of zero coupon instruments from which we can price any yield, whether forward or spot, without the need of more external information. A generic algorithm is described below for more detail see Yield curve Construction of the full yield curve from market data Yield curve Construction of the full yield curve from market data . blockquote style background 1 border 1px solid black padding 1em General Methodology Define set of yielding products, these will generally be coupon bearing bonds Derive discount factors for all terms, these are the internal rates of return of the bonds Bootstrap the zero coupon curve step by step. For each stage of the iterative process, we are interested in deriving the n year zero coupon bond yield, also known as the internal rate of return of the zero coupon bond. As there are no intermediate payments on this bond, all the interest and principal is realised at the end of n years it is sometimes called the n year spot rate. To derive this rate we observe that the theoretical price of a bond can be calculated as the present ... http www.investopedia.com terms b bootstrapping.asp Bootstrapping , investopedia .com Tools http janroman.dhis.org ... Organizations FinanceClub resources BootstrappingMath.xls Bootstrapping Step By Step , bus.umich.edu ... more details
No footnotes article date March 2009 In statistics , bootstrapping is a computer based method for assigning measures of accuracy to sample estimates Bradley Efron Efron and Robert Tibshirani Tibshirani 1993 . This technique allows estimation of the sample distribution of almost any statistic using only ... class of Resampling statistics resampling methods. Bootstrapping is the practice of estimating ... the stability of the results. Disadvantages Although bootstrapping is under some conditions asymptotically ... The basic idea of bootstrapping is that the sample we have collected is often the best guess we ... population using the obtained sample as a basis. Situations where Bootstrapping procedures are useful ... distribution of a statistic of interest is complicated or unknown. Since the bootstrapping procedure ... distribution is well known, bootstrapping provides a way to account for the distortions caused by the specific ... of the variation of the statistic is to use a small pilot sample and perform bootstrapping ... to inference for the same model. Resampling residuals Another approach to bootstrapping in regression ... process regression bootstrap When data are temporally correlated, straightforward bootstrapping ... that often improve the performance of bootstrapped estimators the bootstrapping of a maximum likelihood ... index.php?title Bootstrapping statistics &action edit§ion 22k data Data from examples in Bayesian ... sample statistic by something similar to bootstrapping taking the average of the statistic over all ... process regression bootstrapping Exploring the effects of uncertainty in time course data journal Bioinformatics ... perspective http animation.yihui.name dmml bootstrap i.i.d Animations for bootstrapping i.i.d ... resampling.html bootstrapping tutorial http cran.r project.org package animation package animation ... Resampling statistics de Bootstrapping Statistik es Bootstrapping estad stica fa fr Bootstrap statistiques it Metodo bootstrap ja pl Bootstrap statystyka pt Bootstrapping ... more details
power supplies Newnes, 2005 ISBN 0750674458, page 121 ref Output swing AC amplifiers can use bootstrapping ... 0521592925 pages 190 191 ref See also Booting of a computer Bootstrapping generally Black start of a electric ... de Bootstrapping Elektrotechnik ... more details
Infobox Book name Compilers Principles, Techniques, and Tools title orig translator image Image purple dragon book b.jpg 200px image caption The cover of the second edition North American , showing a knight and dragon author Alfred V. Aho , Monica S. Lam , Ravi Sethi , and Jeffrey D. Ullman illustrator cover artist country language English language English series subject genre publisher Pearson Education, Inc pub date 1986, 2006 english pub date media type pages isbn ISBN 0 201 10088 6, ISBN 0 321 48681 1 dewey 005.4 53 19 congress QA76.76.C65 A37 1986 oclc 12285707 preceded by followed by Compilers Principles, Techniques, and Tools ref Aho, Sethi, Ullman, Compilers Principles, Techniques, and Tools , Addison Wesley, 1986. ISBN 0 201 10088 6 ref is a famous computer science textbook by Alfred V. Aho , Monica S. Lam , Ravi Sethi , and Jeffrey D. Ullman about compiler construction . Although more than two decades have passed since the publication of the first edition, it is widely regarded as the classic definitive compiler technology text. ref cite web url http grokcode.com 11 the top 9 in a hackers bookshelf title The Top 9 1 2 Books in a Hacker s Bookshelf accessdate 2010 10 23 ref It is affectionately known as the Dragon Book to a generation of computer scientists ref name MartelliRavenscroft2005 cite book author1 Alex Martelli author2 Anna Martelli Ravenscroft author3 David Ascher title Python cookbook url http books.google.com books?id 1Shx VXS6ioC&pg PT623 accessdate 21 October 2011 year 2005 publisher O Reilly Media, Inc. isbn 978 0 596 00797 3 page 587 ref ref name Stephenson2005 ... to Errata http wps.aw.com aw aho compilers 2 0,11227,2663889 ,00.html Sample chapters from the second ... Compiler construction Category Computer science books ar es Compilers Principles, Techniques, and Tools fr Dragon book hr Compilers Principles, Techniques, and Tools ru , vi Compilers Principles, Techniques, and Tools ... more details
Image BSF.png thumb right BSF Positioning A Bootstrapping Server Function BSF is an intermediary element in Cellular network s which provides application independent functions for mutual authentication of user equipment and servers unknown to each other and for bootstrapping the exchange of secret session keys afterwards. This allows the use of additional services like Mobile TV and Public Key Infrastructure PKI , which need authentication and secured communication. GBA GAA Setup The setup and function to deploy a generic security relation as described is called Generic Bootstrapping Architecture Generic Bootstrapping Architecture GBA or Generic Authentication Architecture GAA . In short, it consists of the following elements. user equipment UE , e. g. a mobile cellular telephone needs access to a specific service application server NAF Network Application Function , e. g. for mobile TV provides the service BSF Bootstrapping Server Function arranges security relation between UE and NAF mobile network operator s Home Subscriber Server HSS hosts user profiles. In this case, the term bootstrapping is related to building a security relation with a previously unknown device first and to allow installing security elements keys in the device and the BSF afterwards. Workflow The BSF is introduced by the application server NAF , after an unknown UE device is trying to get service access the NAF refers the UE to the BSF. UE and BSF mutually authenticate via 3GPP protocol AKA Authentication and Key Agreement additionally, the BSF sends related queries to the Home Subscriber Server HSS . Afterwards, UE and BSF agree on a session key to be used for encrypted data exchange with the application ... Standards GAA Generic Authentication Architecture and GBA Generic Bootstrapping Architecture , and 3GPP ... commercial BSF supplier Category Mobile telecommunications standards de Bootstrapping Server Function nl Bootstrapping Server Function ... more details
In mobile phones, Generic Bootstrapping Architecture GBA is one technology enabling the authentication of a user. This authentication is possible if the user owns a valid identity on an HLR GSM core network Home location register .28HLR.29 Home Location Register or a Home Subscriber Server GBA is standardized at the 3GPP http www.3gpp.org ftp Specs html info 33220.htm . The user authentication is instantiated by a shared secret, one in the smartcard inside the mobile phone and the other is on the HLR HSS. GBA authenticates by making a network component challenge the simcard card and verify that the answer is similar by the one predicted by the HLR HSS. Instead of asking the service provider to trust the Bootstrapping Server Function BSF and relying on it for every authentication request, the Bootstrapping Server Function BSF establishes a shared secret between the simcard card and the service provider. This shared secret is limited in time and for a specific domain. Image GBA.JPG Strong points This solution has some strong points of certificate and shared secrets without having some of their weaknesses There is no need for user enrollment phase nor secure deployment of keys, making this solution a very low cost one when compared to PKI. Another advantage is the ease with which the authentication method may be integrated into terminals and service providers, as it is based on HTTP s well known Digest access authentication . Every Web server already implement HTTP digest authentication and the effort to implement GBA on top of digest authentication is minimal. For example it could be implemented on SimpleSAMLPhP http rnd.feide.no simplesamlphp with 500 PHP lines of code and only a few tens of lines of code are Service Provider specific making it really easy to port it to another ... can then be used between the client and services that the customer wants to use. This is called bootstrapping ... and Bootstrapping function server BSF mutually authenticate themselves during the Ub number 2 ... more details
File T diagram.png thumb Tombstone diagram representing an Ada programming language Ada compiler written in C programming language C that produces machine code . File Bootstrapping t diagram.png thumb Representation of the process of bootstrapping compilers bootstrapping a C compiler written in C, by compiling it using another compiler written in machine code. Tombstone diagrams or T diagrams consist of a set of puzzle pieces representing languages of language processors and programs. They are used to illustrate and reason about transformations from a source language A to a target language B realised in an implementation language I . They are most commonly found Where date July 2011 describing complicated processes for Bootstrapping compilers bootstrapping ref T diagrams were first introduced for describing bootstrapping and cross compiling compilers in McKeeman et al. A Compiler Generator 1971 . Conway described the broader concept before that with his UNCOL in 1958, to which Bratman added in 1961 H. Bratman, An alternate form of the UNCOL diagram , Comm. ACM 4 March 1961 3, p. 142. Later on, others, including P.D. Terry, gave an explanation and usage of T diagrams in their textbooks on the topic of compiler construction. Cf. Terry, 1997, http scifac.ru.ac.za compilers cha03g.htm Chapter 3 . T diagrams are also now used to describe client server interconnectivity on the World Wide Web cf. Patrick Closhen, et al. 1997 http www.pu.informatik.tu darmstadt.de docs HJH 19990217 etal T diagrams.doc T Diagrams as Visual Language to Illustrate WWW Technology , Darmstadt University of Technology, Darmstadt, Germany ref , porting , and Self hosting self compiling of compilers, interpreters, and General purpose macro processor macro processors . See also Bootstrapping compilers References Reflist Comp sci stub Category Compilers Category Compiler construction Category Computer programming Category Self hosting software ... more details
S algol is a computer programming language derivative of ALGOL 60 developed at the University of St. Andrews in 1979 by Ron Morrison . The language was developed as his PhD thesis as a modification of ALGOL to contain orthogonal datatypes. Ron Morrison would go on to become professor at the university and head of the department of computer science . The S algol language was used for teaching at the university at an undergraduate level until 1999. It was also the language taught for several years in the 1980s at a local school in St. Andrews, Madras College . The computer science text Recursive descent compiling ref cite book last Davie first Antony J. T. coauthors Ronald Morrison editor Brian Meek title Recursive descent compiling series Ellis Horwood series in computers and their applications year 1981 publisher Ellis Horwood location Chichester, West Sussex isbn 0 470 27270 8 ref describes a recursive descent parser recursive descent compiler for S algol, using S algol as the implementation language see bootstrapping compilers bootstrapping . PS Algol is a persistent derivative of S algol. It was developed around 1981 at the Universities of University of Edinburgh Edinburgh and University of St Andrews St Andrews . It supports database capability by providing for longevity of data in the form of a persistent heap that survives termination of PS Algol programs. It is considered Citation needed date May 2008 to be the first programming language to support orthogonal persistence . Sure about this? Didn t Lisp Smalltalk provide image based persistence long before? See also Napier88 External links http www.cs.st andrews.ac.uk files publications Mor79a.php The thesis defining the language http www.dcs.gla.ac.uk wpc reports compilers compilerindex t1.html AEN8 Persistent S algol References reflist Category ALGOL 60 dialects prog lang stub ... more details
Merge to O code date September 2010 The O code machine is a virtual machine that was developed by Martin Richards computer scientist Martin Richards in the late 1960s to give machine independence to BCPL , the low level forerunner to C programming language C and C . The concept behind the O Code machine was to create O code output O stands for Object through the BCPL compiler. The O code was then either interpreted or, more normally, compiled to machine specific code. This idea was used in later compilers, such as p code machine p code for some Pascal programming language Pascal compilers and the Java virtual machine JVM code for Java programming language Java compilers. O code allowed Richards to separate general compilation issues from machine specific implementation issues when writing the BCPL compiler. Its use in the BCPL compiler made the compiler easy to port and as a result BCPL quickly became available for many machines. See also BCPL O code References The Portability of the BCPL Compiler , Martin Richards, Software Practice and Experience, Vol. 1, No. 2, pp. 135 146, 1971 BCPL the language and its compiler , M. Richards and C. Whitby Strevens, Cambridge University Press, Cambridge, 1980 External links http www.cl.cam.ac.uk users mr bcplman.pdf The BCPL Cintcode System and Cintpos User Guide by Martin Richards 672KB pdf format http www.gtoal.com languages bcpl amiga bcpl booting.txt Bootstrapping the BCPL Compiler using INTCODE definitive document explaining the history of OCODE and INTCODE, by Martin Richards. DEFAULTSORT O Code Machine Category Systems programming languages Category Virtual machines ... more details
VAX LISP was an implementation of Common Lisp for OpenVMS VMS and ULTRIX on 32 bit VAX s. It was the first Common Lisp to be written for non Lisp machine s ref pg 72 294 of Gabriel 1985 ref . It was initially Bootstrapping compilers boot strapped from Carnegie Mellon University s Spice Lisp by recompiling its output but for VAX machine instruction and to use the large VAX stack . Some of the original developers came from CMU. Features included dumb terminal IDE with Emacs like editor programming in Common Lisp DECwindows X11 based workstation IDE with editor, debugger, and inspector multi threading based on POSIX threads a compiler that generated intermediate files which could be fast loaded a patented mechanism for writing and reading the executable state of the entire virtual machine During the development of the never released V4.0 the product was sold off to Lucid Inc. References reflist cite book last Gabriel first Richard P. title Performance and evaluation of Lisp systems publisher MIT Press Computer Systems Series url http www.dreamsongs.com NewFiles Timrep.pdf date May 1985 isbn 0 262 07093 6 LCCN 85 15161 xiv, 285 p. 23 cm. Cambridge, Mass. Common Lisp Category Common Lisp implementations compu prog stub ... more details
Data transformation A transformation language is a computer language designed to transform some input text in a certain formal language into a modified output text that meets some specific goal. Program transformation systems such as Stratego XT , TXL programming language TXL , DMS Software Reengineering Toolkit DMS , and ASF SDF Meta Environment ASF SDF all have transformation languages as a major component. The transformation languages for these systems are driven by declarative descriptions of the structure of the input text typically a grammar , allowing them to be applied to wide variety of formal languages and documents. Macro computer science Macro languages are a kind of transformation languages to transform a meta language into specific higher programming language like Java programming language Java , C , Fortran In the model driven engineering technical space, there are model transformation language s MTLs , that take as input models conforming to a given metamodel and produce as output models conforming to a different metamodel. An example of such a language is the QVT Object Management Group OMG standard. There are also low level languages such as the Lx family ref http lx.mii.lu.lv ref implemented by the Bootstrapping compilers bootstrapping method . The L0 language may be considered as assembler for transformation languages. There is also a high level graphical language built on upon Lx called MOLA. ref http mola.mii.lu.lv ref There are a number of XML transformation language s. These include XSLT , XQuery , Streaming Transformations for XML STX , FXT , XDuce , CDuce , HaXml , XMLambda , and FleXML . See also Concepts data conversion data element data mapping data migration data transformation metadata model transformation Program refinement refinement contrast valign top Languages and typical transforms ATLAS Transformation Language ATL AWK tabular data transforms Identity transform QVT TXL programming language TXL general XQuery XML XSLT ... more details
in rare cases, Machine code machine language or can be produced using Bootstrappingcompilersbootstrapping . Programming languages which have been self hosted include Ada programming language ... programming language Vala . Citation needed date April 2011 See also Bootstrappingcompilers Cross compiler ... more details
Metacompilers are a subset of a specialized class of compiler writing tools called compiler compiler s. The feature that sets a metacompiler apart from a standard compiler compiler is that a metacompiler is written in its own language and translates itself. Metacompilers are not only useful for generating parser s and code generator s, they are also useful for generating a wide range of other software engineering and analysis tools. ref Neighbors, J.M. http www.bayfronttechnologies.com l02draco.htm diss80 Software Construction using Components . Technical Report 160, Department of Information and Computer Sciences, University of California, Irvine, 1980. ref Besides being useful for parsing domain specific language s, a metacompiler is itself a prime example of a domain specific language, designed for the domain of compiler writing. A metacompiler is defined by a set of Formal grammar grammar Production computer science productions defining itself, written in its own specialized language. The metacompiler translates this grammar definition into the executable form of itself. Usually the grammar reduction rules are intermixed with semantic translation rules. Defining itself and translating itself this way constitutes the meta step that sets a metacompiler apart from other compiler compilers. Since the metacompiler defines and translates itself, the question arises as to how it is initially created a chicken and egg problem . This is solved in one of two ways by cross compiling or by Bootstrapping compilers bootstrapping . Cross compiling involves translating the new metacompiler using some other compiler or metacompiler running on some other platform. This is similar to how you make more sourdough starter . Bootstrapping, the other method, is an elegant and usually mind bending process whereby the metacompiler is defined in progressively sophisticated stages and bootstraps itself. The first version of the metacompiler translation is executed by hand. That is, the pro ... more details
Refimprove date April 2010 Seed AI is a hypothesized type of Strong AI strong artificial intelligence capable of recursive self improvement. Having improved itself it would become better at improving itself, potentially leading to an exponential increase in intelligence. No such AI is known to exist, but it remains an active field of research. Seed AI is a significant part of some theories about the technological singularity proponents believe that the development of seed AI will rapidly yield ever smarter intelligence via Bootstrapping computing bootstrapping and thus a new era. Compilers A limited example is that program language compiler s are often used to compile themselves. As compilers become more compiler optimization optimized , they can re compile themselves and so be faster at compiling. However, they cannot then produce faster code and so this can only provide a very limited one step self improvement. Existing optimizers can transform code into a functionally equivalent, more efficient form, but cannot identify the intent of an algorithm and rewrite it for more effective results . The optimized version of a given compiler may compile faster, but it cannot compile better . That is, an optimized version of a compiler will never spot new optimization tricks that earlier versions failed to see or innovate new ways of improving its own program. Seed AI must be able to understand the purpose behind the various elements of its design, and design entirely new modules that will make it genuinely more intelligent and more effective in fulfilling its purpose. Organizations Creating seed AI is the goal of several organizations. The Singularity Institute for Artificial Intelligence is the most prominent of those explicitly working to create seed AI. Others include the Artificial General Intelligence Research Institute , creator of the Novamente AI engine, Adaptive Artificial Intelligence Incorporated , Texai.org , and Consolidated Robotics . See also Evolutionary pro ... more details
C have been popular choices for implementation language. Building a self hosting compiler is a bootstrappingcompilersbootstrapping problem the first such compiler for a language must be compiled ... were first introduced for describing bootstrapping and cross compiling compilers in McKeeman ... , Darmstadt University of Technology, Darmstadt, Germany ref in the formal description of the bootstrappingcompilersbootstrapping problem Compilation Compilers enabled the development of programs ... compilers were developed. The first compiler was written by Grace Hopper , in 1952, for the A 0 ... at the time, and on IBM s early compilers team led by John Backus at IBM is generally credited as having ... people 199706 msg00011.html title IP The World s First COBOL Compilers date 12 June 1997 publisher ... complexity of computer architectures, compilers have become more and more complex. Early compilers were written in assembly language. The first self hosting compiler &mdash capable ... by running the compiler in an Interpreter computing interpreter . Compilers in education Compiler ... compilers cha03g.htm Chapter 3 . T diagrams are also now used to describe client server interconnectivity ... the target program is generated, the user can execute the program. Structure of a compiler Compilers ... techniques are well developed. Compiler output One classification of compilers is by the platform ... to run on a different platform. Cross compilers are often used when developing software for embedded ... that produced it. For this reason such compilers are not usually classified as native or cross compilers. The lower level language that is target of a compiler may itself be a high level ... the existence of BASIC compilers and C interpreters. Modern trends toward just in time compilation and bytecode bytecode interpretation at times blur the traditional categorizations of compilers and interpreters .... Hardware compilation The output of some compilers may target hardware at a very low level, for example ... more details
Encyclopedia
top
