Loading...
Please wait, while we are loading the content...
Similar Documents
An Approach to Polyvariant Binding Time Analysis for a Stack-Based Language
| Content Provider | Semantic Scholar |
|---|---|
| Author | Klimov, Yuri A. |
| Copyright Year | 2008 |
| Abstract | Binding time analysis (BTA) is used in specialization by means of partial evaluation method. Usual BTA only annotates a source program. Polyvariant BTA transforms a source program to an annotated one. Polyvariant BTA is known technique for functional languages. In this paper polyvariant BTA for a model imperative stack-based language is presented. It is described by means of building annotated control-flow graph for a source program. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://meta2008.pereslavl.ru/accepted-papers/meta2008-KlimovYu.pdf |
| Alternate Webpage(s) | http://pat.keldysh.ru/~yura/publications/2008.07-Klimov-An_Approach_to_Polyvariant_Binding_Time_Analysis_for_a_Stack-Based_Language.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |