Description:
Compiler construction, theory, etc. (Moderated)
|
|
|
help in locating old ACM conference proceedings
|
| |
Dear comp.compilers, I am looking for copies of papers from the 1963 ACM Natl. Conf., Denver, Colo. Now, obviously, I should go to the ACM digital library and get them. Unfortunately, ACM does not have a copy of these proceedings!! After mailing with them about it, it seems that they nor have a paper or... more »
|
|
|
how to deal with left recursive?
|
| |
I have found ansi c yacc grammar. A production of statement list like this statement_list : statement | statement_list statement ; is left recursive. How to elimilate left recursive in such case? Is there exist a solution for parsing such grammar using LL(k) ?
|
|
|
Placement of memory loads
|
| |
Hi, I want to figure out the best way to place initial memory loads in generated code. My current approach is very simple and inefficient. I do a liveness analysis and then insert memory loads for all undefined variables in the beginning of initial basic block. Here is an example (both x and y are global):... more »
|
|
|
Workshops
|
| |
Hi, does anyone know a website with an overview of international workshops for programming languages and real-time systems? Stephan
|
|
|
Switch statement code generation
|
| |
I'm trying to put together a list of various methods to do code generate for switch statements. This is what I have so far: * Successive if/else branches * Jump tables * branch tables with linear and binary scans * Clustering tables (e.g., if you have cases 0-100 and 300-400). Are there any other methods worth mentioning?... more »
|
|
|
Seed7 Release 2009-11-01
|
| |
Hello, I have released a new version of Seed7: seed7_05_20091101.tgz In the Seed7 programming language new statements and operators can be declared easily. Types are first class objects and therefore templates/generics need no special syntax. Object orientation is used when it brings advantages and not in places when other... more »
|
|
|
Nop insertion
|
| |
hi This is both an architecture and compiler question. Are there inorder architectures that need precise number of nops inserted between operations. If so, how does a compiler guarantee that ? I am especially thinking of producers and consumers in faraway basic blocks. Any pointers to any exiting work?... more »
|
|
|
Adding UTF8 IDENTIFIERS to Flex
|
| |
The solution is based on the GREEN portions of the first chart shown on this link: [link] UTF8_BYTE_ORDER_MARK [\xEF][\xBB][\xBF] D [0-9] ASCII [\x0-\xFF] U1 [a-zA-Z_] U2 [\xC2-\xDF][\x80-\xBF] U3 [\xE0][\xA0-\xBF][\x80-\xBF] U4 [\xE1-\xEC][\x80-\xBF][\x80-\x BF]... more »
|
|
|
|
