User loginNavigation |
AST intermediate representationsHi, Is anyone aware of any systems which use AST intermediate representations instead of byte code? A few years ago, I read papers by Michael Franz concerning use of compressed ASTs in the Oberon system (e.g. A Tree Based Alternative to Java Byte Codes - pdf). Work on AST intermediate representations seems to have continued particularly in relation to mobile code (e.g. Towards Language-Agnostic Mobile Code - pdf). Typically the AST intermediate representation of a program is compiled at the destination on the fly (with varying degrees of optimisation depending on time constraints). I'm interested in interpreting ASTs to see what the performance of AST interpretation is like as a first step (possibly with a subset of Oz). So far I've only found one attempt at anything like this. Just wondering if LtU readers had come across any other work on AST representations and interpretation. Regards, By Christopher Campbell at 2005-05-18 20:49 | LtU Forum | previous forum topic | next forum topic | other blogs | 154018 reads
|
Browse archives
Active forum topics |
Recent comments
25 weeks 6 days ago
26 weeks 10 min ago
26 weeks 17 min ago
48 weeks 1 day ago
1 year 2 days ago
1 year 1 week ago
1 year 1 week ago
1 year 4 weeks ago
1 year 9 weeks ago
1 year 9 weeks ago