Below are the 20 most recent journal entries recorded in compilers_rss' LiveJournal:

[ << Previous 20 ]

Sunday, July 12th, 2009
3:40 pm	Compiler positions available for week ending July 12 12:41 12.07.2009 Compiler positions available for week ending July 12 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. read more at Comp.compilers newsgroup rss2lj (Comment on this)
3:40 pm	Re: Top-down deterministic parser? 12:41 12.07.2009 Re: Top-down deterministic parser? On Jul 8, 10:56 am, Curator1 <rsilv...@gmail.com> wrote: > Before you reinvent the wheel, swing bywww.antlr.organd check out > the excellent LL(*) construct there. I'm looking for an example of a top-down left most derivative parser, which has an unlimited look-ahead capacity, doesn't generate tons read more at Comp.compilers newsgroup rss2lj (Comment on this)
3:40 pm	Re: compiler back-end development? 12:40 12.07.2009 Re: compiler back-end development? mj wrote: > I am interested in working on code generation or optimization part of > an on going compiler development project. ... > If there is such a requirement in any open-source project or otherwise > (bug fixing for a start), I would very much like to join in. read more at Comp.compilers newsgroup rss2lj (Comment on this)
3:40 pm	Re: compiler back-end development? 12:40 12.07.2009 Re: compiler back-end development? On Fri, 10 Jul 2009 15:21:14 -0700 (PDT), mj wrote: > I am interested in working on code generation or optimization part of > an on going compiler development project. I have been working on [...] > If there is such a requirement in any open-source project or otherwise read more at Comp.compilers newsgroup rss2lj (Comment on this)
12:22 pm	compiler back-end development? 02:39 11.07.2009 compiler back-end development? I am interested in working on code generation or optimization part of an on going compiler development project. I have been working on compiler front-end level and i am familiar with intermediate language creation. Also worked with assemblers and linkers. Now I want to get read more at Comp.compilers newsgroup rss2lj (Comment on this)
12:22 pm	Re: Top-down deterministic parser? [09-05-060] 02:39 11.07.2009 Re: Top-down deterministic parser? [09-05-060] Before you reinvent the wheel, swing by www.antlr.org and check out the excellent LL(*) construct there. On Jul 6, 7:15 am, Alexander Morou <alexander.mo...@gmail.com> wrote: > I figured since the last poorly defined question garnered a null read more at Comp.compilers newsgroup rss2lj (Comment on this)
12:22 pm	Re: How to rewrite a regexp without word boundaries? 02:39 11.07.2009 Re: How to rewrite a regexp without word boundaries? On Jul 6, 10:43 pm, dave_140...@hotmail.com wrote: > > > I have been wondering, with limited success, how to rewrite a regexp > > > without word boundaries. > > > Why do you want to? Most likely, the answer is that your regexps are read more at Comp.compilers newsgroup rss2lj (Comment on this)
12:22 pm	Re: How to rewrite a regexp without word boundaries? 02:38 11.07.2009 Re: How to rewrite a regexp without word boundaries? dave_140390@hotmail.com writes: > I am actually writing a tool that takes regexps as input and > transforms them internally into NFAs/DFAs. It's been way too long since I played with NFAs/DFAs, but anyway: Since you are saying NFA, maybe this a somewhat theoretical exercise read more at Comp.compilers newsgroup rss2lj (Comment on this)
Thursday, July 9th, 2009
5:41 am	Re: How to rewrite a regexp without word boundaries? 10:16 07.07.2009 Re: How to rewrite a regexp without word boundaries? dave_140390@hotmail.com wrote: >>> I have been wondering, with limited success, how to rewrite a regexp >>> without word boundaries. > ...I am > actually writing a tool that takes regexps as input and transforms > them internally into NFAs/DFAs. ... I don't know how to read more at Comp.compilers newsgroup rss2lj (Comment on this)
5:41 am	Re: How to rewrite a regexp without word boundaries? 01:22 07.07.2009 Re: How to rewrite a regexp without word boundaries? > > I have been wondering, with limited success, how to rewrite a regexp > > without word boundaries. > > Why do you want to? Most likely, the answer is that your regexps are > getting too clever and thus too unreadable/bug-prone, so you should read more at Comp.compilers newsgroup rss2lj (Comment on this)
5:41 am	Re: Top-down deterministic parser? [09-05-060] 01:22 07.07.2009 Re: Top-down deterministic parser? [09-05-060] Hello, I figured since the last poorly defined question garnered a null response, I'd take my time to further understand the problem so I could ask it in a more appropriate manner. I'm curious if anyone here can point me in the right direction to information about a read more at Comp.compilers newsgroup rss2lj (Comment on this)
5:41 am	Re: on definition of soundness and completeness 13:50 06.07.2009 Re: on definition of soundness and completeness On Jun 23, 11:58 pm, Bin Xin <b...@acm.org> wrote: > 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 read more at Comp.compilers newsgroup rss2lj (Comment on this)
5:41 am	Seed7 Release 2009-07-05 13:49 06.07.2009 Seed7 Release 2009-07-05 Hello, I have released a new version of Seed7: seed7_05_20090705.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 read more at Comp.compilers newsgroup rss2lj (Comment on this)
5:41 am	Re: How to rewrite a regexp without word boundaries? 23:54 05.07.2009 Re: How to rewrite a regexp without word boundaries? dave_140390@hotmail.com writes: > I have been wondering, with limited success, how to rewrite a regexp > without word boundaries. Why do you want to? Most likely, the answer is that your regexps are getting too clever and thus too unreadable/bug-prone, so you should read more at Comp.compilers newsgroup rss2lj (Comment on this)
5:41 am	How to rewrite a regexp without word boundaries? 17:29 05.07.2009 How to rewrite a regexp without word boundaries? Hi, I have been wondering, with limited success, how to rewrite a regexp without word boundaries. According to http://www.perl.com/doc/manual/html/pod/perlre.html: In addition, Perl defines the following: \w Match a "word" character (alphanumeric plus "_") read more at Comp.compilers newsgroup rss2lj (Comment on this)
Sunday, July 5th, 2009
12:01 pm	TextTransformer 1.7.0: extended C++ code generation and 75% off 16:00 02.07.2009 TextTransformer 1.7.0: extended C++ code generation and 75% off 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. read more at Comp.compilers newsgroup rss2lj (Comment on this)
Wednesday, July 1st, 2009
11:22 pm	CALL FOR PAPERS - HiPEAC 2010 CONFERENCE - PISA - ITALY (Jan 10) 14:02 01.07.2009 CALL FOR PAPERS - HiPEAC 2010 CONFERENCE - PISA - ITALY (Jan 10) 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 read more at Comp.compilers newsgroup rss2lj (Comment on this)
Thursday, June 25th, 2009
10:02 pm	Re: Simple parsing problem 14:59 25.06.2009 Re: Simple parsing problem Eric Fowler <eric.fowler@gmail.com> 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: read more at Comp.compilers newsgroup rss2lj (Comment on this)
10:02 pm	Re: Generating optimal jump code for control flow instructions 00:03 24.06.2009 Re: Generating optimal jump code for control flow instructions On Jun 14, 1:24 pm, SeeScreen <seescr...@gmail.com> 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 read more at Comp.compilers newsgroup rss2lj (Comment on this)
10:02 pm	Re: How are string literals represented internally by compilers? 00:02 24.06.2009 Re: How are string literals represented internally by compilers? 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 read more at Comp.compilers newsgroup rss2lj (Comment on this)