Where results make sense
About us   |   Why use us?   |   Reviews   |   PR   |   Contact us  

Topic: Compile time

  Compile time - Wikipedia, the free encyclopedia
In computer science, compile time, as opposed to runtime, is the time when a compiler compiles code written in a programming language into an executable form.
Dynamic binding is typically done after compile time, either at runtime or before runtime usually by means of a program loader.
Compile time errors in a program that is normally compiled may instead be detected as runtime errors when interpreted and this makes it hard to check every single execution path without extensive debugging.
en.wikipedia.org /wiki/Compile_time   (256 words)

 Compiler - Wikipedia, the free encyclopedia
Compilers also exist which translate from one high level language to another, or sometimes to an intermediate language that still needs further processing; these are sometimes known as cascaders.
Building a self-hosting compiler is a bootstrapping problem -- the first such compiler for a language must be compiled either by a compiler written in a different language, or (as in Hart and Levin's Lisp compiler) compiled by running the compiler in an interpreter.
Compilers which are capable of producing both native and foreign binary output may be called either a cross-compiler or a native compiler depending on a specific use, although it would be more correct to classify them as a cross-compilers.
en.wikipedia.org /wiki/Compiler   (1963 words)

 Compile time   (Site not responding. Last check: 2007-10-21)
In computer science compile time is the time when a compiler compiles code written in a programming language into an executable form.
Dynamic binding is typically done after compile time before runtime usually by means of a loader.
There may instead be a interpretation (often into bytecode) followed by execution but performed by same software and not exposed to the Compile time errors in a program that normally compiled may instead be detected as errors when interpreted instead.
www.freeglossary.com /Compile_time   (596 words)

 Compile time - Freepedia   (Site not responding. Last check: 2007-10-21)
Dynamic binding is typically done after compile time, but before runtime, usually by means of a program loader.
When an interpreter is used there may be no separation between compile time and run time.
Compile time errors in a program that is normally compiled may instead be detected as runtime errors when interpreted instead.
en.freepedia.org /Compile_time.html   (245 words)

 Compile Time   (Site not responding. Last check: 2007-10-21)
Compilation time should probably not be a major factor in choosing tools, but it can really affect the speed and efficiency of the code-compile-debug cycle.
Compilation time was taken in two cases for each language; first, in the default debugging mode, which is the mode used for daily builds and testing.
For the compile time, executable size, and executable speed comparisons, programs 2a and 3a were not considered, since they were line counters for C++ and Eiffel and could have no common test data.
www.nyx.net /~vputz/psp_index/x15577.html   (488 words)

 Darren Hobbs: Compile Time Outmoded
It turns out that the lack of compile time checking is nowhere near as much of an issue as common sense wants to tell you it is. One of the reasons for this is that dynamically typed languages are usually interpreted (or pseudo-interpreted) in the sense that there is no manual compilation step.
In Java or C# the defect is already ossified in the compiled bytecode, and to fix it I have to change the source and recompile it plus everything that depends on it.
Seems to me that compile time checking is only important when you have the inconvenience of compile time in the first place.
www.darrenhobbs.com /archives/000633.html   (304 words)

 Mailgate: comp.lang.c++: Re: run-time vs compile-time   (Site not responding. Last check: 2007-10-21)
The compiler treats them all the same, allocating space for them at compile time (as an offset from the stack pointer).
The fact that at run time d is initialised to point to dynamically allocated memory is completely irrelevent.
But in any case the address of i and pi is worked out at compile time.
mailgate.supereva.it /comp/comp.lang.c++/msg214752.html   (289 words)

 Invoking Compile-Time Instantiation
When you specify an explicit instantiation, you are asking the compiler to instantiate a template at the point of the explicit instantiation in the translation unit in which it occurs.
Although time is required to analyze and design code for explicit instantiation, compilation may be faster than for the equivalent implicit instantiation.
An existing compiler defect may be more apparent, if in HP aC++ A.02.00 or A.01.04 and prior versions you built a shared library using automatic instantiation (the prior default using the assigner) and now build that library using the current default (compile-time) instantiation.
docs.hp.com /en/B3901-90019/ch05s01.html   (1446 words)

 Compile-Time Floating-Point Arithmetic   (Site not responding. Last check: 2007-10-21)
The compiler attempts to perform as much floating-point arithmetic as possible at compile time.
In specific cases, the result of a computation at compile time might differ slightly from the result that would have been calculated at run time.
For example, where a maf operation might be used at run time, separate multiply and add operations might be used at compile time, producing a slightly different result.
www.msi.umn.edu /sp/sp_manuals/cc++/doc/complink/concepts/cufltar.htm   (370 words)

 Lazy Containers: Efficient Compile-time Abstraction for Manipulating Collections of Objects Using Expression Templates
Timings are based on the output of gprof on a Pentium III.
The intent behind the laziness in Lazy Containers is to provide hints to the compiler by breaking abstraction barriers through the use of promises.
Finally, when it comes time to force a promise, all the type information encoded in the template name results in a sequence of derferencing of iterators, all of which can be inlined together.
www.media.mit.edu /%7Erahimi/lazy-containers   (1637 words)

 HI-TECH Software Forums: Tricks to reduce compile time?
Compile time of my current application is 15 seconds and it grows as proportional to the size of the application.
The compiler will have a delay when building until it is activated; this is the same for the demo.
Most of the time I have to work on an application using Visual Studio C++ and the compile time for the project is 15 minutes!
www.htsoft.com /forum/all/showflat.php/Cat/0/Number/16150/Main/16110   (533 words)

 CLHS: Glossary-Section C
The minimum semantic requirements of compilation are that it must remove all macro calls and arrange for all load time values to be resolved prior to run time.
a function form or macro form whose operator has a definition as a compiler macro, or a funcall form whose first argument is a function form whose argument is the name of a function that has a definition as a compiler macro.
a function of two arguments, a form and an environment, that implements compiler macro expansion by producing either a form to be used in place of the original argument form or else nil, indicating that the original form should not be replaced.
www.lisp.org /HyperSpec/Body/glo_c.html   (2662 words)

 Reduce compile time with distcc
Timing these over those machines tells me this takes just short of 9 seconds to compile, which is around a sixteen-times speed increase.
Compilation with distcc allows you to take advantage of nodes that are significantly quicker than your own, while still giving you applications built and optimized for your personal workstation.
This can be comparatively expensive in terms of wall-clock time for larger builds, so using distcc allows you (and everyone else) to mop up those idle CPU cycles on the network and get up and running as quickly as possible.
www-106.ibm.com /developerworks/linux/library/l-distcc.html?ca=dgr-lnxw01distccTips   (2519 words)

 flipcode - Compile-Time Assertions
Compile-time errors are preferred over run-time errors because they notify you of a problem in your code before you even run the application (before you even finish building it, for that matter.) Unfortunately, you can't just replace all of your run-time assertions with compile-time assertions.
Errors are reported during compile-time, and each brand of compiler will have different error reporting and formatting, but here's what to expect from Visual C++ 6.0.
Compile time assertions are also useful as class members.
www.flipcode.com /cgi-bin/fcarticles.cgi?show=64445   (715 words)

 Linux Magazine - For DevelopersÂ… / Compile Time   (Site not responding. Last check: 2007-10-21)
This month, we finish peeking under the hood of the compiler with a look at the last two steps in the compilation process (the process that turns your source code into something that a machine can actually execute).
However, you may (or may not) be surprised to discover that compilers for these languages deviate from the official specifications.
Linux's timing functions are relatively straightforward; however, most people overlook them until they need to use one in an application.
www.linux-mag.com /depts/compile.html   (3757 words)

 compile time   (Site not responding. Last check: 2007-10-21)
As well as the work done by the compiler, this may include macro preprocessing as done by cpp for example.
The final stage of program construction, performed by the linker, would generally also be classed as compile time but might be distinguished as link time.
For example, static data in a C program is allocated at compile time whereas non-static data is allocated at run time, probably on the stack.
www.linuxguruz.org /foldoc/foldoc.php?compile+time   (136 words)

 Compile time - Encyclopedia.WorldSearch   (Site not responding. Last check: 2007-10-21)
Time to look for compressors now; economic recovery's bound to come: frozen food companies and warehouses can always compile a shopping list in advance.
Compile-time evaluation and code generation for semantics-directed compilers
Formal definition of the PL/I compile time facilities (Technical report)
encyclopedia.worldsearch.com /compile-time.htm   (372 words)

 Compile time MOPs and open compilers   (Site not responding. Last check: 2007-10-21)
Open compilers are essentially compilers that are reified and that can be modified from within the language.
A compile time MOP is the protocol provided to the user for implementing modifications.
Despite their name, compile time MOPs do not imply in our view that everything is done prior to program execution, but rather leaves the door open to dynamic compilation.
www2.parc.com /csl/groups/sda/projects/reflection96/docs/malenfant/ref96/node13.html   (96 words)

 Compile Time Assertions in C (CVu 11.3)
Viola, a compile time assertion :-) You can use it inside and outside a function but you can't use it twice in the same function, as you end up with a duplicate definition.
It's because you have to specify the size of an array as a compile time constant.
So the last piece of the puzzle is to put the compile time assertions inside a function.
www.jaggersoft.com /pubs/CVu11_3.html   (682 words)

 Comp.compilers: Compile Time vs. Run Time
compiler in effect does internal multitasking, in that a line of code is
compile time switch to select one or the other.
This option is even *more* critical in compilers which are used at a PC and Terminal.
compilers.iecc.com /comparch/article/93-01-041   (672 words)

 The Modding Theater Forums - Reducing Compile time
The first was not changing the options on Mbuilder and it took 3days to compile, the vis taking the longest.
The VIS process is basically a giant table look-up routine with lots of file I/O. It's not terribly cpu intensive, and the algorithms don't use more than 256 meg of memory.
This determines whether or not the vis compiler derives additional vis info from the manual vis.
www.modtheater.com /forum/printthread.php?t=780   (591 words)

 Compile-time   (Site not responding. Last check: 2007-10-21)
In computer science, compile-time, as opposed to run-time, is the compiling phase in which code written in one programming language is translated into another language.
Because some information are only available for compiler and some other are only can be extracted in runtime, certain tasks can be done in compile-time and some in runtime.
Compile-time errors are those detected already during compilation, i.e.
www.portaljuice.com /compile_time.html   (186 words)

 PanelSoft User Interface and Safety Consulting
Besides the fact that many compilers recognize a zero-sized array as valid, most compilers will also produce a spurious warning on unused variables.
The expression is in braces to allow it to be used multiple times in the same block.
I (and others) have discovered that compilers are not strict enough in this area, so you can never be sure if it is going to work - regardless of what the C standard says.
www.panelsoft.com /murphyslaw/apr01.htm   (592 words)

 AngelikaLanger.com - Compile Time Computations in C++ - Angelika Langer Training/Consulting   (Site not responding. Last check: 2007-10-21)
These can be points in time like "now", expressed in seconds since 1.1.1970, but also periods of time like "5 seconds".
The time class is an admittedly trivial class, but this contrived example already shows that we create run-time overhead by adding a property, such as the precision, to the state of each object.
The more computations can be performed at compile time already, the better will the run time behaviour be.
www.langer.camelot.de /Articles/Papers/TemplateProgramming/Paper.htm   (1327 words)

 Compile Time Commands
This option makes the compiler use an external EXE packer (such as Petite or UPX) to compress the executable header.
Date and time of the last modification to the script file according to the current locale.
The compiler maintains a list of defined symbols, which can be defined using !define or the /D command line switch.
nsis.sourceforge.net /Docs/Chapter5.html   (1116 words)

 Compile Time Analysis   (Site not responding. Last check: 2007-10-21)
The purpose of compile-time analysis is to statically (e.g., by simply considering the syntax of the program) derive information that can be used to produce a better compiled code and, more in general, to improve program execution.
The issue is even more relevant when dealing with parallelism: compile-time analysis allows to increase the degree of parallelism exploited, reducing at the same time the run-time costs of performing the parallelization.
It must be observed that logic programming languages, being based on clear and well-defined mathematical semantics, allow a relatively easy development of tools capable of performing a semantically correct transformation of the program (something which is not always guaranteed in the case of procedural languages [1]).
www.cs.nmsu.edu /~epontell/adventure/node51.html   (239 words)

 Variables and Types
Each time we see a variable name, we look it up in the namelist - if it is not already there, we create a new entry for the name, and some initial value (e.g.
In fact, because of the complexity of the process of compiling and running programs written in real languages like C or Java, the location is not simply a numerical address.
Allowing recursion brings further complications, as at any one moment during run time there may be several memory locations representing different recursive instances of the same identifier.
www.cs.man.ac.uk /~pjj/cs2121/ho/node9.html   (2238 words)

 Citations: Compile-time analysis of functional programs - Hughes (ResearchIndex)   (Site not responding. Last check: 2007-10-21)
Analysis for identifying dead code, or code having similar properties, has been studied and used widely [8, 7, 25, 41, 1, 24, 21, 10, 26, 34, 54, 45, 33, 57] It is essentially backward dependence analysis that aims to compute the minimum sufficient information needed for producing certain....
....by forcing compilers to use a uniform, one size fits all representation of all data regardless of type.
Analysis for identifying dead code, or code having similar properties, has been studied and used widely [8, 7, 23, 36, 1, 22, 19, 10, 24, 31, 30, 46, 40, 49] It is essentially backward dependence analysis that aims to compute the minimum sufficient information needed for producing certain....
citeseer.ist.psu.edu /context/105349/0   (3968 words)

Try your search on: Qwika (all wikis)

  About us   |   Why use us?   |   Reviews   |   Press   |   Contact us  
Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.