comp.compilers Google Group

Compiler positions available for week ending July 20

compil...@iecc.com (comp.compilers) — Sun, 20 Jul 2008 08:00:01 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: Parser question

m...@gustavus.edu (Max Hailperin) — Sun, 20 Jul 2008 01:17:27 UT

....
No, incorrect. Take a look at what statements in the code assign a
value to the variable "left". To know what is returned by "return
left", you need to look at what the most recent assignment to that
variable is, at the time of the return statement. Except in the case
when the expression is a single term (with no '+' or '-' following

Implementing data flow analysis in single pass parser

madhusudhan...@gmail.com (Madhu-K7) — Fri, 18 Jul 2008 18:03:03 UT

Hi all,
I am new to compiler writing and need some help in implementing some
of the classical algorithms for data flow analysis given in the Dragon
book. I am trying to come up with a method to synthesize pointers in
the C program to VHDL or Verilog so that it can be translated into
hardware circuits. For this I should be able to first identify

State of the Art

peter.deus...@fokus.fraunhofer.de (Peter) — Fri, 18 Jul 2008 14:40:29 UT

Hi all,
I havn't worked in compiler construction and programming languages for
some years, but now I have a chance to return to this area. I would
like to find out what happened while I was absent.
So, let me ask the following questions:
- In your opinion, what are the greatest advances in compiler
construction in the last ten years?

Re: Parser question

mik...@sesamgames.com (Mikael Ström) — Wed, 16 Jul 2008 17:48:09 UT

Thanks Max for your highly enlightening answer. I really learned a lot
from your explanation. The dragon book is quite abstract, and it's not
that easy to see how things could fit together.
Interesting, never thought about that. I'm using GCC at this time, but
the idea is to (one day) let the compiler compile itself so i can

Re: About Mapping and Scheduling

kama...@hp.com (kamal) — Tue, 15 Jul 2008 13:56:23 UT

there are some parallel constructs defined by various languages like
fortran and C. There is UPC (unified parallel C) and HPF (high
performance fortran) which provide you with the desired constructs.
Instead of providing a task graph, you would need to put in parallel
those parts of code, which will end up as siblings in a task graph,

Re: Parser question

drdiettri...@aol.com (Hans-Peter Diettrich) — Tue, 15 Jul 2008 10:42:11 UT

Mike (News) schrieb:
One method would "flatten" the operator hierarchy, to essentially only
one unary and binary operator class, covering all operators:
moreterms -> binop term | epsilon
Then something like an internal list (usually stack) of operators and
terms is produced by moreterms, that is "folded" into an tree before

Re: Parser question

m...@gustavus.edu (Max Hailperin) — Sun, 13 Jul 2008 13:12:44 UT

There are well-known algorithms for tail-recursion elimination, but
using one of the fully-general algorithms is unlikely to help you much
getting over your hurdle of developing an intuition for the process.
I think you would be better off with what you ask for later in your
post, an example. Your old dragon book shows an example of manually

Re: Parser question

avron20...@yahoo.com (Aeran) — Sun, 13 Jul 2008 11:33:06 UT

You probably want to identify tail recursion. If nothing is built up on
the stack while recursing it is possible to avoid the recursive call. If
you have a grammar like: a -> Ba|N then you can when implementing the
parser instead of writing it like:
sub a()
matchB
if (look == 'N') matchN else a()

Compiler positions available for week ending July 13

compil...@iecc.com (comp.compilers) — Sun, 13 Jul 2008 08:00:03 UT

Second CfP: First Workshop on Hot Topics in Software Upgrades (HotSWUp 2008, Nashville, Oct 08)

ineamtiu...@gmail.com — Fri, 11 Jul 2008 19:49:46 UT

CALL FOR PAPERS
HotSWUp 2008: First International Workshop on Hot Topics in Software
Upgrades
(co-located with OOPSLA 2008)
Nashville, Tennessee
October 19--23, 2008
[link]

About Mapping and Scheduling

milla....@gmail.com — Fri, 11 Jul 2008 13:42:15 UT

Hi,everyone,
Does there exist any compilers with these functions or addressing the
following issues:
1.Given a task graph generated from program, allocate all the tasks,
or to say "mapping the tasks to processors"
2.the compilers do some task scheduling work according to some
parameters(such as task execution time,etc) to minimize the cost

Parser question

m...@sesamgames.com (Mike (News)) — Fri, 11 Jul 2008 11:21:05 UT

I blow the dust of my old Dragon book and started to read. I got some
inspiration to make a very simple (read subset of a) C compiler.
The implementation is a predictive parser that construct a syntax tree
holding both expression and statements. As the grammar is recursive,
so is the implementation. However, i wish to find some shortcuts to

Seed7 Release 2008-07-07

thomas.mer...@gmx.at — Mon, 07 Jul 2008 21:50:04 UT

Hello,
I have released a new version of Seed7: seed7_05_20080707.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

Re: How to construct a grammar?

quinn_jackson2...@yahoo.ca (Quinn Tyler Jackson) — Mon, 07 Jul 2008 15:04:46 UT

"Michael Schuerig" <mich...@schuerig.de> replied to Chris F Clark:
It may or may not be what you're looking for, but some years ago I
wrote a small book on parsing with Visual Parse++ for Sand Stone, and
the second chapter of the book goes into some detail on the craft of
extracting a grammar from sometimes informal sources. You can grab