Description:
Different computer languages not specifically listed.
|
|
|
Message trees can be fast
|
| |
It's been said that interpreting a message tree will likely be much slower than interpreting bytecode. While developing Impulse, I wanted to see how far I could push message trees, and recent optimization have proven fruitful. In this microbenchmark (I know, I know), it takes under 5 seconds to iterate... more »
|
|
|
Final CfP, Ada-Europe 2010 EXTENDED submission deadline Nov 23
|
| |
Considering the requests of several potential contributors, and to give all authors the same opportunity of further refining their submission, the Conference and Program Chairs decided that the submission deadline for regular papers, tutorials and workshops will be extended by 1 week until Monday, November 23, 2009.... more »
|
|
|
Pratt-parser
|
| |
Is anyone here familiar with Vaughn Pratt's concept of "Top Down Operator Precedence" (1973) or Pratt-parsers? I'd like to know more about the technique. Unfortunately, the articles below are programming language heavy. Apparently, Pratt-parsers are recursive descent parsers modified by top down operator precedence. It seems that this dramatically reduces the code size.... more »
|
|
|
beyond 'switch limit', IDL's...
|
| |
well, I will start out by acknowledging that the prior thread was not all useless, as I did get a rather useful idea from the thread. in particular, the idea had been suggested of using function pointers in place of a switch-based dispatch. I was able to use this strategy along with my prior strategy along with my prior strategy to essentially eliminate... more »
|
|
|
|
