Editing Intermediate Representation
Please note that you are now editing the latest revision of this page, which is not the approved one shown by default.
Warning: You are not logged in.
Your IP address will be recorded in this page's edit history.The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
| Latest revision | Your text | ||
| Line 1: | Line 1: | ||
| − | + | In computing, an intermediate representation is a data structure that is constructed from input data to a program, and from which part or all of the output data of the program is constructed in turn. | |
| + | |||
| + | Use of the term usually implies that most of the information present in the input is retained by the intermediate representation, with further annotations or rapid lookup features. | ||
| + | |||
| + | A canonical example is found in most modern compilers, where the linear human-readable text representing a program is transformed into an intermediate graph data structure that allows flow analysis and re-arrangements before starting to create the list of actual CPU instructions that will do the work. | ||
| + | |||
| + | [[Category:Basic Concepts]] | ||
