FAKE CONFERENCE CFP: SETP-10, Orlando, USA, July 2010

[This is a well known fake conference, in which they accept every paper submitted so long as you pay the $390 "conference fee". I'm passing i hisalong for the benefit of people who don't know about it. Google for fake conference for more info, including some MIT studentts who submitted a randomly generated paper. -John] It would be highly appreciated if you could share this announcement with your colleagues, students and individuals whose research is in software engineering, software testing, software quality assurance, software design and related areas. Call for papers: SETP-1

Reading comp.compilers

If you want to read comp.compilers, please see http://compilers.iecc.com, its home site with complete archives and good indexing.

Deadline Extended -- Eighth Workshop on Explicitly Parallel Instruction Computing Architectures and Compiler Technology (Toronto, Canada, April 24th)

Hi All, The submission deadline extended to February 22nd. More information is on the workshop's web-page: http://www.cgo.org/cgo2010/epic8/ Yours, Andrey Bokhanko CALL FOR PAPERS =============== Seventh Workshop on Explicitly Parallel Instruction Computing Architectures and Compiler Technology (EPIC-8) April 24, 2010 Toronto, Canada In conjunction with the IEEE/ACM International Symposium on Code Generation and Optimization (CGO) Res

Link grammars in Programming Language Development?

There has been a lot of research on Link grammars for natural language processing. They do pretty well, and link failures (grammar doesn't match input) seem well-correlated to very specific error conditions. So it occurred to me to wonder whether anyone's using them for programming language development? Or, specifically, whether there are any tools similar in spirit to Lex/Yacc/etc that use link grammars rather than production grammars? Bear

Writing Documentation

Hey guys I am in the middle of trying to document my language in the form of some small tutorial style things on its website. But I am also working on a kind of personal thesis on all of the work that's gone into its implementation and the language itself. But I am finding it difficult in what way to document all of this in a thesis style paper, are there any styles or things to think about when writing formally about all of this? Should i just write as if its like a tutorial into everything about my language? Or is there formal ways of doing this? --Phi

Seed7 Release 2010-02-07

Hello, I have released a new version of Seed7: seed7_05_20100207.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 solutions are more obvious. Seed7 is covered by the GPL (and LGPL for the Seed7 runtime library). Changelog: - The compiler (comp.sd7) was improved to support source level debugging with the option '-g' (comp.sd7 generates C programs with '#line' direc

Infinite look ahead required by C++?

What elements of C++ make it so hard to parse? Is it a weakness of compiler designs rather than a weakness of the language design? I've read somewhere that the language requires potentially infinite look ahead. Why? And how do compilers handle it? [It's ambiguous syntax. Others can doubtless fill in the details. -John]

An example LL(K) language that is not LL(K-1) ?

Hello, I don't think your assumption that any LL(k) can be transformed into an LL(k-1) is correct. The 'k' in LL(k) is assumed to be the supremum of lookahead symbols that you need in order to parse your input. So, suppose you have an LL(2) grammar, then you cannot convert it to an LL(1) since the LL(1) equivalent won't have disjoint FIRST/FOLLOW sets! I am not yet very experienced when it comes to compilers, so, if my answer is wrong correct me please! :-) Regards ../ck -- Chariton Karamitas Undergraduate Student Electrical Engineering and Computer Engineering Department F

Compiler positions available for week ending January 31

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 to a job offer, send mail to the author of the message. To submit a message, mail it to compilers@iecc.com. ------------------------------- Date: Thu, 28 Jan 2010 14:30:35 -0800 From: Dietmar Ebner <ebner@llnl.gov> Subject: Lan

An example LL(K) language that is not LL(K-1) ?

Hi! I think any LL(K) grammar without semantic actions can be transformed into an LL(1) grammar... But i found in resourses that LL(K) is stronger than LL(K-1) .... I search a lot for an example that can show this...but not found any and i am currently confusing about this issue. sue kelly

Modularize compiler construction?

It seems that the current compiler construction tools (at least in bison and flex) are still very primitive. Let's take the following example to explain what I mean. In the following book, let's say, section 6.1, mentioned various aspects of expression evaluation among many languages. If I want to construct a new language and its compiler by using a variety of features (e.g, whether to do expression arrangement or not as mentioned in 6.1.4) in these aspects, I don't see how to do so by easily composing different modules. It seems that there is a great semantic gap between what bison

Execution of a program in scripting language?

I'm looking for some references on how a scripting program run so that I can understand the runtime behavior better. But I don't find such a reference. For example, I checked Programming Language Pragmatics by Michael L. Scott. It seems only mentioned the programming language that needs compilation. Could somebody pointing me some reference on how a script is executed so that I can understand the runtime behavior better? Also, why the compiled code in java and perl are in general slower than the equivalent code in C or C++? [Because java and perl are compiled to internal forms tha

LAST CALL FOR PAPERS: TOOLS EUROPE 2010 (Malaga ES, Jun 10)

========================================================================== LAST CALL FOR PAPERS (Deadline: January 22, 2010) TOOLS EUROPE 2010 48th International Conference Objects, Models, Components, Patterns Co-located with *** International Conference on Model Transformation (ICMT 2010) *** *** International Conference on Software Composition (SC 2010) *** *** International Conference on Tests and Proofs (TAP 2010) ***

ANTLR 3.x Video Tutorial

Hey all! I've posted the first several parts of a new ANTLR 3.x video tutorial at http://javadude.com/articles/antlr3xtut The focus is on ANTLR features, though I plan to create a full compiler for the example language (and I'm tempted to do one on writing a Java compiler in Java for a more complex example ;) I'd love to get input from anyone who's interested in watching the vids. They're in 10-30 minute chunks. Enjoy! -- Scott

patenting compiler technology

Hi Perhaps a very different question than what gets posted but couldnt think of a better group than this. I am wondering if there is much value in patenting compiler algorithms.My reasons - One, its hard to discover their use. Two, algorithms esp heuristic based ones can be easily modified. Am I right about this ? Are there any successful/ good examples of patents in compilers ? Just for my curiosity -z [I can think of a handful of patents, all about register allocation. As far as I can tell, nobody's ever made money from them, mostly useful as defense against future patent t

Seed7 Release 2010-01-03

Hello, I have released a new version of Seed7: seed7_05_20100103.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 solutions are more obvious. Seed7 is covered by the GPL (and LGPL for the Seed7 runtime library). Changelog: - The chapter explaining operating system access in the manual was improved. - The "tarx.sd7" example program was improved to uncompress files

Welcome to the 25th year of comp.compilers

Back in January 1986, mod.compilers was created around the 1st of January, and I posted the first messages on the 3rd. Some of the early topics still show up (attribute grammars), some have receded into history (code generation for 64K segments, thank goodness.) I think it's the oldest active moderated group still with its original moderator. Now, back to another year of compiling. Index of the first month: http://compilers.iecc.com/comparch/index/1986-01 Regards, John Levine, comp.compilers moderator, johnl@iecc.com, http://compilers.iecc.com

Source to Source compilation - targeting C?

Anyone have suggestions for a way to take a fairly simple "custom" high level language (syntax and semantics) to target C as the output? (doesn't have to be readable C) By this I mean an existing backend that outputs C already exists for the "tool". The "tool" must be relatively easy to use assuming knowledge of BNF, grammars etc but not much in the way of code generation knowledge. Does the ROSE compiler framework do this? http://www.rosecompiler.org/ thanks

Seed7 Release 2009-12-20

Hello, I have released a new version of Seed7: seed7_05_20091220.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 solutions are more obvious. Seed7 is covered by the GPL (and LGPL for the Seed7 runtime library). Changelog: - The chapter explaining parameters in the tutorial of the manual was improved. - The chapter explaining priority and associativity in the manual

Generating code for state machines

I've been extending my C++ compiler to parse a syntax for defining state machines and now I'm beginning semantic analysis and code generation. There is a description on this page: http://ellcc.org/wiki/index.php/State_machines_and_Active_Classes. Can anyone point me to good references on state machine optimization and code generation? -Rich

Question on Part V in Let's Build a Compiler

I'm working through Let's Build a Compiler (http://compilers.iecc.com/crenshaw/ ) and I've run into a problem. The definition of Block after the first iteration of DoIf is: procedure Block; begin while not(Look in ['e']) do begin case Look of 'i': DoIf; 'o': Other; end; end; end; This seems to go into an infinite loop if Look is anything other than 'e', 'i', or 'o'. The definition after DoWhile is introduced works correctly: procedure Block; begin while not(Look in ['e', 'l']) do begin case Look of 'i': DoIf;

EPIC8 Call for Papers (Toronto, Canada, April 24th, 2010)

CALL FOR PAPERS =============== Eighth Workshop on Explicitly Parallel Instruction Computing Architectures and Compiler Technology (EPIC-8) April 24, 2010 Toronto, Canada http://www.cgo.org/cgo2010/epic8/ In conjunction with the IEEE/ACM International Symposium on Code Generation and Optimization (CGO) Researchers from both academia and industry are invited to share their latest research findings in the area of EPIC architectures

Seed7 Release 2009-12-06

Hello, I have released a new version of Seed7: seed7_05_20091206.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 solutions are more obvious. Seed7 is covered by the GPL (and LGPL for the Seed7 runtime library). Changelog: - The chapters explaining operating system access, primitive actions and exceptions in the manual were improved. - The codepages 708, 862, 864 an

Research about better integrating sets with languages

Am interested in pointers to any of the following computer language research or implementations: * Set abstractions and operations including infinite, realizing the impossibility of any complete implementation of such infinite sets, but undaunted in the desire to still implement, for example, many natural useful infinite sets, i.e. the set of integers, the set of X-collated lists, etc. * Use of set abstraction instead of more-rigid types/classes of most languages, i.e. a function is declared or determined to accept odd integers and return the octal string representations of intege

Release of SIRAlib

The SIRA framework is a graph theoretical approch four guaranteing the absence of spilling before instruction scheduling. The methods bounds the register requirement of a data dependence graph before instruction scheduling under resource constraints. Our register pressure reduction strategy is sensitive for both software pipelining (innermost loops) and acyclic scheduling (basic blocks and super-blocks). We consider processor architectures with multiple register type and we model delayed access times to registers. Our register pressure reduction method is distributed as a C independent