Description:
Compiler construction, theory, etc. (Moderated)
|
|
|
What happens when linking and execution?
|
| |
Let's say I have a shared library (libmyFile1.so) that contains a function myFunc1 and it is called by a application myApp1. I build and link the application.... cc -o myApp1 myApp1.o -L/usr/source/lib -lmyFile1 Question 1 ------------------ What does this linking actually do? Does it copy the location of myFunc1 within the libmyFile1.so?... more »
|
|
|
Auto vectorization
|
| |
Hi all: I am currently working on the auto-vectorization phase in the GCC. I have some points to discuss. 1-- How you define the profitability of auto-vectorization phase? Is it just the speed up? If we do not get any speed up over scalar code then there is no need to do auto-parallelization. 2--What are the phases or features in a compiler ( especially in the... more »
|
|
|
Tokenizer theory and practice
|
| |
I'm currently thinking about lexing/tokenizing binary data and Unicode, in e.g. PDF files, and possible optimizations in LL/PEG parsers. Binary data typically comes in fixed length chunks, where the parser has to provide the length and encoding of the next token. This procedure is quite different from lexing text, that's why I prefer the term... more »
|
|
|
Code selection trade-offs
|
| |
Hi, Do you know of any works where profiling information/ static program analysis is used as a heuristic to control code selection, i.e. the (profiling) execution counts of particular code structures are influencing the choice of instructions used to translate the source code into assembler? I want to leave the issue open how the execution counts are... more »
|
|
|
Code generation for load/store packed data
|
| |
Hello, I am very interested in to know how compilers generate optimized code for loading or storing data at unaligned memory locations and that located inside bitfields (i. e., like that generated by using GNU C "packed attribute" or packed ANSI C bitfield type definitions). I suppose that is a well-known subject that was solved by somebody a... more »
|
|
|
x86-64 and calling conventions
|
| |
Well, I have my own compiler, however, I don't as of yet target x86-64. one of the main reasons: the calling conventions used in Linux and friends are, scary... Short Description: arguments are passed in registers, meanwhile, others may be left on the stack, and there is no particular relation between the registers and the... more »
|
|
|
ANSI C grammar LL(k)
|
| |
Hi, is there an Ansi C grammar in LL(k) (k=1) or (k<=2)? Best regards Andre Betz
|
|
|
Introduce a C Compiler ucc
|
| |
ucc is an ANSI C Compiler. Its code size is about 15,000 lines. The lexer, parser and code generator are all hand-written. The code structure is very clear and straightforward. And there is an interesting value numbering algorithm. It also has a document explaining the internal implementation. If you are interested at this compiler, you can download it from... more »
|
|
|
Leftmost longest match with DFA search
|
| |
Can someone point me to articles that discuss various ways to get the leftmost longest match when implementing regexp search using a DFA? The "obvious" solution of turning the problem "search for RE" into the problem "match .*RE" (where I use "match" here to mean "anchored search") only gives you the leftmost shortest match.... more »
|
|
|
