All compilers and many run-time systems use dynamically sized data. The size of such data is not known in advance and room for it must be found at run time. Examples inside the compiler are symbol tables, strings from the source program, ASTs, register interference graphs for graph coloring, and many others. The examples in run-time systems derive from the nature of the source language: strings, dynamically sized arrays in imperative languages, closures in functional languages, tentative unifications in logic languages, and incoming messages in distributed languages are a few that come to mind.
Keywords
- Garbage Collection
- Memory Management
- Memory Allocation
- Garbage Collector
- Free List
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.