COMPGROUPS.NET | Post Question | About | Groups | Contact | Register | Login



comp soft-sys matlab (18490)

comp os linux advocacy (5156)

comp soft-sys sas (3803)

comp soft-sys math mathematica (2916)

comp lang python (2903)

comp lang ruby (2550)

comp text tex (1729)

comp sys mac advocacy (1658)

comp lang c++ (1416)

comp lang javascript (1219)

comp lang c (1196)

comp lang perl misc (1191)

comp lang java programmer (925)

comp dsp (909)

comp sys mac system (890)

comp lang tcl (872)

comp databases ms-access (760)

comp arch fpga (749)

comp lang idl-pvwave (726)

comp software shareware announce (702)

comp lang php (697)

comp lang lisp (682)

comp sys sun announce (659)

comp arch embedded (626)

comp sys mac apps (609)

comp sys ibm ps2 hardware (545)

comp lang c++ moderated (524)

comp lang fortran (524)

comp unix shell (521)

comp os plan9 (514)

comp os linux misc (513)

comp unix solaris (500)

comp databases oracle server (494)

comp sys ibm pc games war-historical (485)

comp lang python announce (483)

comp os ms-windows programmer win32 (476)

comp databases mysql (412)

comp sys cbm (408)

comp dcom sys cisco (407)

comp arch (306)

comp sys ibm pc games action (301)

comp databases informix (274)

comp lang clipper visual-objects (267)

comp os vms (263)

comp lang perl announce (238)

comp lang xharbour (229)

comp graphics apps gnuplot (224)

comp realtime (216)

comp soft-sys ace (215)

comp lang ada (213)

comp protocols nfs (207)

comp protocols snmp (204)

comp parallel (202)

comp sys acorn announce (196)

comp protocols tcp-ip domains (193)

comp sys ibm pc hardware systems (191)

comp unix internals (187)

comp infosystems www browsers misc (184)

comp misc (182)

comp publish cdrom software (182)

comp dcom cabling (174)

comp mail mime (169)

comp std announce (169)

comp ai fuzzy (168)

comp ai edu (166)

comp soft-sys stat spss (156)

comp protocols kerberos (155)

comp databases filemaker (155)

comp sys apple2 (153)

comp admin policy (151)

comp databases postgresql committers (150)

comp databases ibm-db2 (149)

comp databases ms-sqlserver (131)

comp protocols dicom (129)

comp unix programmer (128)

comp security misc (123)

comp unix bsd freebsd misc (120)

comp graphics visualization (117)

comp cad cadence (117)

comp databases olap (116)

comp apps spreadsheets (114)

comp databases postgresql general (114)

comp lang vhdl (113)

comp lang java help (113)

comp ai neural-nets (112)

comp ai (111)

comp ai games (110)

comp dcom telecom (109)

comp client-server (108)

comp os linux announce (105)

comp cad microstation (105)

comp databases oracle marketplace (105)

comp soft-sys math scilab (102)

comp databases progress (102)

comp os linux networking (101)

comp database oracle (100)

comp graphics api opengl (99)

comp ai genetic (98)

comp protocols dns bind (97)

comp compilers (97)


comp.compilers Post New
Items(97) /2 Next >> Last >|
Subject Posted Replies From
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

2/22/2010 3:22:53 PM 0 James Heralds <jmhera...@gmail.com>
Seed7 Release 2010-02-21

Hello, I have released a new version of Seed7: seed7_05_20100221.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 generation of '#line' directives in the compiler (comp.sd7) was improved. This allows better references to Seed7 source lines during debu

2/21/2010 9:39:33 PM 0 tm <thomas.mer...@gmx.at>
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.

2/18/2010 4:54:02 PM 0 comp.compilers <u...@compgroups.net/>
Mix of executables compiled w/ xlc_r v6 & v8

I do have a lot of executables and libraries compiled with xlc_r v6 in AIX 5.2. Now I can't get a new licence for v6 and I'll have to go to v8. Can someone tell if the v6 compiled libraries/executables work seamlessly with the new v8 compiled ones?

2/18/2010 4:12:21 PM 0 Rob. <u...@compgroups.net/>
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

2/16/2010 11:23:18 AM 0 andreyb <andreybokha...@gmail.com>
Call for papers: Tenth IEEE International Working Conference on Source Code Analysis and Manipulation (Romania, Sep 10)

Call for Papers and Tool Demo Proposals - SCAM 2010 Tenth IEEE International Working Conference on Source Code Analysis and Manipulation 12th-13th September 2010, Timisoara, Romania, Co-located with ICSM 2010 http://www2010.ieee-scam.org/ Sponsored by IEEE CS (pending) In cooperation with: - Semantic Designs Inc., Austin, TX, USA - Univ. "Politehnica" Timisoara, Romania - Centre for Research in Evolution, Search and Testing (CREST), King's College London, UK ---------------- Conference aims: ---------------- The aim of this working conference is to bring together rese

2/14/2010 1:37:28 PM 0 Jurgen Vinju <jur...@vinju.org>
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

2/13/2010 11:15:27 PM 0 Ray <b...@sonic.net>
Limits of regular languages

Hi, I have been playing around with regular expressions for the last few weeks, implementing the automaton generation algorithms from the dragon book and taking at the existing tools. Now a few questions have sprung, that I haven't been able to answer: Is there a way implement the usual longest-match behaviour of a scanner with a DFA without any backtracking mechanisms, meaning is that behaviour strictly regualr or not? I know that backreferences make a language non-regular (more about that later), but what forms of capture are regualr? Are there any tools out there who always

2/11/2010 9:36:06 PM 5 e0726905 <e0726...@student.tuwien.ac.at>
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

2/10/2010 1:43:39 PM 2 Philip Herron <herron.phi...@googlemail.com>
How to Write Your Own Compiler with LLVM

Hi, So sorry if the question seems basic, but would like an paper or another document equivalent to the tutorial below: How to Write Your Own Compiler http://llvm.org/ProjectsWithLLVM/#compilerwrite But more focused and a little more advanced. And by the way, my goal is to use the LLVM. Thanks. Best Regards. A.F.

2/10/2010 3:56:03 AM 2 "A.F." <alberto.fabi...@gmail.com>
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

2/7/2010 11:26:39 PM 0 tm <thomas.mer...@gmx.at>
Making semicolons optional moves LALR(1) language to LALR(2)?

For a hypothetical programming language that is LALR(1) and uses semicolons as statement terminators, would a change that makes semicolons only required on multi-statement lines and using the newline as an implicit statement terminator make the language LALR(2)? [Seems to me that it makes a newline syntactically equivalent to a semicolon, unless you have some plan for multi-line statements you haven't mentioned. -John]

2/6/2010 4:32:31 AM 2 "ng2010" <ng2...@att.invalid>
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]

2/6/2010 4:27:54 AM 27 "ng2010" <ng2...@att.invalid>
Re: An example LL(K) language that is not LL(K-1) ?

The following is the reference for the original paper on LL(k). It should have a proof of the superset relationship of k to k-1 for the LL languages. Rosenkrantz, D.J. and R.E. Stearns (1970). "Properties of Deterministic Top-Down Grammars," Inf. and Control, 17 (3), pp 226-256. You may be thinking of the fact that LR(k) is reducible to LR(1). Not so for LL because it cannot postpone parsing decisions, making it more dependent on the lookahead than LR. Example: S -> a A a S -> b A b a A -> b A -> Can you convert this to LL(1)? More info about LL(k) can be found in th

2/5/2010 8:47:23 PM 1 SLK Mail <sl...@cox.net>
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

2/1/2010 12:58:42 PM 11 Chariton Karamitas <chaka...@auth.gr>
regular expression generation

I am building a finite state machine generator. It currently has the ability to generate random regular expressions for testing the engine but the generation of random character classes (i.e. expressions of the form [ab-ew-zA-CD;@&]) is not supported. I was wondering if anyone has done this and can give me ideas on the best way to do so. Some user level control of the randomization process is desired. For example with binary operators I can make assignments as to the probabilities of each binary operator being used. Regards, Ralph Boland P.S. I am also designing (no

1/31/2010 6:50:14 PM 2 Ralph Boland <rpbol...@gmail.com>
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

1/31/2010 8:59:40 AM 0 "comp.compilers" <compil...@iecc.com>
CodeView specification wanted

Hi, I cannot seem to find the CodeView 4 and/or 5 specifications anywhere. I am writing a COFF object module generator and need to generate debuggin information. Many thanks in advance, Aaron

1/30/2010 7:04:56 PM 2 "Aaron Gray" <ang.use...@gmail.com>
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

1/26/2010 12:30:10 AM 1 klyjikoo <klyji...@gmail.com>
Compiler positions available for week ending January 24

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: Fri, 22 Jan 2010 16:25:38 +0100 From: Wim Yedema <wim.yedema@siliconhive.com> Sub

1/24/2010 8:59:39 AM 0 "comp.compilers" <compil...@iecc.com>
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

1/23/2010 11:10:38 PM 11 Peng Yu <pengyu....@gmail.com>
Prefix, infix and function-call and their implications in embedded language readability

Consider the following three expressions, which are valid C, mit- scheme and Mathematica expressions. There are of course many other expressions that express the same thing in other languages, or in the same language but other different ways. 3+2*5>7 (> (+ 3 (* 2 5)) 7) Greater[Plus[3,Times[2,5]],7] Apparently, at least to me, the first expression is the most readable. One possible reason is that we learn this algebraic notation much earlier than the other two, which is in analogy to that we can respond to the native language (say, English) much faster than to a second language

1/21/2010 4:53:57 AM 5 Peng Yu <pengyu....@gmail.com>
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

1/18/2010 3:23:29 PM 6 Peng Yu <pengyu....@gmail.com>
Detailed algorithms on inline optimization

I'm looking for detailed algorithms on inline optimization. But I only find some document like http://gcc.gnu.org/onlinedocs/gcc/Optimize-Options.html, which describes different ways of doing inline. Is 'inline' so trivial that it is not worthwhile to explain how it is implemented? If there is some reference that describe inline in details, could somebody let me? [Unless you're trying to in-line a recursive function, it's pretty straightforward. -John]

1/18/2010 3:09:47 PM 18 Peng Yu <pengyu....@gmail.com>
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) ***

1/18/2010 8:36:07 AM 0 Lorenzo Bettini <bett...@dsi.unifi.it>
Seed7 Release 2010-01-17

Hello, I have released a new version of Seed7: seed7_05_20100117.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 seed7_05.s7i library was improved to support union (|), intersection (&), difference (-) and symmetric difference (><) for sets implement

1/17/2010 8:37:58 PM 0 tm <thomas.mer...@gmx.at>
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

1/13/2010 6:00:42 PM 0 Scott Stanchfield <sc...@javadude.com>
Compiler positions available for week ending January 10

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: Wed, 06 Jan 2010 14:00:18 -0800 Subject: Compiler tools job at Fortify Software (S

1/10/2010 8:59:40 AM 0 "comp.compilers" <compil...@iecc.com>
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

1/5/2010 6:19:49 AM 5 zeng jane <zjan...@gmail.com>
Release announcement: Intel(R) Software Development Emulator version 2.94

Release announcement: Intel(R) Software Development Emulator version 2.94 for SSE4, AES, AVX and FMA. Intel SDE is an user-level functional emulator for new instructions. It is built upon the Pin dynamic binary instrumentation system and runs Windows and Linux. The Intel "What-if" web page for Intel SDE is here: http://www.intel.com/software/sde/

1/4/2010 3:47:14 PM 0 "Charney, Mark" <Mark.Char...@intel.com>
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

1/3/2010 8:44:46 PM 0 tm <thomas.mer...@gmx.at>
How to compute a regex which is the difference between two regexes?

Suppose that I have two regular sets A and B that are generated by two regular expressions. I'm wondering if there is always a regular expression that can generated the difference between the two sets, i.e., A-B. If there is such regular expression, is there a mechanical way to generated such regular expression. http://www.pearsonhighered.com/educator/academic/product/0,1144,0321462254,00.html I looked through Section 3.4 Algebraic laws for regular expressions of Introduction to Automata Theory, Languages, and Computation, by Hopcroft, Motwani and Ullman (2nd edition). But I don't

1/3/2010 4:20:05 PM 8 Peng Yu <pengyu....@gmail.com>
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

1/1/2010 4:22:04 PM 0 "Comp.compilers" <compilers-requ...@iecc.com>
Fat references

I've been working on a project called HLVM in my spare time: http://forge.ocamlcore.org/projects/hlvm One goal was to have fast interop with C, so I didn't want to copy the traditional style of placing a header with GC metadata before every value in the heap because that would require C arrays to be copied just to add this header. I couldn't be bothered to allocate a separate header so, instead, I pulled the GC metadata into the reference. So my references are now "fat": a quadword of pointer to run-time type, array length or union type tag, pointer to mark state and pointer to t

12/29/2009 5:55:59 PM 35 Jon Harrop <...@ffconsultancy.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

12/28/2009 3:13:24 PM 3 Mark Txx <mark...@yahoo.com>
Recent references on language design?

http://www.paulgraham.com/langdes.html I'm interested in understanding the ingredients that are important in designing a language that will be successful. I found some discussions in the above webpage. Some points are interesting to me. But it was written in 2001 and may not be covers anything that are important. I'm wondering if there are more detailed and recent references and research on language design (not on compiler implementation issues).

12/21/2009 3:16:19 AM 2 Peng Yu <pengyu....@gmail.com>
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

12/20/2009 9:49:40 PM 0 tm <thomas.mer...@gmx.at>
Introducing FALIB, a compiler compiler

I just finished the first release of my very own compiler compiler, similar to Yacc or Bison. You can find the C++ source code at the top of this page: http://code.google.com/p/vm64dec/downloads/list It is called RULECOM, the Rule Compiler and uses FALIB, which stands for Finite Automaton LIBrary (included). It accepts EBNF-style grammars and then converts each rule into an NFA, which has lambda loops and transitions removed, then is converted to a DFA for quick parsing. I made heavy use of DFA theory in the parser. Nonterminals in the grammar are treated like regular symbols, al

12/19/2009 11:54:22 AM 0 Willow <wrschlan...@gmail.com>
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

12/15/2009 2:27:59 PM 1 Richard Pennington <r...@pennware.com>
Language Design n Compiler

hi i'm new to compilers and language design. i want to write a simple language and its grammer- with elementary operations say addition , subtraction,printing etc. and corresponding compiler for that language- how and from where should i to start( what all know how is required to design a language.). plz point out the steps involved in the whole process. [You can start with the list of compiler books in the FAQ. -John]

12/14/2009 7:44:30 PM 3 honey sran <sran.harshd...@gmail.com>
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;

12/14/2009 6:27:01 PM 0 Steve Nicholson <st...@steveandmimi.com>
CfP: MCSoC-10 (San Diego, Sep 10)

================================================================== MCSoC-10 5th International Symposium on Embedded Multicore Systems-on-Chip in conjunction with The 39th International Conference on Parallel Processing (ICPP-2010) San Diego, USA, September 13-16, 2010 http://web-ext.u-aizu.ac.jp/~benab/conferences/mcsoc-10/ ==============================

12/11/2009 1:39:24 AM 0 Arquimedes Canedo <can...@gmail.com>
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

12/7/2009 12:50:49 PM 0 andreyb <andreybokha...@gmail.com>
Eliminate break/continue statements in loops

Hi, I am currently working on a optimization algorithm. So far it works on simple programs with a linear control flow, if-else-constructs, simple while loops and simple do-while loops. The constructs may be nested. With a simple loop I mean a loop which does not make use of continue, break or even goto. I know that irreducible CFGs can be transformed to reducible ones by node splitting. So I don't have to worry about cross edges if I implement that. But my question is whether there has been done some research to eliminate continue and break statements out of loops so an equivalen

12/7/2009 12:32:13 PM 2 =?ISO-8859-1?Q?Roland_Lei=DFa?= <roland.lei...@googlemail.com>
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

12/6/2009 10:19:07 PM 0 tm <thomas.mer...@gmx.at>
LALR parsing

Hi, Nowadays, the subject of LALR is well understood. I want to implement a LALR parser for an arbitrary grammar (many common point to yacc, however different). I have read many classical articles and books. Among my studies: - dragon book - parsing techniques a practical guide, D Grune (the best that I read) - many classical articles in the style Frank DeRemer and Thomas Pennello. Efficient Computation of LALR(1) Look-Ahead Sets, etc. However, I did read that these methods are not the most fast. The fastest methods use matrix multiplications, etc. In the book of Grune is

12/4/2009 3:26:44 PM 8 "A. Soare" <alins...@voila.fr>
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

12/4/2009 3:11:16 PM 1 Bennu Strelitzia <bennu.strelit...@gmail.com>
Dynamic/static instrumentation tool for Java

Hi, Can anyone point me to some stable tools for instrumenting Java programs/bytecodes? I am looking for both dynamic/static instrumentation tools. Thanks in advance, Arnab

12/4/2009 12:29:07 PM 1 Arnab De <arnabd...@gmail.com>
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

12/1/2009 8:44:09 AM 0 Sid Touati <SidTou...@inria.fr>
Release of RSlib 1.1

Register saturation (RS) is the exact maximal register need of all valid schedules of a data dependence graph. Its optimal computation is NP-complete. This report proposes two variants of heuristics for computing the acyclic RS of directed acyclic graphs (DAG of basic blocks and super-blocks). The first one improves the previous greedy-k heuristic in terms of approximating the RS with equivalent computation times. The second heuristic is faster, has better RS approximation than greedy-k, but scarifies the computation of saturating values. Our RS computation methods are distributed as a

11/30/2009 3:28:11 PM 0 Sid Touati <SidTou...@inria.fr>

Pages: 2









Newest Articles

Color marker recognition
10 min. 53 sec. ago

Neural Network indentification - help
10 min. 54 sec. ago

pdejmps and errf functions
13 min. 39 sec. ago

guide FOR SNR CALCULATION
19 min. 24 sec. ago

Virtual Inheritance
21 min. 26 sec. ago