comp.compilers Google Group

Final CfP, Ada-Europe 2010 EXTENDED submission deadline Nov 23

dirk.craeyn...@cs.kuleuven.be (Dirk Craeynest) — Mon, 11 Nov 2009 00:54:59 UT

------------------------------ ------------------------------ -----------
FINAL Call for Papers
EXTENDED DEADLINE
15th International Conference on
Reliable Software Technologies - Ada-Europe 2010
14 - 18 June 2010, Valencia, Spain

Compiler enthusiast SC09 Meetup - Portland, OR Nov 17th

cbergst...@pathscale.com (C. Bergström) — Sun, 11 Nov 2009 18:42:48 UT

Hi all!
Join me and others in the compiler industry this year to meet and share
ideas. If you're going to SC (SuperComputing) it's the perfect chance
to talk about how exascale computing will affect our industry and or
just share cool research you've been working on. Please RSVP at the
link below or if you're interested in giving a short talk email me direct.

Compiler positions available for week ending November 8

compil...@iecc.com (comp.compilers) — Sun, 11 Nov 2009 08:59:39 UT

This is a digest of ``help wanted'' and ``position available'' messages
received at comp.compilers during the preceding week. Messages must
advertise a position having something to do with compilers and must also
conform to the guidelines periodically posted in misc.jobs.offered.
Positions that remain open may be re-advertised once a month. To respond

Re: Switch statement code generation

nathan.mccau...@gmail.com (nathan.mccauley@gmail.com) — Sun, 11 Nov 2009 04:52:09 UT

Has anyone seen tries used for the string-based switch statements?

Re: how to deal with left recursive?

drdiettri...@aol.com (Hans-Peter Diettrich) — Fri, 11 Nov 2009 23:25:44 UT

vincent Feng schrieb:
statement_list
: statement
| statement statement_list
;
or shorter EBNF:
statement_list
: statement [ statement_list ]
;
or
statement_list
: statement { statement }
;
The C language is essentially LL(1), with one or two LL(2) cases.

Re: how to deal with left recursive?

kkylh...@gmail.com (Kaz Kylheku) — Fri, 11 Nov 2009 21:28:00 UT

Since there are no semantic actions attached to the above grammar which depend
on order, you can just make it right recursive.
statement_list
: statement
| statement statement_list
;
This generates exactly the same symbol strings (i.e. language) as the previous
grammar.
Think about it: left recursion is a silly way to represent a list-like

The Eiffel Compiler tecomp version 0.20 has been released

helmut.bra...@gmx.net (Helmut) — Fri, 11 Nov 2009 15:24:25 UT

doc: [link]
download: [link]
== Bugfixes and improvements ==
- All type combinations in equality test ("=" and "~") shall now
work properly.
- Deep features now work for all types without any exceptions.
- The garbage collector has been reworked completely. Before,

help in locating old ACM conference proceedings

comp.compil...@h-rd.org (Marc) — Fri, 11 Nov 2009 11:16:30 UT

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

how to deal with left recursive?

vincent.f...@yahoo.com (vincent Feng) — Fri, 11 Nov 2009 03:10:46 UT

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) ?

Re: Placement of memory loads

kkylh...@gmail.com (Kaz Kylheku) — Fri, 11 Nov 2009 00:55:36 UT

Strange, old-schoolish approach to compiling. Loading from memory into
registers is a low level concept, variables high level.
Why not single-store-assignment or something?
How about generating a new temporary for each intermediate expression,
including loads. Then assign registers to temporaries.
x = x + 1;

Re: Placement of memory loads

cr88...@hotmail.com (BGB / cr88192) — Thu, 11 Nov 2009 22:13:48 UT

<snip>
<snip>
my strategy is simple enough and seems to be fairly effective:
I start in some initial state (locals are on stack, args are maybe on stack
or in regs);
if I need to synchronize, I may force everything back into memory;
if a need to load is encountered, a variable is loaded, and subsequently

Re: Switch statement code generation

ba...@freeuk.com (bartc) — Thu, 11 Nov 2009 22:11:44 UT

Hey, that's what I use.. invented independently of course.
'switch' for an indexed jump table, for case values in the range of 500 or
1000 (between minimum and maximum values).
'cswitch' for other case values, which just does a linear search.
Since these implement 'Switch' for an interpreted language, with the cswitch

Re: Switch statement code generation

wal...@bytecraft.com (Walter Banks) — Thu, 11 Nov 2009 20:12:30 UT

I have seen / have implemented if/else as either buried as part of the
switch body or as a separate if/else code block that jumps into the
switch body. The determining factor is the distance a conditional
branch can jump.
Regards,
Walter..

Re: Comparisons and Benchmarking

ba...@freeuk.com (bartc) — Thu, 11 Nov 2009 16:17:40 UT

I like to benchmark using low-level features, eg. integer operations, or
sometimes a bit of string processing.
This gives an quick idea of how quick a language (or implementation) really
is. This might be important if someone wants to add functionality which
isn't built-in and they don't particularly want to write it as a separate C

Placement of memory loads

tetra2...@googlemail.com (YuGr) — Thu, 11 Nov 2009 06:42:32 UT

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):