Description:
Compiler construction, theory, etc. (Moderated)
|
|
|
CFP: Special Issue of ACM SIGOPS OSR
|
| |
The Interaction among the OS, the Compiler, and Multicore Processors Special Issue of ACM Operating System Review [link] The interaction among operating systems, compilers, and multicore processors is becoming more tightly bound and sophisticated. The... more »
|
|
|
Software Pipelining
|
| |
Hi, Software pipelining is a technique to reorder loops to achieve more parallelism at the instruction level. I was wondering if this optimization is mainly beneficial for processors that have multiple functional units like VLIWs, or can significant performance improvements be also achieved for RISC processors with a restricted... more »
|
|
|
Native/VM languages
|
| |
While I know that it is possible for a language (such as Java) to be compiled both natively and to bytecode to be run on a VM, I have read that over time, a natively compiler Java program (AOT compiler) will be less efficient than the same JIT-compiled Java program (http:// www-128.ibm.com/developerworks /java/library/j-rtj2/index.htm l).... more »
|
|
|
My scripting language - any suggestions?
|
| |
Hi! I've been writing my own scripting language for 6 months (with some small breaks). I wrote the lexer, parser (similar to recursive descent, but extended; LL grammar) and now I'm writing the interpreter. The syntax is similar to C/C++ and the language is mostly influenced by PHP and Lua. Sample code:... more »
|
|
|
Generalized LR and error repair
|
| |
I have been looking into generalized LR and I am curious if anyone could point me in the direction of some good references for possible error repair strategies for this parsing method. Thanks in advance, Carter.
|
|
|
Optimizing simple calls in a dynamically typed language?
|
| |
I am playing around with some ideas for a compiled dynamically typed language i.e. no VM. What bugs me is that in a dynamically typed language without primitives, code that looks like this in C: int j; ... <code setting the value of j> int i = j * 5 + 3; Would usually compile to something like 2 dynamic calls, first on j... more »
|
|
|
Algorithm for computing first-k follow-k sets
|
| |
Hello, This is probably pretty elementary but I havent been able to locate a method to compute first-k follow-k sets (i.e. the k terminals derived from a symbol or following that symbol) efficiently for a grammar. Most textbooks only seem to cover the k = 1 case. Are there references out there which contain how to compute the generalization to k > 1?... more »
|
|
|
ASTs and Type Check Analysis
|
| |
I am presently involved in a compiler project in C++ that is mirroring the BASIC grammar extensively. The early stages of this project is more of a proof of concept more than diving too deeply into many extremities that will certainly prove very challenging as this project moves forward. So far I've... more »
|
|
|
Recognize valid paths
|
| |
Hi, for some static program analyses it is crucial to recognize valid paths of the control flow graph taken while executing the code. if (x < 1) x = 1; if (x > 10) x = 10; For this example code, it's obvious that a path through both then-parts of the conditions is not feasible. Such invalid combination... more »
|
|
|
Recursive Descent Parsers only with LL(1)-grammars?
|
| |
Hello NG, I'm not so familiar with compiler construction just interested in it. What appears curious is that I have heard that it is only possible to implement recursive descent parsers for LL(1)-grammars. But I imagine that it isn't a problem to look ahead more than just one symbol. So my question is why it is only possible for LL(1)-grammars?... more »
|
|
|
