|
| |
| | compiler.html |
 | | Usually the translation is from a source code (generally a high level language) to a target code (generally a low level object code or machine language) that may be directly executed by a computer or a virtual machine. | | | A compiler is a computer program that translates a computer program written in one computer language (called the source language) into a program written in another computer language (called the output or the target language). | | | However, a compiler from a low level language to a high level one is also possible; this is normally known as a decompiler if it is reconstructing a high level language which (could have) generated the low level language. |
|
http://www.informationgenius.com/encyclopedia/c/co/compiler.html
|
|
| |
| | Dead code elimination - Wikipedia, the free encyclopedia |
| | In compiler theory, dead code elimination is a compiler optimization used to reduce program size by removing code which can never be executed (known as dead or unreachable code). | | | This technique is common in debugging to optionally activate blocks of code; using an optimizer with dead code elimination eliminates the need for using a preprocessor to perform the same task. | | | Because the expression 0 will always evaluate to false, the code inside the if statement can never be executed, and dead code elimination would remove it entirely from the optimized program. |
|
http://en.wikipedia.org/wiki/Dead_code_elimination
(443 words)
|
|
| |
| | compiler theory question |
| | Its source code is the source document and its output object code is the parse tree. | | | -- First Problem: A universal compiler is defined as a machine that takes any well formed, valid source code and produces semantically correct object code for a specified machine. | | | further hypothesis: Both the universal parser instruction language and the universal compiler instruction language can be expressed using the universal language. |
|
http://pluglist.mybutt.net/pipermail/plug-discuss/2001-May/011781.html
(443 words)
|
|
| |
| | Error correction and detection - Wikipedia, the free encyclopedia |
| | Information theory tells us that whatever be the probability of error in transmission or storage, it is possible to construct error-correcting codes in which the likelihood of failure is arbitrarily low, although this requires adding increasing amounts of redundant data to the original, which might not be practical when the error probability is very high. | | | In digital telecommunications, channel coding is a pre-transmission mapping applied to a digital signal or data file, usually with an error-detection or an error-correction code. | | | Say now an error occurs in the first byte, that "001011010" is received as "101011010". |
|
http://en.wikipedia.org/wiki/Error_correcting_code
(443 words)
|
|
| |
| | Astronomy C/C++ source code |
| | Code to compute the positions of the Galilean satellites, using Lieske's theory as given in Meeus' Astronomical Algorithms. | | | Code to compute the position of the moon using the ELP-82 (Ephemerides Lunaire Parisienne 1982) theory of Chapront and Chapront-Touzé. | | | Source code for Charon: I've started the process of turning the Charon astrometry software into an open-source program. |
|
http://www.projectpluto.com/source.htm
(4318 words)
|
|
| |
| | Network Theory Ltd - Sample of 'An Introduction to GCC' |
| | To create an object file from a source file the compiler produces machine code where any references to the memory addresses of external functions and variables in other files are left undefined. | | | Some compilers will search all object files, regardless of order, but since not all compilers do this it is best to follow the convention of ordering object files from left to right. | | | Compilation refers to the process of converting a program from the textual source code in a programming language such as C or C++ into machine code, the sequence of 1's and 0's used to control the central processing unit (CPU) of the computer. |
|
http://www.network-theory.co.uk/articles/gccintro.html
(4318 words)
|
|
| |
| | C294 Coding Theory and Complexity Theory |
| | This course will be about the theory, constructions, and algorithms for error correcting codes, about applications in complexity theory and in cryptography, and about relations to other combinatorial constructions. | | | Error-correcting codes and related combinatorial constructs play an important role is several recent (and old) results in complexity theory. | | | In the third part of the course we will explore connections between error-correcting codes and the other three combinatorial objects that are ubiquitous in complexity theory: hash functions, randomness extractors and expander graphs. |
|
http://www.cs.berkeley.edu/~luca/cs294
(567 words)
|
|
| |
| | Papers by Martin Ward |
| | This paper describes the theory behind the FermaT system and describes a recent migration project in which over 544,000 lines of assembler ``sausage'' (part of a large embedded system) were transformed into efficient and maintainable structured C code. | | | In this thesis we develop a theory of program refinement and equivalence which can be used to develop practical tools for program development, analysis and modification. | | | Program transformation techniques are employed by the Maintainer's Assistant both to derive a specification from a section of code and to transform a section of code into a logically equivalent form. |
|
http://www.dur.ac.uk/martin.ward/martin/papers
(567 words)
|
|
| |
| | International Journal of Electrical Engineering Education: Comparative study of turbo codes in AWGN channel using MAP and SOVA decoding |
| | Turbo codes were introduced in 1993 by Berrou et al.2 and are perhaps the most exciting and potentially important development in coding theory in recent years. | | | A software-based project in error-control coding combines theory and design with computer simulation. | | | The concept behind turbo decoding is to pass soft information from the output of one decoder to the input of the succeeding one, and to iterate this process several times to produce better decisions. |
|
http://www.findarticles.com/p/articles/mi_qa3792/is_200104/ai_n8943875
(1460 words)
|
|
| |
| | NodeWorks - Encyclopedia: Error-correcting code |
| | In information theory and coding, an error-correcting code or ECC is a code in which each data signal conforms to specific rules of construction so that departures from this construction in the received signal can generally be automatically detected and corrected. | | | Shannon's theorem is an important theory in error correction which describes the maximum attainable efficiency of an error-correcting scheme versus the levels of noise interference expected. | | | Note 1: If the number of errors is less than or equal to the maximum correctable threshold of the code, all errors will be corrected. |
|
http://pedia.nodeworks.com/E/ER/ERR/Error-correcting_code
(1460 words)
|
|
| |
| | publications |
| | Médard, A.J. Goldsmith, "Capacity of Time-Varying Channels with Side Information at the Sender and the Receiver", Miniconference on Information Theory, ICC, 1999. | | | Ho, R. Koetter, M. Médard, D. Karger and M. Effros, "The Benefits of Coding over Routing in a Randomized Setting'', 2003 IEEE International Symposium on Information Theory. | | | D.S. Lun, M. Médard, D. Karger, “On the Dynamic Multicast Problem for Coded Networks&;, First Workshop on Network Coding, Theory, and Applications, (6 pages, proceedings pending), April 2005. |
|
http://web.mit.edu/medard/www/pubs.html
(1460 words)
|
|
| |
| | Define Pasta Theory of Programming - a Whatis.com definition - see also: Pasta Theory |
| | The first and most famous example of the theory is spaghetti code, which illustrates the unfortunate tendency of unstructured procedural programming to result in code with little or no structure, making it difficult to understand and update. | | | The Pasta Theory of programming is attributed to Raymond Rubey of SofTech Inc. In a 1992 letter to the editor of CrossTalk magazine, Rubey exhorted developers to "go beyond the condemnation of spaghetti code to the active encouragement of ravioli code." | | | The Pasta Theory of Programming is the idea that various programming structures can be likened to the structures of well-known pasta dishes. |
|
http://searchvb.techtarget.com/sDefinition/0,,sid8_gci866378,00.html
(270 words)
|
|
| |
| | The Alice and Bob After Dinner Speech |
| | The other thing coding theorists are concerned with is information. | | | So I thought it would be a good idea if I gave you a sort of instant, five minute graduate course in coding theory. | | | I would like to finish with a few words on the impact that information technology is having on our everyday lives. |
|
http://downlode.org/etext/alicebob.html
(270 words)
|
|
| |
| | COSC 4342 Compiler Theory and Automata |
| | Students should be familiar with elementary language theory, formal grammars, finite state automata, scanning, parsing, intermediate code representation, symbol tables, run-time structures, code generation and compiler construction tools. | | | Students should be able to construct the basic components of a compiler including the scanner, parser, code generator, and symbol table. | | | Students should be able identify and describe the concepts underlying the components of a compiler including a scanner, parser, and code generator. |
|
http://www.stedwards.edu/science/baker/cosc4342
(270 words)
|
|
| |
| | Compiler Design Theory CS 360 Fall 1996 |
| | Students learn that the study of theory is important in the design of complex software. | | | CS 360 (I; 3, 0; K) Principles of compiler design including lexical, syntax and semantic analysis, code optimization and code generation. | | | Also, I will assign several programming tasks to prepare you for the project. |
|
http://www.eg.bucknell.edu/~cs360/course/course.html
(270 words)
|
|
| |
| | Chracteristics of a Relational Database |
| | EXAMPLE: The code in an application that accesses data in a file-based database typically depends on the file format (e.g., the code references a 'phone number' field that is 10 characters wide, is preceded by the 'zip code' field, followed by the 'fax number' field...). | | | The relational database model is based firmly in the mathematical theory of relational algebra and calculus | | | The database schema or structure of tables and relationships (logical) can change without having to re-create the database or the applications that use it |
|
http://www.frick-cpa.com/ss7/Theory_RelationalDB.asp
(1666 words)
|
|
| |
| | The Art of Code by Maurice J. Black |
| | For the hacker, the central issues have to do with where code comes from, who owns it, who writes it, and how good it is. For the cybertheorist, there is just the impersonal, artifactual monolith: the computer... | | | Black describes how handwritten notebooks of checked code led to the subroutine, and how the stored program and high-level languages allowed software to be commodified. | | | Black continues to consider the Unix operating system code as a text that was studied and read closely; he particularly discusses John Lions's 1977 Commentary on the Unix Operating System. |
|
http://nickm.com/if/art_of_code.html
(2368 words)
|
|
| |
| | ASE98 Tutorial - Transformation Systems: Theory, Implementation, and Survey |
| | An understanding of transformation system theory and technology can provide a deep understanding of how code generation, modification, and reuse of code and other software engineering artifacts can work. | | | He has worked on or with a number of transformation systems, including REFINE (a commercial offering currently popular for reengineering), Draco (multiple domain notations and source of the term "domain analysis"), Sinapse (generation of PDE solvers for supercomputers), and IP (Microsoft Research's transformation tool). | | | Dr. Baxter is presently the principal architect of Semantic Design's transformational Design Maintenance System (DMS), a NIST Advanced Technology Program funded project to use software componentry to enhance software maintenance. |
|
http://www-dse.doc.ic.ac.uk/Events/ase/abstracts/Baxter.html
(2368 words)
|
|
| |
| | Time Code |
| | Time Code claims to be the first movie shot simultaneously on four digital cameras, all in one take. | | | Not all experiments work, and Time Code is a perfect example. | | | As a movie, Time Code probably fails, but as a technical exercise, it is far more interesting. |
|
http://www.haro-online.com/movies/time_code.html
(452 words)
|
|
| |
| | High-rate Turbo Codes: Design and Efficient Decoding |
| | Today, Turbo Codes have already abandoned the mystical reality of theory and have become an integral part of (or are being discussed for) many actual standards. | | | Turbo Codes are a class of error correcting codes introduced in 1993 by Berrou that come closer to approaching Shannon's limit than any other class of error correcting codes. | | | The high complexity of ML decoding or MAP decoding algorithm for high-rate codes requires a decoding algorithm working on the dual code, which, in turn, requires the encoder to be in systematic form. |
|
http://www.iua.upf.es/activitats/semirec/TurboCodes
(1638 words)
|
|
| |
| | Amazon.ca: Books: Turbo Codes: Principles and Applications |
| | Turbo coding principles have found widespread applications in information theory and, in part, have entered into mainstream telecommunication theory and practice. | | | The book includes new and original material on a bidirectional SOVA decoding algorithm, design of turbo codes based on the distance spectrum, design of code-matched interleavers, performance on fading channels, and a turbo trellis code modulation scheme. | | | Includes new and original material on bidirectional SOVA decoding algorithm, design of turbo codes based on the distance spectrum, design of code-matched interleavers, performance on fading channels, and a turbo trellis code modulation scheme. |
|
http://www.amazon.ca/exec/obidos/ASIN/0792378687
(480 words)
|
|
| |
| | Storer Home Page |
| | The first two chapters contain introductory material on information and coding theory. | | | This is an edited volume of papers by researchers in the field; topics include: vector quantization, fractals, optical algorithms, massively parallel hardware, and coding theory. | | | However, with on-line data compression where a sender and receiver are in lock-step maintaining constantly changing identical local memories, a single error on the communication channel or storage medium could cause the dictionaries of the encoder and decoder to differ, which in the worst case could corrupt all data to follow. |
|
http://www.cs.brandeis.edu/~storer
(480 words)
|
|
| |
| | Florida Tech, CS: Compiler Construction (Spring 2005) |
| | CSE 4250 Programming Languages, CSE 4051 Advanced Java programming, and CSE 4083 Formal Languages and Automata Theory are all helpful, but not required. | | | Introduces formal languages, the construction of scanners and recursive descent, LL(1) and LR(1) parsers, intermediate forms, symbol tables, code generation and optimization of resultant code. | | | understand the theory of scanning so that you could implement a scanner generator |
|
http://cs.fit.edu/%7Eryan/cse4251
(480 words)
|
|
| |
| | NIPS Workshop on MDL |
| | The complexity is the sum of the information and the code length for noise in analogy with the Kolmogorov sufficient statistics decomposition in the algorithmic theory of information. | | | This theory is based on two-part codes consisting of the code for the statistic (the model summarizing the regularity, the meaningful information, in the data) and the model-to-data code. | | | While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between an individual data sample and an individual model summarizing the information in the data, for example, a finite set (or probability distribution) where the data sample typically came from. |
|
http://quantrm2.psy.ohio-state.edu/injae/workshop.htm
(2674 words)
|
|
| |
| | C-history |
| | Compilers in 1977, and even well after, did not complain about usages such as assigning between integers and pointers or using objects of the wrong type to refer to structure members. | | | The B compiler on the PDP-7 did not generate machine instructions, but instead `threaded code' [Bell 72], an interpretive scheme in which the compiler's output consists of a sequence of addresses of code fragments that perform the elementary operations. | | | During the 1980s the use of the C language spread widely, and compilers became available on nearly every machine architecture and operating system; in particular it became popular as a programming tool for personal computers, both for manufacturers of commercial software for these machines, and for end-users interesting in programming. |
|
http://www.netzmafia.de/skripten/unix/chist.html
(2674 words)
|
|
| |
| | Department TAIT - Lecture Channel Coding |
| | Channel coding is heavely based on algebra and probability theory. | | | This redundancy is used by the channel decoder to correct errors in the received data or in the data read from the storage medium. | | | Code design (how to add the redundand symbols) and decoding thechniques (how to use these redundant symbols for error correction) are the two main areas in channel coding. |
|
http://tait.e-technik.uni-ulm.de/~schmidt/ccod.html
(2674 words)
|
|
| |
| | Algorithms in the Real World: Error Correcting Codes |
| | A Commonsense Approach to the Theory of Error-Correcting Codes. | | | Reed Solomon Codes explained by 4i2i a company that "designs algorithms, components and systems for the communications industry." Here is a local copy. | | | Error Correcting Codes lecture notes by Jim Carlson at the University of Utah. |
|
http://www-2.cs.cmu.edu/afs/cs.cmu.edu/project/pscico-guyb/realworld/www/errorcorrecting.html
(307 words)
|
|
| |
| | Error Spot |
| | Information theory tells us that whatever be the probability of error in transmission or storage, it is possible to construct error-correcting codes in which the likelihood of failure is arbitrarily low, although this requires adding increasing amounts of redundant data to the original, which might not be practical when the error probability is very high. | | | In digital telecommunications, channel coding is a pre-transmission mapping applied to a digital signal or data file, usually with an error-detection or an error-correction code. | | | Other block error-correcting codes, such as Reed-Solomon codes transform a chunk of bits into a (longer) chunk of bits in such a way that errors up to some threshold in each block can be detected and corrected. |
|
http://www.errorspot.com
(6354 words)
|
|
| |
| | Code Generation in Action |
| | The book first covers the theory of code generation at a practical level. | | | The author of the book, Jack Herrington, is also the editor-in-chief of the Code Generation Network (CGN). | | | It is practical book about building, using, and deploying code generators to solve real world issues. |
|
http://www.codegeneration.net/cgia
(484 words)
|
|
| |
| | Information Processing Group -- Overview |
| | The mission of the Information Processing Group is to provide leadership and expertise in information theory, coding theory, and communications systems, in line with the missions of JPL and NASA. | | | Developing and analyzing channel codes for the Deep Space Network has been a staple of the group from the beginning. | | | We are investigating a number of power efficient, spectrally efficient coded modulation schemes to solve this problem, and we are active participants in related standards organizations. |
|
http://coding.jpl.nasa.gov
(484 words)
|
|
|
