Comp.compilers newsgroup

TextTransformer 1.7.0: extended C++ code generation and 75% off

Thu, 2 Jul 2009 12:00:47 +0000 (UTC)

TextTransformer 1.7.0 has just been released. TextTransformer is a Windows IDE for building, debugging and executing parsers and translators. TextTransformer is made both for end-users and for C++ developers. This update is primarily dedicated to C++ code generation.

CALL FOR PAPERS - HiPEAC 2010 CONFERENCE - PISA - ITALY (Jan 10)

Wed, 1 Jul 2009 10:02:54 +0000 (UTC)

HiPEAC 2010 http://www.hipeac.net/conference/ The 5th International Conference on High Performance and Embedded Architectures and Compilers Pisa, ITALY, January 25-27, 2010 ==================================================================== C A L L F O R P A P E R S

Re: Generating optimal jump code for control flow instructions

torbenm@pc-003.diku.dk (Torben =?iso-8859-1?Q?=C6gidius?= Mogensen) — Thu, 25 Jun 2009 11:00:30 +0000 (UTC)

SeeScreen writes: > On Jun 14, 1:24 pm, SeeScreen wrote: >> I am estimating that generating an absolute minimal number of >> instructions, and short-circuiting the compound condtional at the

on definition of soundness and completeness

Thu, 25 Jun 2009 10:59:54 +0000 (UTC)

In the presentation of various program analysis techniques, we often read claims of "soundness" and "completeness" properties of those techniques. I often find the definitions I expected for these two concepts at odds with whatever is put down in the paper I am reading.

Re: Simple parsing problem

Thu, 25 Jun 2009 10:59:32 +0000 (UTC)

Eric Fowler wrote: > This should be easy practice for the experts .. > I am writing a bison grammar to parse strings coming from various > kinds of attached devices. > > One of the strings is of the form:

Re: Generating optimal jump code for control flow instructions

Tue, 23 Jun 2009 20:03:26 +0000 (UTC)

On Jun 14, 1:24 pm, SeeScreen wrote: > I am estimating that generating an absolute minimal number of > instructions, and short-circuiting the compound condtional at the > earliest possible point in the execution trace has probably already

Re: How are string literals represented internally by compilers?

Tue, 23 Jun 2009 20:02:42 +0000 (UTC)

glen herrmannsfeldt wrote: > I would not be surprised to see C compilers in Pascal, or Pascal > compilers in C, though I don't actually know of any. (I haven't > looked very hard.) Most of our C compilers are written in Delphi Pascal. It is a long

Re: Simple parsing problem

Tue, 23 Jun 2009 20:02:27 +0000 (UTC)

Eric Fowler wrote: > I am writing a bison grammar to parse strings coming from various > kinds of attached devices. > > One of the strings is of the form: > $FOO,field1,field2, 0,a,1,b,3,c, .... > > > where there are a variable number of paired fields of the form

Simple parsing problem

Mon, 22 Jun 2009 22:11:32 +0000 (UTC)

This should be easy practice for the experts .. I am writing a bison grammar to parse strings coming from various kinds of attached devices. One of the strings is of the form: $FOO,field1,field2, 0,a,1,b,3,c, .... where there are a variable number of paired fields of the form

Re: How are string literals represented internally by compilers?

Mon, 22 Jun 2009 22:10:48 +0000 (UTC)

Tony wrote: < I don't remember reading about how string literals are represented in any of < the books I have. Until I go back and scour those for the info (assuming it < is there), I'll ask here. How are string literals represented internally by